Affiliation:
1. School of Engineering and Applied Sciences, Harvard University, Cambridge, Massachusetts 02134, USA
2. Department of Computer Science, University College London, WC1E 6BT London, United Kingdom
Abstract
The NLTS (No Low-Energy Trivial State) conjecture [M. H. Freedman and M. B. Hastings, Quantum Inf. Comput. 14, 144 (2014)] posits that there exist families of Hamiltonians with all low energy states of high complexity (with complexity measured by the quantum circuit depth preparing the state). Here, we prove a weaker version called the combinatorial no low error trivial states (NLETS), where a quantum circuit lower bound is shown against states that violate a (small) constant fraction of local terms. This generalizes the prior NLETS results [L. Eldar and A. W. Harrow, in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2017), pp. 427–438] and [Nirkhe et al., in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Leibniz International Proceedings in Informatics (LIPIcs), edited by Chatzigiannakis et al. (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018), Vol. 107, pp. 1–11]. Our construction is obtained by combining tensor networks with expander codes [M. Sipser and D. Spielman, IEEE Trans. Inf. Theory 42, 1710 (1996)]. The Hamiltonian is the parent Hamiltonian of a perturbed tensor network, inspired by the “uncle Hamiltonian” of Fernández-González et al. [Commun. Math. Phys. 333, 299 (2015)]. Thus, we deviate from the quantum Calderbank-Shor-Steane (CSS) code Hamiltonians considered in most prior works.
Funder
National Science Foundation
Engineering and Physical Sciences Research Council
Subject
Mathematical Physics,Statistical and Nonlinear Physics
Reference33 articles.
1. Guest column
2. Quantum Locally Testable Codes
3. Aharonov, D. and Naveh, T. “Quantum NP—A survey,” arXiv:quant-ph/0210077 (2002).
4. Anshu, A., Arad, I., and Gosset, D., in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022) (Association for Computing Machinery, New York, 2022), pp. 12–18.
5. Anshu, A., Breuckmann, N. P., and Nirkhe, C. “NLTS Hamiltonians from good quantum codes,” arXiv:2206.13228v2 (2022).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献