Universal computation by quantum walk

Physical Review Letters

Volumn 102, Issue 18, 2009, Pages

  Childs, Andrew M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; DEGREE GRAPHS; QUANTUM COMPUTATION; QUANTUM COMPUTING; QUANTUM GATES; QUANTUM WALK; SCATTERING PROCESS; TIME-INDEPENDENT HAMILTONIAN; UNIVERSAL COMPUTATIONS;

COMPUTATIONAL LINGUISTICS; HAMILTONIANS; QUANTUM ELECTRONICS;

QUANTUM COMPUTERS;

EID: 67650311537     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.102.180501     Document Type: Article

References (23)

1. P.W. Shor, SIAM J. Comput. 26, 1484 (1997). SMJCAT 0097-5397 10.1137/S0097539795293172
2. E. Farhi and S. Gutmann, Phys. Rev. A 58, 915 (1998). PLRAAN 1050-2947 10.1103/PhysRevA.58.915
3. J. Watrous, J. Comput. Syst. Sci. JCSSBM 0022-0000 62, 376 (2001). 10.1006/jcss.2000.1732
4. A.M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D.A. Spielman, in Proceedings of the 35th ACM Symposium on Theory of Computing, San Diego, 2003 (ACM, New York, 2003), pp. 59-68.
5. A.M. Childs and J. Goldstone, Phys. Rev. A 70, 022314 (2004). PLRAAN 1050-2947 10.1103/PhysRevA.70.022314
6. A. Ambainis, SIAM J. Comput. 37, 210 (2007). SMJCAT 0097-5397 10.1137/S0097539705447311
7. F. Magniez, M. Santha, and M. Szegedy, SIAM J. Comput. 37, 413 (2007). SMJCAT 0097-5397 10.1137/050643684
8. H. Buhrman and R. Špalek, in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, 2006 (ACM, New York, 2006), pp. 880-889.
9. F. Magniez and A. Nayak, Algorithmica 48, 221 (2007). ALGOEJ 0178-4617 10.1007/s00453-007-0057-8
10. E. Farhi, J. Goldstone, and S. Gutmann, Theory Comput. 4, 169 (2008). 1557-2862 10.4086/toc.2008.v004a008
11. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, SIAM J. Comput. SMJCAT 0097-5397 37, 166 (2007). 10.1137/S0097539705447323
12. J. Kempe and O. Regev, Quantum Inf. Comput. QICUAW 1533-7146 3, 258 (2003).
13. J. Kempe, A. Kitaev, and O. Regev, SIAM J. Comput. 35, 1070 (2006). SMJCAT 0097-5397 10.1137/S0097539704445226
14. D. Aharonov, D. Gottesman, S. Irani, and J. Kempe, in Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, Providence, 2007 (IEEE, Washington, DC, 2007), pp. 373-383.
15. D. Aharonov and A. Ta-Shma, in Proceedings of the 35th ACM Symposium on Theory of Computing, San Diego, 2003 (Ref.), pp. 20-29.
16. R.P. Feynman, Opt. News 11, 11 (1985). ONEWDU 0098-907X
17. R. Wong, Asymptotic Expansions of Integrals (SIAM, Philadelphia, 2001).
18. P.O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, Inf. Proc. Lett. 75, 101 (2000). IFPLAT 0020-0190 10.1016/S0020-0190(00)00084-3
19. A. Ambainis, A.M. Childs, B.W. Reichardt, R. Špalek, and S. Zhang, in Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, Providence, 2007 (Ref.), pp. 363-372.
20. B.W. Reichardt and R. Špalek, in Proceedings of the 40th ACM Symposium on Theory of Computing, Victoria, Canada, 2008 (ACM, New York, 2008), pp. 103-112.
21. A.Y. Kitaev, A.H. Shen, and M.N. Vyalyi, Classical and Quantum Computation (AMS, Providence, 2002).
22. P. Wocjan and S. Zhang, arXiv:quant-ph/0606179.
23. D. Janzing and P. Wocjan, Theory Comput. 3, 61 (2007). 1557-2862 10.4086/toc.2007.v003a004