all InfoSec news
Classical vs Quantum Advice under Classically-Accessible Oracle. (arXiv:2303.04298v1 [quant-ph])
cs.CR updates on arXiv.org arxiv.org
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. 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 separation of QMA and
QCMA relative to a distributional quantumly-accessible classical oracles, which
was recently shown by …
advice algorithms oracle poly quantum quantum algorithms question relative under