The quantum query complexity of approximating the median and related statistics
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 384-393
- https://doi.org/10.1145/301250.301349
Abstract
No abstract availableAll Related Versions
This publication has 7 references indexed in Scilit:
- Tight Bounds on Quantum SearchingFortschritte der Physik, 1998
- Quantum vs. classical communication and computationPublished by Association for Computing Machinery (ACM) ,1998
- A framework for fast quantum mechanical algorithmsPublished by Association for Computing Machinery (ACM) ,1998
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- A fast quantum mechanical algorithm for database searchPublished by Association for Computing Machinery (ACM) ,1996
- On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)Published by Association for Computing Machinery (ACM) ,1992
- Time bounds for selectionJournal of Computer and System Sciences, 1973