Quantum lower bounds by quantum arguments
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 636-643
- https://doi.org/10.1145/335305.335394
Abstract
No abstract availableAll Related Versions
This publication has 10 references indexed in Scilit:
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variablesInformation Processing Letters, 2000
- The quantum query complexity of approximating the median and related statisticsPublished by Association for Computing Machinery (ACM) ,1999
- On the power of quantum computationPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum vs. classical communication and computationPublished by Association for Computing Machinery (ACM) ,1998
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Quantum cryptanalysis of hash and claw-free functionsACM SIGACT News, 1997
- A fast quantum mechanical algorithm for database searchPublished by Association for Computing Machinery (ACM) ,1996
- On the distributional complexity of disjointnessTheoretical Computer Science, 1992
- CREW PRAMs and Decision TreesSIAM Journal on Computing, 1991