Interactive proofs with efficient quantum prover for recursive Fourier sampling
نویسنده
چکیده
We consider the recursive Fourier sampling problem (RFS), and show that there exists an interactive proof for RFS with an efficient classical verifier and efficient quantum prover.
منابع مشابه
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
It is a long-standing open problem whether quantum computing can be verified by a classical verifier. In the computational complexity term, it is “Does any BQP problem have an interactive proof system with a BQP prover and a BPP verifier?”. Several partial solutions to the open problem have been obtained. For example, verifiable blind quantum computing protocols demonstrate that if the verifier...
متن کاملInteractive proofs with competing teams of no-signaling provers
This paper studies a generalization of multi-prover interactive proofs in which a verifier interacts with two competing teams of provers: one team attempts to convince the verifier to accept while the other attempts to convince the verifier to reject. Each team consists of two provers who jointly implement a no-signaling strategy. No-signaling strategies are a curious class of joint strategy th...
متن کاملConstant-Space Quantum Interactive Proofs Against Multiple Provers
We present upper and lower bounds of the computational complexity of the two-way communication model of multiple-prover quantum interactive proof systems whose verifiers are limited to measuremany two-way quantum finite automata. We prove that (i) the languages recognized by those multipleprover systems running in expected polynomial time are exactly the ones in NEXP, the nondeterministic expon...
متن کاملCoherent state exchange in multi-prover quantum interactive proof systems
We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multi-prover quantum interactive proof systems are given. First, we prove that there exists a one-round two-prover quantum interactive proof system for which no finite amount of shared entanglemen...
متن کاملInteractive Proofs For Quantum Computation
The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked [Vaz07]: If computing predictions for Quantum Mech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012