Fast universal quantum computation with railroad-switch local Hamiltonians

Journal of Mathematical Physics

Volumn 51, Issue 6, 2010, Pages

  Nagaj, Daniel ^a  

^a INSTITUTE OF PHYSICS   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77954550506     PISSN: 00222488     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.3384661     Document Type: Article

References (36)

1. Nielsen M.A. Chuang I.L. Quantum Information and Computation 2000, (Cambridge University Press, Cambridge, ).
2. Leung D. Int. J. Quantum Inf. 2004, 2:33. ZZZZZZ, 0219-7499, 10.1142/S0219749904000055
3. Childs A.M. Leung D.W. Nielsen M.A. Phys. Rev. A 2005, 71:032318. PLRAAN, 1050-2947, 10.1103/PhysRevA.71.032318.
4. Kitaev A. Ann. Phys. 2003, 303:2. ANPYA2, 0003-3804, 10.1016/S0003-4916(02)00018-0
5. Farhi E. Goldstone J. Gutmann S. Lapan J. Lundgren A. Preda D. Science 2001, 292:472. SCIEAS, 0036-8075, 10.1126/science.1057726
6. Childs A. Childs A. Phys. Rev. Lett. 2009, 102:180501. PRLTAO, 0031-9007, 10.1103/PhysRevLett.102.180501 e-print arXiv:0806.1972.
7. Feynman R. Optics News 1985, 11:11. ONEWDU, 0098-907X, 10.1364/ON.11.2.000011
8. Kitaev A.Y. Shen A.H. Vyalyi M.N. Classical and Quantum Computation 2002, 47. and Graduate Studies in Mathematics Vol. (AMS, Providence, RI).
9. Kempe J. Regev O. Quantum Inf. Comput. 2003, 3:258. QICUAW, 1533-7146.
10. Kempe J. Kitaev A. Regev O. SIAM J. Comput. 2006, 35:1070. SMJCAT, 0097-5397, 10.1137/S0097539704445226.
11. Oliveira R. Terhal B.M. Quant. Inf. Comput. 2008, 8:0900. and,
12. Nagaj D. Mozes S. J. Math. Phys. 2007, 48:072104. JMAPAQ, 0022-2488, 10.1063/1.2748377.
13. Aharonov D. Gottesman D. Irani S. Kempe J. 2007, 373-383. Proceedings of the 48th IEEE Symposium on the Foundations of Computer Science (FOCS).
14. Eldar L. Regev O. Eldar L. Love P. Nagaj D. Regev O. ICALP 2008 2008, 881-892. L. Aceto, edited by (Springer-Verlag, Berlin, Heidelberg, ), Pt. I, Paper No. LNCS 5125, pp., (unpublished).
15. Janzing D. Wocjan P. Quantum Inf. Process. 2005, 4:129. QIPUAT, 1570-0755, 10.1007/s11128-005-4482-9.
16. Vollbrecht K.G. H. Cirac J.I. Phys. Rev. Lett. 2008, 100:010501. PRLTAO, 0031-9007, 10.1103/PhysRevLett.100.010501.
17. Nagaj D. Wocjan P. Phys. Rev. A 2008, 78:032311. PLRAAN, 1050-2947, 10.1103/PhysRevA.78.032311.
18. Mizel A. Lidar D.A. Mitchell M. Phys. Rev. Lett. 2007, 99:070502. PRLTAO, 0031-9007, 10.1103/PhysRevLett.99.070502.
19. Aharonov D. van Dam W. Kempe J. Landau Z. Lloyd S. Regev O. SIAM J. Comput. 2007, 37:166. SMJCAT, 0097-5397, 10.1137/S0097539705447323
20. Apolloni B. de Falco D. J. Phys. A 2002, 35:10033. JPHAC5, 0305-4470, 10.1088/0305-4470/35/47/305.
21. de Falco D. Tamascelli D. J. Phys. A 2004, 37:909. JPHAC5, 0305-4470, 10.1088/0305-4470/37/3/025.
22. de Falco D. Tamascelli D. Theoretical Informatics and Applications 2006, 40:93. 10.1051/ita:2006013.
23. de Falco D. Tamascelli D. J. Phys. A 2006, 39:5873. JPHAC5, 0305-4470, 10.1088/0305-4470/39/20/016.
24. It is the discrete Laplacian.
25. Bravyi S. e-print arXiv:quant-ph/0602108.
26. A promise problem: Is the ground state energy of a 3-local Hamiltonian less than some a, or more than some b, with (b-a)>1/poly(L).
27. Jordan S. Farhi E. Shor P. Phys. Rev. A 2006, 74:052322. PLRAAN, 1050-2947, 10.1103/PhysRevA.74.052322.
28. Nagaj D. Reitzner D. Bužek V. and (unpublished).
29. Lidar D. Phys. Rev. Lett. 2008, 100:160506. PRLTAO, 0031-9007, 10.1103/PhysRevLett.100.160506
30. Childs A. Farhi E. Preskill J. Phys. Rev. A 2001, 65:012322. PLRAAN, 1050-2947, 10.1103/PhysRevA.65.012322.
31. Lloyd S. e-print arXiv:0805.2757.
32. Aharonov D. Ta-Shma A. 2003, 20-29. Proceedings of the 35th Annual Symposium on Theory of Computing.
33. Farhi E. Goldstone J. Gutmann S. Sipser M. e-print arXiv:quant-ph/0001106.
34. Biamonte J.D. Love P.J. Phys. Rev. A 2008, 78:012352. PLRAAN, 1050-2947, 10.1103/PhysRevA.78.012352.
35. However, the term can be used to find a new proof of QMA universality for the local Hamiltonian problem.
36. Aharonov D. Ambainis A. Kempe J. Vazirani U. 2001, 50-59. Proceedings of ACM Symposium on Theory of Computation (STOC'01).