Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

March 08, 2023 Β· Declared Dead Β· πŸ› Information Technology Convergence and Services

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa arXiv ID 2303.04298 Category quant-ph: Quantum Computing Cross-listed cs.CC, cs.CR Citations 11 Venue Information Technology Convergence and Services Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted