Small quantum resources can outperform classical verifiers

Researchers showed that a minimal quantum resource is enough to beat every classical proof system.

A new proof shows a separation between MA\mathsf{MA} and StoqMA\mathsf{StoqMA} relative to a classical oracle. This means MA⊊StoqMA\mathsf{MA} \subsetneq \mathsf{StoqMA}.

The work shows that even minimal quantum resources can outperform every classical verifier. This differs from previous results that used substantial coherent quantum computation.

The class StoqMA\mathsf{StoqMA} uses a verifier restricted to classical reversible computation followed by a single Hadamard-basis measurement. This class is closely tied to the complexity of stoquastic Hamiltonians.

Stoquastic Hamiltonians are a sign-problem-free and seemingly more tractable class of quantum Hamiltonians. The separating problem involves determining if a sparse high-girth graph has a large or small Perron--Frobenius eigenvalue.

This task is equivalent to a ground-energy estimation task for a related stoquastic Hamiltonian. The construction builds on work regarding graph exploration problems with exponential quantum speedups.

Key facts

  • The separation MA⊊StoqMA\mathsf{MA} \subsetneq \mathsf{StoqMA} is proven relative to a classical oracle.
  • The class StoqMA\mathsf{StoqMA} is restricted to classical reversible computation and one Hadamard-basis measurement.
  • The problem uses a sparse high-girth graph to estimate ground-energy for a stoquastic Hamiltonian.

All sections

Edition