Simulating quantum computation by contracting tensor networks

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 963-981

  Markov, Igor L ^a   Shi, Yaoyun ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Classical simulation; Computational complexity; One way quantum computation; Quantum computation; Tensor network; Treewidth

Indexed keywords

CLASSICAL SIMULATION; MAXIMUM DEGREES; ONE-WAY QUANTUM COMPUTATION; PREPRINT; QUANTUM CIRCUITS; QUANTUM COMPUTATION; QUANTUM COMPUTATIONS; QUANTUM RESOURCES; RANDOMIZED ALGORITHMS; T GATES; TREE WIDTHS; TREEWIDTH; UNDERLYING GRAPHS;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; GRAPH THEORY; NETWORKS (CIRCUITS); QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY; TENSORS;

TREES (MATHEMATICS);

EID: 54849416233     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050644756     Document Type: Article

References (41)

1. S. AARONSON AND D. GOTTESMAN, Improved simulation of stabilizer circuits, Physical Rev. A, 70 (2004), p. 052328-1-052328-14.
2. D. AHARONOV, A. KITAEV, AND N. NISAN, Quantum circuits with mixed states, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computation (STOC), Dallas, TX, ACM Press, New York, 1998, pp. 20-30.
3. D. AHARONOV, Z. LANDAU, AND J. MAKOWSKY, The quantum FFT can be classically simulated, preprint: quant-ph/0611156.
4. J. ALBER, H. L. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, 33 (2002), pp. 461-493.
5. S. ARNBORG, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, BIT, 25 (1985), pp. 2-23.
6. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a κ-tree, SIAM J. Algebraic and Discrete Methods, 8 (1987), pp. 277-284.
7. H. J. BRIEGEL AND R. RAUSSENDORF, Persistent entanglement in arrays of interacting particles, Phys. Rev. Lett., 86 (2001), pp. 910-913.
8. H. L. BODLAENDER, Treewidth: Characterizations, Applications, and Computations, Technical report UU-CS-2006-041, Universiteit Utrecht, Utrecht, The Netherlands, 2006.
9. S. BRAVYI AND R. RAUSSENDORF, On measurement-based quantum computation with the toric code states, preprint: quant-ph/0610102.
10. E. BROERING AND S. LOKAM, Width-based algorithms for SAT and Circuit-SAT (extended abstract), in Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Santa Margherita, Italy, Lecture Notes in Comput. Sci. 2919, Springer-Verlag, 2004, pp. 162-171.
11. R. DECHTER, Bucket elimination: A unifying framework for reasoning, Artificial Intelligence, 113 (1999), pp. 41-85.
12. D. GOTTESMAN, The Heisenberg representation of quantum, computers, in Proceedings of the 22nd International Colloquium on Group Theoretical Methods in Physics, Group 22: S. P. Corney, R. Delbourgo, and P. D. Jarvis, eds., International Press, Cambridge, MA, 1999, pp. 32-43. Long version: quant-ph/9807006.
13. S. A. FENNER, F. GREEN, S. HOMER, AND Y. ZHANG, Bounds on the power of constant-depth quantum, circuits, in Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT), Lübeck, Germany, 2005, Lecture Notes in Comput. Sci. 3623, M. Liskiewicz and R. Reischuk, eds., Springer, Berlin, 2005, pp. 44-55.
14. A. W. JOSHI, Matrices and Tensors in Physics, Halsted Press [John Wiley & Sons], New York-London-Sydney, 1975.
15. R. JOZSA, On the simulation of quantum circuits, preprint: quant-ph/0603163.
16. R. JOZSA AND N. LINDEN, On the role of entanglement in quantum computational speed-up, Lond. Proc. R. Soc. Ser. A Math. Phys. Eng. Sci., 459, 2003, pp. 2011-2032.
17. S. KRISHNASWAMY, G. F. VIAMONTES, I L. MARKOV, AND J. P. HAYES, Accurate reliability evaluation and enhancement via probabilistic transfer matrices, in Proceedings of the Design Automation and Test in Europe (DATE'05), Munich, Germany, 2005, pp. 282-287.
18. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
19. I. L. MARKOV AND Y. SHI, Simulating quantum computation by contracting tensor networks, preprint: quant-ph/0511069.
20. I. L. MARKOV AND Y. SHI, Constant Degree Graph Expansions and Treewidth, manuscript.
21. M. VAN DEN NEST, W. DÜR, G VIDAL, AND H J. BRIEGEL, Classical simulation versus universality in measurement based quantum computation, Phys. Rev. A, 75 (2007), p. 012337.
22. M. VAN DEN NEST, A. MIYAKE, W. DÜR AND H. J BRIEGEL, Universal resources for measurement-based quantum computation, Phys. Rev. Lett., 97 (2006), p. 150504.
23. M. A. NIELSEN AND I. L. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
24. D. PORRAS, F. VERSTRAETE, AND J. I. CIRAC, Renormalization algorithm for the calculation of spectra of interacting quantum systems, preprint: cond-mat/0504717.
25. R. RAUSSENDORF AND H. J. BRIEGEL, A one-way quantum computer, Phys. Rev. Lett., 86 (2001), pp. 5188-5191.
26. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
27. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. III. Planar tree-width, J. Comb. Theory Series B, 36 (1984), pp. 49-64.
28. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. X. Obstructions to tree-decomposition, Journal of Comb. Theory Ser. B, 52 (1991), pp. 153-190.
29. D. J. ROSE, Triangulated graphs and the elimination process, J. Math. Anal. Appl., 32 (1970), pp. 597-609.
30. V. P. ROYCHOWDHURY AND F. VATAN, Quantum formulas: A lower bound and simulation, SIAM J. Comput., 31 (2001), pp. 460-476.
31. B. M. TERHAL AND D. P. DIVINCENZO, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A, 65 (2002), pp. 32325-32334.
32. B. M. TERHAL AND D. P. DIVINCENZO, Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games, Quantum Inf. Comput., 4 (2004), pp. 134-145.
33. L. G. VALIANT, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput., 31 (2002), pp. 1229-1254.
34. F. VERSTRAETE AND J. I. CIRAC, Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions, preprint: cond-mat/0407066.
35. F. VERSTRAETE, J. J. GARCIA-RIPOLL, AND J. I. CIRAC, Matrix product density operators: Simulation of finite-temperature and dissipative systems, Phys. Rev. Lett., 93 (2004), p. 207204.
36. G. VIDAL, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett., 91 (2003), p. 147902.
37. G. VIDAL, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett., 93 (2004), p. 040502.
38. P. WALTHER, K. J. RESCH. T. RUDOLPH, E. SCHENCK, H. WEINFURTER, V. VEDRAL, M. ASPELMEYER, AND A, ZEILINGER, Experimental one-way quantum computing, Nature, 434 (2005), pp. 169-176.
39. N. YORAN AND A. SHORT, Efficient classical simulation of the approximate quantum Fourier transform, Phys. Rev. A, 76 (2007), p. 042321.
40. A. YAO, Quantum circuit complexity, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, IEEE Comput. Soc. Press, Los Alamitos, CA, 1993, pp. 352-361.
41. M. ZWOLAK AND G. VIDAL, Mixed-State dynamics in one-dimensional quantum lattice systems: A time-dependent superoperator renormalization algorithm, Phys. Rev. Lett., 93 (2004), p. 207205.