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. Quantum Information Processing Springer Journals

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

Loading next page...
Springer US
Copyright © 2014 by Springer Science+Business Media New York
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
Publisher site
See Article on Publisher Site


  • 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 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial