Circuit depth versus energy in topologically ordered systems
Arkin Tikku, Isaac H. Kim

TL;DR
This paper establishes a fundamental lower bound on the circuit depth required to prepare low-energy states in 2D topologically ordered systems, highlighting limitations of variational quantum algorithms.
Contribution
It provides the first nontrivial circuit-depth lower bound for preparing low-energy states in 2D topologically ordered systems assuming local quantum circuits.
Findings
Lower bound of (/^{(1-lpha)/2}}, \, \, (\, |\u0018|) for preparing low-energy states.
Variational circuits cannot exponentially reduce energy density with circuit depth.
Long-range entanglement can impose circuit-depth constraints even at nonzero energy density.
Abstract
We prove a nontrivial circuit-depth lower bound for preparing a low-energy state of a locally interacting quantum many-body system in two dimensions, assuming the circuit is geometrically local. For preparing any state which has an energy density of at most with respect to Kitaev's toric code Hamiltonian on a two dimensional lattice , we prove a lower bound of for any . We discuss two implications. First, our bound implies that the lowest energy density obtainable from a large class of existing variational circuits (e.g., Hamiltonian variational ansatz) cannot, in general, decay exponentially with the circuit depth. Second, if long-range entanglement is present in the ground state, this can lead to a nontrivial circuit-depth lower bound even at nonzero energy density.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Electronic and Structural Properties of Oxides
