Quantum computation and the evaluation of tensor networks

SIAM Journal on Computing

Volumn 39, Issue 7, 2010, Pages 3089-3121

  Arad, Itai ^a   Landau, Zeph ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Quantum algorithms; Statistical mechanical models; Tensor networks

Indexed keywords

COMPLETE PROBLEMS; MECHANICAL MODEL; PARTITION FUNCTIONS; POTTS MODELS; QUANTUM ALGORITHMS; QUANTUM COMPUTATION; UNITARY GATES;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; MATHEMATICAL MODELS; QUANTUM COMPUTERS; QUANTUM THEORY;

TENSORS;

EID: 77954846078     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080739379     Document Type: Article

References (45)

1. D. AHARONOV AND I. ARAD, The BQP-Hardness of Approximating the Jones Polynomial, arXiv Preprint quant-ph/0605181, 2006.
2. D. AHARONOV, I. ARAD, E. EBAN, AND Z. LANDAU, Polynomial Quantum Algorithms for Additive Approximations of the Potts Model and Other Points of the Tutte Plane, arXiv Preprint quant-ph/0702008, 2007.
3. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
4. D. AHARONOV, V. JONES, AND Z. LANDAU, A polynomial quantum algorithm for approximating the Jones polynomial, Algorithmica, 55 (2009), pp. 395-421.
5. D. AHARONOV, Z. LANDAU, AND J. MAKOWSKY, The Quantum, FFT Can Be Classically Simulated, arXiv Preprint quant-ph/0611156, 2006.
6. R. J. BAXTER, Exactly Solved Models in Statistical Mechanics, Dover, New York, 2008.
7. M. BORDEWICH, M. FREEDMAN, L. LOVÁSZ, AND D. WELSH, Approximate counting and quantum computation, Combin. Probab. Comput., 14 (2005), pp. 737-754.
8. H. B. CALLEN, Thermodynamics and an Introduction to Thermostatistics, 2nd ed., Wiley, New York, 1985.
9. A. M. CHILDS, R. CLEVE, E. DEOTTO, E. FARHI, S. GUTMANN, AND D. A. SPIELMAN, Exponential algorithmic speedup by a quantum walk, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003, pp. 59-68.
10. M. DYER, L. GOLDBERG, C. GREENHILL, AND M. JERRUM, The relative complexity of approximate counting problems, Algorithmica, 38 (2004), pp. 471-500.
11. C. DAWSON AND M. NIELSEN, The Solovay-Kitaev Algorithm, arXiv Preprint quantph/0505030, 2005.
12. M. FREEDMAN, A. KITAEV, M. LARSEN, AND Z. WANG, Topological quantum computation, Bull. Amer. Math. Soc. (N.S.), 40 (2002), pp. 31-38.
13. M. FREEDMAN, A. KITAEV, AND Z. WANG, Simulation of topological field theories by quantum computers, Comm. Math. Phys., 227 (2002), pp. 587-603.
14. M. FREEDMAN, M. LARSEN, AND Z. WANG, A modular functor which is universal for quantum computation, Comm. Math. Phys., 227 (2002), pp. 605-622.
15. J. GERACI, A BQP-Complete Problem Related to the Ising Model Partition Function via a New Connection Between Quantum Circuits and Graphs, arXiv Preprint 0801.4833, 2008.
16. L. A. GOLDBERG AND M. JERRUM, Inapproximability of the Tutte polynomial, Inform, and Comput., 206 (2008), pp. 908-929.
17. M. R. GAREY, D. S. JOHNSON, AND L. STOCKMEYER, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1 (1976), pp. 237-267.
18. J. GERACI AND D. LIDAR, On the exact evaluation of certain instances of the Potts partition function by quantum computers, Comm. Math. Phys., 279 (2008), pp. 735-768.
19. S. HALLGREN, Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem, J. ACM, 54 (2007), p. 1.
20. R. HUBENER, C. KRUSZYNSKA, L. HARTMANN, W. DÜR, F. VERSTRAETE, J. EISERT, AND M. PLENIO, Renormalization algorithm with graph enhancement, Phys. Rev. A (3), 79 (2009), p. 022317.
21. F. JAEGER, D. VERTIGAN, AND D. WELSH, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc, 108 (1990), pp. 35-53.
22. E. KNILL AND R. LAFLAMME, Power of one bit of quantum information, Phys. Rev. Lett., 81 (1998), pp. 5672-5675.
23. A. Y. KITAEV, A. H. SHEN, AND M. N. VYALYI, Classical and Quantum, Computation, American Mathematical Society, Boston, MA, 2002.
24. G. KUPERBERG, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, SIAM J. Comput., 35 (2005), pp. 170-188.
25. I. MARKOV AND Y. SHI, Simulating quantum computation by contracting tensor networks, SIAM J. Comput., 38 (2008), pp. 963-981.
26. C. M. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
27. Y. SHI, L. DUAN, AND G. VIDAL, Classical simulation of quantum many-body systems with a tree tensor network, Phys. Rev. A (3), 74 (2006), p. 022320.
28. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
29. P. W. SHOR AND S. P. JORDAN, Estimating Jones polynomials is a complete problem for one clean qubit, Quantum Inf. Comput., 8 (2008), pp. 0681-0714.
30. A. D. SOKAL, The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, in Surveys in Combinatorics 2005, B. S. Webb, ed., Cambridge University Press, Cambridge, 2005, pp. 173-226.
31. F. VERSTRAETE AND J. I. CIRAC, Renormalization Algorithms for Quantum-Many Body Systems in Two and Higher Dimensions, arXiv Condensed Matter Preprint 0407066, 2004.
32. W. VAN DAM, S. HALLGREN, AND L. IP, Quantum algorithms for some hidden shift problems, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 489-498.
33. M. VAN DEN NEST, private communication, 2007.
34. M. VAN DEN NEST, Classical Simulation of Quantum Algorithms and the Role of Classical Postprocessing, arXiv Preprint arXiv:0911.1624, 2009.
35. M. VAN DEN NEST, private communication, 2009.
36. M. VAN DEN NEST, W. DÜR, AND H. J. BRIEGEL, Completeness of the classical 2D Ising model and universal quantum computation, Phys. Rev. Lett., 100 (2008), p. 110501.
37. M. VAN DEN NEST, W. DUR, AND H. BRIEGEL, Classical spin models and the quantum-stabilizer formalism, Phys. Rev. Lett. 98 (2007), p. 117207.
38. M. VAN DEN NEST, W. DÜR, H. J. RAUSSENDORF, AND R. BRIEGEL, Quantum algorithms for spin models and simulable gate sets for quantum computation, Phys. Rev. A (3), 80 (2009), p. 052334.
39. 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 (3), 75 (2007), p. 012337.
40. G. VIDAL, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett., 91 (2003), p. 147902.
41. G. VIDAL, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett., 93 (2004), p. 040502.
42. G. VIDAL, Entanglement renormalization, Phys. Rev. Lett., 99 (2007), p. 220405.
43. J. WATROUS, Quantum algorithms for solvable groups, in Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, 2001, pp. 60-67.
44. D. J. A. WELSH, Complexity: Knots, Colourings and Counting, Cambridge University Press, New York, 1993.
45. J. YARD AND P. WOCJAN, The Jones polynomial: Quantum algorithms and applications in quantum complexity theory, Quantum Inf. Comput., 8 (2008), pp. 0147-0180.