The detectability lemma and quantum gap amplification:Extended Abstract

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 417-426

  Aharonov, Dorit ^a   Arad, Itai ^b   Landau, Z Eph ^b   Vazirani, Umesh ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Detectability lemma; Gap amplification; Local hamiltonians; PCP; QMA; Quantum computation

Indexed keywords

DETECTABILITY LEMMA; GAP AMPLIFICATION; LOCAL HAMILTONIANS; PCP; QMA; QUANTUM COMPUTATION;

AMPLIFICATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; HILBERT SPACES; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY; THEOREM PROVING;

HAMILTONIANS;

EID: 70350683766     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536472     Document Type: Conference Paper

References (17)

1. D. Aharonov, I. Arad, Z. Landau, and U. Vazirani. The Detectability Lemma and Quantum Gap Amplification. arXiv:0811.3412, 2008.
2. M. Ajtai, J. Komlos, and E. Szemeredi. Deterministic simulation in LOGSPACE. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 132-140. ACM New York, NY, USA, 1987.
3. S. Arora and B. Barak. Computational Complexity: A Modern Approach. to appear: http://www. cs. princeton.edu/theory/complexity.
4. S. Bravyi. Efficient algorithm for a quantum analogue of 2-SAT. quant-ph/0602108, 2006.
5. S. Bravyi, D. DiVincenzo, D. Loss, and B. Terhal. Quantum Simulation of Many-Body Hamiltonians Using Perturbation Theory with Bounded-Strength Interactions. Physical Review Letters, 101(7):70503, 2008.
6. I. Dinur. The pcp theorem by gap amplification. J. ACM, 54(3):12, 2007.
7. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. Quantum Computation by Adiabatic Evolution. arXiv:quant-ph/0001106, 2000.
8. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Foundations of Computer Science, 1989., 30th Annual Symposium on, pages 248-253, 1989.
9. S. P. Jordan and E. Farhi. Perturbative gadgets at arbitrary orders. Physical Review A (Atomic, Molecular, and Optical Physics), 77(6):062329, 2008.
10. J. Kempe, A. Kitaev, and O. Regev. The Complexity of the Local Hamiltonian Problem. SIAM JOURNAL ON COMPUTING, 35(5):1070, 2006.
11. A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation. American Mathematical Society, 2002.
12. J. Ĺberg, D. Kult, and E. Sjöqvist. Robustness of the adiabatic quantum search. Physical Review A, 71(6):60312, 2005.
13. D. A. Lidar. Towards fault tolerant adiabatic quantum computation. Physical Review Letters, 100(16):160506, 2008.
14. C. Marriott and J. Watrous. Quantum arthur-merlin games. Computational Complexity, 14(2):122-152, 2005.
15. R. Oliveira and B. Terhal. The complexity of quantum spin systems on a two-dimensional square lattice. Quant. Inf. Comp., 8(10):0900-0924, 2008.
16. J. Roland and N. Cerf. Noise resistance of adiabatic quantum computation using random matrix theory. Physical Review A, 71(3):32330, 2005.
17. M. Sarandy and D. Lidar. Adiabatic Quantum Computation in Open Systems. Physical Review Letters, 95(25):250503, 2005.