Ground State Connectivity of Local Hamiltonians

Author:

Gharibian Sevag1,Sikora Jamie2

Affiliation:

1. Simons Institute for the Theory of Computing and University of California, Berkeley and Department of Computer Science, Virginia Commonwealth University, Richmond, VA

2. Centre for Quantum Technologies and MajuLab, CNRS-UNS-NUS-NTU International Joint Research Unit, UMI 3654, National University of Singapore

Abstract

The study of ground state energies of local Hamiltonians has played a fundamental role in quantum complexity theory. In this article, we take a new direction by introducing the physically motivated notion of “ground state connectivity” of local Hamiltonians, which captures problems in areas ranging from quantum stabilizer codes to quantum memories. Roughly, “ground state connectivity” corresponds to the natural question: Given two ground states |Ψ〉 and |ϕ〉 of a local Hamiltonian H , is there an “energy barrier” (with respect to H ) along any sequence of local operations mapping |Ψ〉 to |ϕ〉? We show that the complexity of this question can range from QCMA-complete to PSPACE-complete, as well as NEXP-complete for an appropriately defined “succinct” version of the problem. As a result, we obtain a natural QCMA-complete problem, a goal which has generally proven difficult since the conception of QCMA over a decade ago. Our proofs rely on a new technical tool, the Traversal Lemma, which analyzes the Hilbert space a local unitary evolution must traverse under certain conditions. We show that this lemma is essentially tight with respect to the length of the unitary evolution in question.

Funder

French National Research Agency

Singapore Ministry of Education and the National Research Foundation

Tier 3 Grant “Random numbers from quantum processes”

Government of Canada NSERC Postdoctoral Fellowship

Simons Institute for the Theory of Computing

European Union

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Reference53 articles.

1. D. Aharonov and T. Naveh. 2002. Quantum NP - A survey. arXiv.org e-Print quant-ph/0210077v1. D. Aharonov and T. Naveh. 2002. Quantum NP - A survey. arXiv.org e-Print quant-ph/0210077v1.

2. On Physical Problems that are Slightly More Difficult than QMA

3. On the diameter of reconfiguration graphs for vertex colourings

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A survey on the parameterized complexity of reconfiguration problems;Computer Science Review;2024-08

2. Token Sliding on Graphs of Girth Five;Algorithmica;2023-10-28

3. Computing Ground State Properties with Early Fault-Tolerant Quantum Computers;Quantum;2022-07-11

4. Computational complexity of the ground state energy density problem;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Token Sliding on Graphs of Girth Five;Graph-Theoretic Concepts in Computer Science;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3