Noise-induced sampling of alternative hamiltonian paths in quantum adiabatic search

Complexity

Volumn 14, Issue 6, 2009, Pages 21-27

  Gaitan, Frank ^a  

^a SOUTHERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Computational complexity; Noise; NP Completeness; Quantum adiabatic search; Quantum algorithms

Indexed keywords

EID: 68549110228     PISSN: 10762787     EISSN: 10990526     Source Type: Journal    
DOI: 10.1002/cplx.20252     Document Type: Article

References (8)

1. Garey, M.R.; Johnson, D.S. Computers and Intractability; W.H. Freeman and Company: New York, 1979.
2. Farhi E., Goldstone J., Gutman S., Lapan J., Lundgren A., Preda D.A quantum adiabatic evolution algorithm applied to random instances of an NP-Complete problem. Science 2001, 292, 472.
3. Farhi, E.; Goldstone, J.; Gutman, S.; Sipser, M. Quantum computation by adiabatic evolution, http://arXiv.org/abs/quant-ph/0001106.
4. Farhi, E.; Goldstone, J.; Gutmann, S. Quantum adiabatic evolution algorithms with different paths. http://arXiv.org/abs/quant-ph/0208135.
5. Childs A.M.; Farhi E. Robustness of adiabatic quantum computation. Phys Rev A 2001, 65, 012322.
6. Roland, J.; Cerf, N.J. Noise resistance of adiabatic quantum computation using random matrix theory. Phys Rev A 2005, 71, 032330.
7. Ashhab, S.; Johansson, J.R.; Nori, F. Decoherence in a scalable adiabatic quantum computer. Phys Rev A 2006, 74, 052330.
8. Gaitan, F. Simulation of quantum adiabatic search in the presence of noise. Int J Quantum Info 2006, 4, 843.