Simulation of many-qubit quantum computation with matrix product states

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 73, Issue 2, 2006, Pages

  Banuls M C ^a   Orus R ^b   Latorre, J I ^b   Perez A ^a   Ruiz Femenia P ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF BARCELONA   (Spain)

^c MAX PLANCK INSTITUT FÜR PHYSIK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PRODUCT STATES; QUANTUM COMPUTATION; QUANTUM GATES;

ALGORITHMS; COMPUTER SIMULATION; ERROR ANALYSIS; MATRIX ALGEBRA; PROBLEM SOLVING;

QUANTUM OPTICS;

EID: 33644556446     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.73.022344     Document Type: Article

References (21)

1. R. P. Feynman, Int. J. Theor. Phys. IJTPBM 0020-7748 21, 467 (1982).
2. A. Affleck, T. Kennedy, E. H. Lieb, and H. Tasaki, Commun. Math. Phys. CMPHAY 0010-3616 10.1007/BF01218021 115, 477 (1988);
3. S. R. White, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.69. 2863 69, 2863 (1992);
4. M. Fannes, B. Nachtergaele, and R. F. Werner, Commun. Math. Phys. CMPHAY 0010-3616 10.1007/BF02099178 144, 443 (1992);
5. S. Ostlund and S. Rommer, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.75.3537 75, 3537 (1995);
6. J. Dukelsky, M. A. Martín-Delgado, T. Nishino, and G. Sierra, Europhys. Lett. EULEEJ 0295-5075 10.1209/epl/i1998-00381-x 43, 457 (1998);
7. F. Verstraete, D. Porras, and J. I. Cirac, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.93.227205 93, 227205 (2004).
8. G. Vidal, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.91.147902 91, 147902 (2003);
9. G. Vidal, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.93.040502 93, 040502 (2004).
10. G. Vidal, J. I. Latorre, E. Rico, and A. Kitaev, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.90.227902 90, 227902 (2003);
11. J. I. Latorre, E. Rico, and G. Vidal, Quantum Inf. Comput. QICUAW 1533-7146 4, 1 (2004).
12. F. Verstraete, J. I. Cirac, J. I. Latorre, E. Rico, and M. M. Wolf, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.94.140601 94, 140601 (2005).
13. F. Verstraete and J. I. Cirac, e-print cond-mat/0407066.
14. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, e-print quant-ph/0001106;
15. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, e-print quant-ph/0104129;
16. E. Farhi, J. Goldstone, and S. Gutmann, e-print quant-ph/0208135.
17. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman and Co., San Francisco, 1979).
18. A clause of exact cover is built from five clauses of the NP-complete 3-SAT problem, for which the transition is around m∼4.26n. See J. M. Crawford and L. D. Auton, Artif. Intell. AINTBB 0004-3702 10.1016/0004-3702(95) 00046-1 81, 31 (1996).
19. T. Hogg, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.67.022314 67, 022314 (2003).
20. R. Orús and J. I. Latorre, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.69.052308 69, 052308 (2004);
21. J. I. Latorre and R. Orús, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.69.062302 69, 062302 (2004).