Pith. sign in

REVIEW 3 cited by

QMA with subset state witnesses

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1410.2882 v2 pith:UOIKI2FI submitted 2014-10-10 quant-ph cs.CC

QMA with subset state witnesses

classification quant-ph cs.CC
keywords classquantumsubsetwitnessesproveanalogousaskingbound
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter physics and in particular in the study of the minimum energy of quantum systems. In this paper, we further investigate the class QMA and its related class QCMA by asking what makes quantum witnesses potentially more powerful than classical ones. We provide a definition of a new class, SQMA, where we restrict the possible quantum witnesses to the "simpler" subset states, i.e. a uniform superposition over the elements of a subset of n-bit strings. Surprisingly, we prove that this class is equal to QMA, hence providing a new characterisation of the class QMA. We also prove the analogous result for QMA(2) and describe a new complete problem for QMA and a stronger lower bound for the class QMA$_1$.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians

    quant-ph 2025-09 unverdicted novelty 8.0

    The Guided Local Hamiltonian problem for stoquastic Hamiltonians is promise BPP-hard (even 2-local on lattices), BQP-hard under fixed local constraints, and admits a deterministic classical approximation algorithm whe...

  2. On the Complexity of the Succinct State Local Hamiltonian Problem

    quant-ph 2025-09 unverdicted novelty 6.0

    The succinct state 2-local Hamiltonian problem for qubit Hamiltonians is promise-MA-complete.

  3. The Complexity of Local Stoquastic Hamiltonians on 2D Lattices

    quant-ph 2025-02 unverdicted novelty 5.0

    The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.