Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

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.Comment: 31 pages. Added classically-accessible classical oracle separation of QMA and QCMA and updated the abstrac

    Similar works

    Full text

    thumbnail-image

    Available Versions