pith. sign in

arxiv: 1012.3319 · v2 · pith:SRB3W332new · submitted 2010-12-15 · 💻 cs.CC · quant-ph

A note about a partial no-go theorem for quantum PCP

classification 💻 cs.CC quant-ph
keywords quantumresultscommutingconjectureno-gonotepartialproblem
0
0 comments X
read the original abstract

This is not a disproof of the quantum PCP conjecture! In this note we use perturbation on the commuting Hamiltonian problem on a graph, based on results by Bravyi and Vyalyi, to provide a partial no-go theorem for quantum PCP. Specifically, we derive an upper bound on how large the promise gap can be for the quantum PCP still to hold, as a function of the non-commuteness of the system. As the system becomes more and more commuting, the maximal promise gap shrinks. We view these results as possibly a preliminary step towards disproving the quantum PCP conjecture. A different way to view these results is actually as indications that a critical point exists, beyond which quantum PCP indeed holds; in any case, we hope that these results will lead to progress on this important open problem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.