Oracle separation of QMA and QCMA with bounded adaptivity

Shalev Ben-David; Srijita Kundu

Oracle separation of QMA and QCMA with bounded adaptivity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2402.00298 v1 pith:ANBF2N2I submitted 2024-02-01 quant-ph cs.CC

Shalev Ben-David , Srijita Kundu This is my paper · ORCID

classification quant-phcs.CC

keywords oracleqcmaseparationadaptivityalgorithmsboundedconstructionquantum

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We give an oracle separation between QMA and QCMA for quantum algorithms that have bounded adaptivity in their oracle queries; that is, the number of rounds of oracle calls is small, though each round may involve polynomially many queries in parallel. Our oracle construction is a simplified version of the construction used recently by Li, Liu, Pelecanos, and Yamakawa (2023), who showed an oracle separation between QMA and QCMA when the quantum algorithms are only allowed to access the oracle classically. To prove our results, we introduce a property of relations called \emph{slipperiness}, which may be useful for getting a fully general classical oracle separation between QMA and QCMA.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

QMA vs. QCMA and Pseudorandomness
quant-ph 2024-11 conditional novelty 8.0 of 10

Assuming a quantum pseudorandomness conjecture for dense permutation distributions, there exists a classical oracle relative to which QMA differs from QCMA.

Pith tools