Local Hamiltonian Problem with Succinct Ground State is MA-Complete

Finding the ground energy of a quantum system is a fundamental problem in condensed-matter physics and quantum chemistry. Existing classical algorithms for tackling this problem often assume that the ground state has a succinct classical description, i.e., a poly-size classical circuit for computing the amplitude. Notable examples of succinct states encompass matrix product states, contractible projected-entangled-pair states, and states that can be represented by classical neural networks. We study the complexity of the local Hamiltonian problem (LHP) with a succinct ground state. We prove that this problem is <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mtext mathvariant="bold">MA</a:mtext></a:math>-<e:math xmlns:e="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><e:mtext mathvariant="bold">complete</e:mtext></e:math>. The Hamiltonian that we consider is general and might not be stoquastic. The <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><i:mtext mathvariant="bold">MA</i:mtext></i:math> verification protocol is based on the fixed-node quantum Monte Carlo method, particularly the variant of the continuous-time Markov chain introduced by Bravyi, Carleo, Gosset, and Liu. Based on our work, we also introduce a notion of strong guided states and conjecture that the LHP with a strong guided state is <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><m:mtext mathvariant="bold">MA</m:mtext></m:math>-<q:math xmlns:q="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><q:mtext mathvariant="bold">complete</q:mtext></q:math>, which will be in contrast with the <u:math xmlns:u="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><u:mtext mathvariant="bold">QCMA</u:mtext></u:math>-<y:math xmlns:y="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><y:mtext mathvariant="bold">complete</y:mtext></y:math> result of the LHP with standard guided states.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-04-17
DOI
https://doi.org/10.1103/prxquantum.6.020312
Citations
1
Primary Topic
Quantum many-body systems
Type
article
Field-Weighted Citation Impact
1.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local Hamiltonian Problem with Succinct Ground State is MA-Complete

Jiaqing Jiang
1 citations
PRX Quantum
Quantum many-body systems
1.25
article

Local Hamiltonian Problem with Succinct Ground State is MA-Complete

Jiaqing Jiang
article en
1 citations

Abstract

Finding the ground energy of a quantum system is a fundamental problem in condensed-matter physics and quantum chemistry. Existing classical algorithms for tackling this problem often assume that the ground state has a succinct classical description, i.e., a poly-size classical circuit for computing the amplitude. Notable examples of succinct states encompass matrix product states, contractible projected-entangled-pair states, and states that can be represented by classical neural networks. We study the complexity of the local Hamiltonian problem (LHP) with a succinct ground state. We prove that this problem is <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mtext mathvariant="bold">MA</a:mtext></a:math>-<e:math xmlns:e="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><e:mtext mathvariant="bold">complete</e:mtext></e:math>. The Hamiltonian that we consider is general and might not be stoquastic. The <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><i:mtext mathvariant="bold">MA</i:mtext></i:math> verification protocol is based on the fixed-node quantum Monte Carlo method, particularly the variant of the continuous-time Markov chain introduced by Bravyi, Carleo, Gosset, and Liu. Based on our work, we also introduce a notion of strong guided states and conjecture that the LHP with a strong guided state is <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><m:mtext mathvariant="bold">MA</m:mtext></m:math>-<q:math xmlns:q="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><q:mtext mathvariant="bold">complete</q:mtext></q:math>, which will be in contrast with the <u:math xmlns:u="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><u:mtext mathvariant="bold">QCMA</u:mtext></u:math>-<y:math xmlns:y="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><y:mtext mathvariant="bold">complete</y:mtext></y:math> result of the LHP with standard guided states.

PRX QuantumVol. 6(2)
California Institute of Technology (US)
National Science Foundation, Multidisciplinary University Research Initiative, Institute for Quantum Information and Matter, California Institute of Technology
Openalex Percentile: Top 22%
Quantum many-body systems
1.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.