English

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

Quantum Physics 2024-01-19 v4 Computational Complexity Cryptography and Security

Abstract

It is a long-standing open question to construct a classical oracle relative to which BQP/qpoly \neq BQP/poly or QMA \neq QCMA. In this paper, we construct classically-accessible classical oracles relative to which BQP/qpoly \neq BQP/poly and QMA \neq QCMA. Here, classically-accessible classical oracles are oracles that can be accessed only classically even for quantum algorithms. Based on a similar technique, we also show an alternative proof for the separation of QMA and QCMA relative to a distributional quantumly-accessible classical oracle, which was recently shown by Natarajan and Nirkhe.

Cite

@article{arxiv.2303.04298,
  title  = {Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle},
  author = {Xingjian Li and Qipeng Liu and Angelos Pelecanos and Takashi Yamakawa},
  journal= {arXiv preprint arXiv:2303.04298},
  year   = {2024}
}

Comments

31 pages. Added classically-accessible classical oracle separation of QMA and QCMA and updated the abstract. v4: Fixed an issue with the proof of Claim 5.2

R2 v1 2026-06-28T09:06:39.508Z