pith. sign in

arxiv: 2303.04298 · v4 · pith:O7CC6AB7new · submitted 2023-03-08 · 🪐 quant-ph · cs.CC· cs.CR

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

classification 🪐 quant-ph cs.CCcs.CR
keywords classicalclassically-accessibleoracleoraclesqcmarelativeconstructpoly
0
0 comments X
read the original 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.

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.