On the power of Ambainis lower bounds
Author:
- Shengyu ZhangSZShengyu Zhang
- 1 June 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 339 (2-3) , 241-256
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Quantum query algorithms and lower bounds2007
- Quantum Walk Algorithm for Element Distinctness2004
- A lower bound on the quantum query complexity of read-once functionsJournal of Computer and System Sciences, 2004
- Quantum communication complexity of symmetric predicatesIzvestiya: Mathematics, 2003
- Complexity measures and decision tree complexity: a surveyTheoretical Computer Science, 2002
- Quantum Lower Bounds by Quantum ArgumentsJournal of Computer and System Sciences, 2002
- Quantum lower bounds by polynomialsJournal of the ACM, 2001
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992