Computational complexity of isometric tensor network states
Abstract: We determine the computational power of isometric tensor network states (isoTNS), a variational ansatz originally developed to numerically find and compute properties of gapped ground states and topological states in two dimensions. By mapping 2D isoTNS to 1+1D unitary quantum circuits, we find that computing local expectation values in isoTNS is $\textsf{BQP}$-complete. We then introduce injective isoTNS, which are those isoTNS that are the unique ground states of frustration-free Hamiltonians, and which are characterized by an injectivity parameter $\delta\in(0,1/D]$, where $D$ is the bond dimension of the isoTNS. We show that injectivity necessarily adds depolarizing noise to the circuit at a rate $\eta=\delta2D2$. We show that weakly injective isoTNS (small $\delta$) are still $\textsf{BQP}$-complete, but that there exists an efficient classical algorithm to compute local expectation values in strongly injective isoTNS ($\eta\geq0.41$). Sampling from isoTNS corresponds to monitored quantum dynamics and we exhibit a family of isoTNS that undergo a phase transition from a hard regime to an easy phase where the monitored circuit can be sampled efficiently. Our results can be used to design provable algorithms to contract isoTNS. Our mapping between ground states of certain frustration-free Hamiltonians to open circuit dynamics in one dimension fewer may be of independent interest.
- S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863 (1992).
- S. Östlund and S. Rommer, Thermodynamic limit of density matrix renormalization, Physical Review Letters 75, 3537 (1995).
- U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. (N. Y). 326, 96 (2011).
- F. Verstraete and J. I. Cirac, Matrix product states represent ground states faithfully, Phys. Rev. B 73, 094423 (2006).
- D. Malz and J. I. Cirac, Few-body analog quantum simulation with rydberg-dressed atoms in optical lattices, PRX Quantum 4, 020301 (2023).
- Y. Hieida, K. Okunishi, and Y. Akutsu, Numerical renormalization approach to two-dimensional quantum antiferromagnets with valence-bond-solid type ground state, New Journal of Physics 1, 7 (1999).
- F. Verstraete and J. I. Cirac, Renormalization algorithms for quantum-many body systems in two and higher dimensions, (2004), cond-mat/0407066 .
- P. Corboz, T. Rice, and M. Troyer, Competing states in the t𝑡titalic_t-j𝑗jitalic_j model: Uniform d𝑑ditalic_d-wave state versus stripe state, Physical Review Letters 113, 046402 (2014).
- P. Corboz and F. Mila, Crystals of bound states in the magnetization plateaus of the shastry-sutherland model, Physical Review Letters 112, 147203 (2014).
- I. Arad and Z. Landau, Quantum computation and the evaluation of tensor networks, SIAM Journal on Computing 39, 3089 (2010).
- M. P. Zaletel and F. Pollmann, Isometric Tensor Network States in Two Dimensions, Phys. Rev. Lett. 124, 037201 (2020).
- W. Kadow, F. Pollmann, and M. Knap, Isometric tensor network representations of two-dimensional thermal states, Phys. Rev. B 107, 205106 (2023).
- Y.-J. Liu, K. Shtengel, and F. Pollmann, Topological quantum phase transitions in 2d isometric tensor networks, (2023), arXiv:2312.05079 [quant-ph] .
- S.-H. Lin, M. P. Zaletel, and F. Pollmann, Efficient simulation of dynamics in two-dimensional quantum spin systems with isometric tensor networks, Phys. Rev. B 106, 245102 (2022).
- A. Anshu, N. P. Breuckmann, and Q. T. Nguyen, Circuit-to-hamiltonian from tensor networks and fault tolerance, (2023), arXiv:2309.16475 [quant-ph] .
- Z.-Y. Wei, D. Malz, and J. I. Cirac, Sequential generation of projected entangled-pair states, Phys. Rev. Lett. 128, 010607 (2022).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th ed. (Cambridge University Press, 2011).
- B. Skinner, J. Ruhman, and A. Nahum, Measurement-Induced Phase Transitions in the Dynamics of Entanglement, Phys. Rev. X 9, 031009 (2019).
- D. Hangleiter and J. Eisert, Computational advantage of quantum random sampling, Reviews of Modern Physics 95, 035001 (2023).
- M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, Proc. R. Soc. A 467, 459 (2010).
- D. Aharonov and M. Ben-Or, Polynomial simulations of decohered quantum computers (1996) arXiv:quant-ph/9611029v1 .
- D. Aharonov, Quantum to classical phase transition in noisy quantum computers, Phys. Rev. A 62, 062311 (2000).
- Y. Li, X. Chen, and M. P. Fisher, Measurement-driven entanglement transition in hybrid quantum circuits, Phys. Rev. B 100, 134306 (2019).
- M. Schwarz, O. Buerschaper, and J. Eisert, Approximating local observables on projected entangled pair states, Physical Review A 95, 060102 (2017).
- T. J. Osborne, J. Eisert, and F. Verstraete, Holographic Quantum States, Phys. Rev. Lett. 105, 260401 (2010).
- I. H. Kim, Holographic quantum simulation, (2017), arXiv:1702.02093 [quant-ph] .
- J. Borregaard, M. Christandl, and D. Stilck França, Noise-robust exploration of many-body quantum states on near-term quantum devices, npj Quantum Information 7, 10.1038/s41534-021-00363-9 (2021).
- M. Schwarz, K. Temme, and F. Verstraete, Preparing Projected Entangled Pair States on a Quantum Computer, Phys. Rev. Lett. 108, 110502 (2012).
- N. Schuch, I. Cirac, and D. Pérez-García, PEPS as ground states: Degeneracy and topology, Ann. Phys. (N. Y). 325, 2153 (2010).
- D. Stauffer and A. Aharony, Introduction To Percolation Theory (Taylor & Francis, 1992).
- M. Z. Bazant, Largest cluster in subcritical percolation, Physical Review E 62, 1660 (2000).
- D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error rate, (1999), arXiv:quant-ph/9906129 [quant-ph] .
- D. Gottesman, Fault-tolerant quantum computation with local gates, Journal of Modern Optics 47, 333 (2000).
- X. Gao, S.-T. Wang, and L.-M. Duan, Quantum supremacy for simulating a translation-invariant ising spin model, Physical Review Letters 118, 040502 (2017).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.