Fast amplification of QMA

Quantum Information and Computation

Volumn 9, Issue 11-12, 2009, Pages 1053-1068

  Nagaj, Daniel ^a,b   Wocjan, Pawel ^c   Zhang, Yong ^c  

^a INSTITUTE OF PHYSICS   (Slovakia)

^b Quniverse   (Slovakia)

^c University of Central Florida   (United States)

Author keywords

Amplification; Jordan's lemma; Phase estimation; QMA; Witness reusing

Indexed keywords

JORDAN LEMMA; PHASE-ESTIMATION; QMA; QUANTUM WALK; WITNESS-REUSING;

EID: 71549143511     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic9.11-12-8     Document Type: Article

References (21)

1. C. Marriott and J.Watrous, Quantum Arthur-Merlin games, Computational Complexity, 14(2):122152 (2005).
2. D. Poulin, P. Wocjan, Preparing ground states of quantum many-body systems on a quantum computer, Physical Review Letters 102:130503 (2009). arXiv:0809.2705
3. M. R. Garey, D. S. Johnson, Computers and Intractability. A Guide to the Theory of NPCompleteness, W. H. Freeman and Company, San Francisco, CA (1979).
4. A. A. Razborov, S. Rudich, Natural proofs, Journal of Computer and System Sciences 55: 2435. doi:10.1006/jcss.1997.1494 (1997).
5. P. Shor, Polynomial- Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), Santa Fe, NM, Nov. 20-22 (1994).
6. P. Wocjan, J. Yard, The Jones Polynomial: Quantum Algorithms and Applications in Quantum Complexity Theory, Quantum Information and Computation 8(1&2):147-180 (2008).
7. O. Goldreich, On promise Problems, Technical Report 18, Electronic Colloquium Computational Complexity (2005), http://eccc.hpi-web.de/eccc-reports/ 2005/TR05-018/index.html
8. D. Janzing, P. Wocjan, A Simple PromiseBQP-complete Matrix Problem, Theory of Computing, 3:61-79 (2006).
9. A. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation, American Mathematical Society (2002).
10. J. Watrous, Succinct quantum proofs for properties of finite groups, In Proc. IEEE FOCS, pp 537-546 (2000), arXiv:cs.CC/0009002.
11. A. Yu. Kitaev, Quantum measurements and the Abelian stabilizer problem, arXiv:quantph/0511026 (1995).
12. S. Bravyi, Efficient algorithm for a quantum analogue of 2-SAT, arXiv:quant-ph/0602108, 2006.
13. O. Goldreich, D. Zuckerman, Another proof that BPP C PH (and more), ECCC TR97-045 (1997)
14. S. Zachos, M. Fürer, Probabilistic quantifiers vs. distrustful adversaries, In Proc. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 443-455, Springer-Verlag, 1987.
15. S. Aaronson, On perfect completeness for QMA, Quantum Information & Computation, No.9, Vol.1&2, 81-89 (2009).
16. C. Jordan, Bulletin de la S. M. F. 3, 103 (1875).
17. M. Szegedy, Quantum Speed-up of Markov Chain Based Algorithms, In Proc. of 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 32-41, 2004.
18. M. A. Nielsen, I. L. Chuang, Quantum Information and Computation, Cambridge University Press, Cambridge, UK (2000).
19. M. Jerrum, L. Valiant and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, vol.43, issue 2-3, pp. 169-188, 1986.
20. L. Grover, A fast quantum mechanical algorithm for database search, In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), May 1996, pp. 212-219 (1996).
21. O. Regev, Witness-preserving QMA amplification, Quantum Computation Lecture notes, Spring 2006, Tel Aviv University (2006) http://www.cs.tau.ac.il/- odedr/goto.php?name=ln-q-qma&link=teaching/quantum-fall-2005/ln/qma.pdf.