Tight adversary bounds for composite functions

@inproceedings{Hyer2005TightAB,
  title={Tight adversary bounds for composite functions},
  author={Peter H\oyer},
  year={2005}
}
The quantum adversary method is a versatile method for provi ng lower bounds on quantum algorithms. It yields tight bounds for many computational p roblems, is robust in having many equivalent formulations, and has natural connections to cl assical lower bounds. A further nice property of the adversary method is that it behaves very well ith respect to composition of functions. We generalize the adversary method to include co sts—each bit of the input can be given an arbitrary positive cost… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
7 Extracted Citations
3 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-3 of 3 references

The quantum adversary method and formula size lower bounds Lower bounds for randomized and quantum query complexity using Kolmogorov arguments

  • R. Mathias.
  • 2004

Similar Papers

Loading similar papers…