The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$ NP

The commuting local Hamiltonian problem on locally expanding graphs is approximable in... The local Hamiltonian problem is famously complete for the class $$\mathsf{{QMA}}$$ QMA , the quantum analogue of $$\mathsf{{NP}}$$ NP . The complexity of its semiclassical version, in which the terms of the Hamiltonian are required to commute (the $$\mathsf{{CLH}}$$ CLH problem), has attracted considerable attention recently due to its intriguing nature, as well as in relation to growing interest in the $$\mathsf{{qPCP}}$$ qPCP conjecture. We show here that if the underlying bipartite interaction graph of the $$\mathsf{{CLH}}$$ CLH instance is a good locally expanding graph, namely the expansion of any constant-size set is $$\varepsilon $$ ε -close to optimal, then approximating its ground energy to within additive factor $$O(\varepsilon )$$ O ( ε ) lies in $$\mathsf{{NP}}$$ NP . The proof holds for $$k$$ k -local Hamiltonians for any constant $$k$$ k and any constant dimensionality of particles $$d$$ d . We also show that the approximation problem of $$\mathsf{{CLH}}$$ CLH on such good local expanders is $$\mathsf{{NP}}$$ NP -hard. This implies that too good local expansion of the interaction graph constitutes an obstacle against quantum hardness of the approximation problem, though it retains its classical hardness. The result highlights new difficulties in trying to mimic classical proofs (in particular, Dinur’s $$\mathsf{{PCP}}$$ PCP proof) in an attempt to prove the quantum $$\mathsf{{PCP}}$$ PCP conjecture. A related result was discovered recently independently by Brandão and Harrow, for $$2$$ 2 -local general Hamiltonians, bounding the quantum hardness of the approximation problem on good expanders, though no $$\mathsf{{NP}}$$ NP hardness is known in that case. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$ NP

Loading next page...
 
/lp/springer_journal/the-commuting-local-hamiltonian-problem-on-locally-expanding-graphs-is-2Iuy24WkHz
Publisher
Springer US
Copyright
Copyright © 2014 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-014-0877-9
Publisher site
See Article on Publisher Site

Abstract

The local Hamiltonian problem is famously complete for the class $$\mathsf{{QMA}}$$ QMA , the quantum analogue of $$\mathsf{{NP}}$$ NP . The complexity of its semiclassical version, in which the terms of the Hamiltonian are required to commute (the $$\mathsf{{CLH}}$$ CLH problem), has attracted considerable attention recently due to its intriguing nature, as well as in relation to growing interest in the $$\mathsf{{qPCP}}$$ qPCP conjecture. We show here that if the underlying bipartite interaction graph of the $$\mathsf{{CLH}}$$ CLH instance is a good locally expanding graph, namely the expansion of any constant-size set is $$\varepsilon $$ ε -close to optimal, then approximating its ground energy to within additive factor $$O(\varepsilon )$$ O ( ε ) lies in $$\mathsf{{NP}}$$ NP . The proof holds for $$k$$ k -local Hamiltonians for any constant $$k$$ k and any constant dimensionality of particles $$d$$ d . We also show that the approximation problem of $$\mathsf{{CLH}}$$ CLH on such good local expanders is $$\mathsf{{NP}}$$ NP -hard. This implies that too good local expansion of the interaction graph constitutes an obstacle against quantum hardness of the approximation problem, though it retains its classical hardness. The result highlights new difficulties in trying to mimic classical proofs (in particular, Dinur’s $$\mathsf{{PCP}}$$ PCP proof) in an attempt to prove the quantum $$\mathsf{{PCP}}$$ PCP conjecture. A related result was discovered recently independently by Brandão and Harrow, for $$2$$ 2 -local general Hamiltonians, bounding the quantum hardness of the approximation problem on good expanders, though no $$\mathsf{{NP}}$$ NP hardness is known in that case.

Journal

Quantum Information ProcessingSpringer Journals

Published: Nov 26, 2014

References

  • Approximation algorithms for QMA complete problems
    Gharibian, S; Kempe, J

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off