Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

03/08/2023
by   Xingjian Li, et al.
0

It is a long-standing open question to construct a classical oracle relative to which BQP/qpoly ≠ BQP/poly or QMA ≠ QCMA. In this paper, we construct classically-accessible classical oracles relative to which BQP/qpoly ≠ BQP/poly and QMA ≠ 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2022

Oracle separations of hybrid quantum-classical circuits

An important theoretical problem in the study of quantum computation, th...
research
05/10/2022

An optimal oracle separation of classical and quantum hybrid schemes

Recently, Chia, Chung and Lai (STOC 2020) and Coudron and Menda (STOC 20...
research
02/20/2023

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem

Relational problems (those with many possible valid outputs) are differe...
research
09/05/2019

PNP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle

As one step in a working program initiated by Pudlák [Pud17] we construc...
research
10/28/2020

Tight adaptive reprogramming in the QROM

The random oracle model (ROM) enjoys widespread popularity, mostly becau...
research
11/30/2022

On the power of nonstandard quantum oracles

We study how the choices made when designing an oracle affect the comple...
research
07/05/2020

A stochastic calculus approach to the oracle separation of BQP and PH

After presentations of Raz and Tal's oracle separation of BQP and PH res...

Please sign up or login with your details

Forgot password? Click here to reset