We provide a new, quantum inspired, proof for the celebrated claim of [LFKN92] that $P^{\#P} \subseteq IP$. The protocol is fundamentally different from the original sum-check protocol of [LFKN92, Sha92], as well as from variants of this proof [GKR08, Mei09], though it still possesses the overall structure of inductively checking consistency between subsequent step. The protocol is inspired by [AAV13]. Hopefully, this protocol will be helpful in making progress towards two major open problems: resolving the quantum PCP question, and verification of quantum computations using a classical BPP verifier. Given the historical importance of the sum-check protocol in classical computational complexity, we hope that the new protocol will also find applications in classical complexity theory.
We provide a new, quantum inspired, proof for the celebrated claim of [LFKN92] that P#P⊆IP. The protocol is fundamentally different from the original sum-check protocol of [LFKN92, Sha92], as well as from variants of this proof [GKR08, Mei09], though it still possesses the overall structure of inductively checking consistency between subsequent step. The protocol is inspired by [AAV13]. Hopefully, this protocol will be helpful in making progress towards two major open problems: resolving the quantum PCP question, and verification of quantum computations using a classical BPP verifier. Given the historical importance of the sum-check protocol in classical computational complexity, we hope that the new protocol will also find applications in classical complexity theory.
Complexity class containments involving interactive proof classes are famously nonrelativizing: although IP=PSPACE, Fortnow and Sipser showed that that there exists an oracle relative to which coNP⊆IP. In contrast, the question of whether the containment BQP⊆IP is relativizing remains wide open. In this work we make progress towards resolving this question by showing that the containment BQP⊆MIP holds with respect to any classical oracle. We obtain this result by constructing, for any classical oracle O, a PCP proof system for BQPO where the verifier makes polynomially many classical queries to an exponentially-long proof, and to the oracle O. Our construction is inspired by the state synthesis algorithm of Grover and Rudolph, and serves as a complement to the "exponential PCP" constructed by Aharonov, Arad, and Vidick, which achieves similar parameters but which is based on different ideas and does not relativize. We propose relativization as a proxy for prover efficiency, and hope that progress towards an IP for BQP in the oracle world will lead to a non-cryptographic interactive protocol for proving any quantum computation to a classical skeptic in the unrelativized world, which is a longstanding open problem in quantum complexity theory.
BQP⊆IP Does Not Relativize
We construct an oracle relative to which BQP⊆IP, resolving a long-standing open question in quantum complexity theory. Together with recent work due to Aaronson et al., our work also gives the first oracle separation between IP and MIP, answering a question dating back to Fortnow's thesis. Our separation is based on the Forrelation problem, where given Boolean functions f and g, the goal is to determine if f is correlated with the Fourier spectrum of g. While this task is solvable by a query-efficient quantum algorithm, we show that it admits no classical interactive protocol with polynomial communication and a polynomial-query verifier.
Our proof is based on (i) a new structural result showing how to approximate Avg-Max circuits (which are well-known to capture the power of interactive proofs in the oracular setting) by convex functions with small first and second derivatives and (ii) a novel analysis establishing that the Forrelation distribution suggested by Aaronson and Ambainis fools such functions.
Our results imply that any prover-efficient classical interactive protocol for BQP must rely on non-relativizing techniques. This might serve as a partial explanation for the lack of progress towards doubly-efficient, unconditionally sound classical verification of quantum computation.
Quantum inspired protocols e.g. [AAV13,AG17] attempt to achieve a single-prover interactive protocol where a classical machine can verify quantum computations in an information-theoretically secure manner. We define a family of protocols which seem natural for verifying quantum computations and generalizes such known protocols, namely those of [AAV13,AG17]. We show that any protocol from this family is bound to require an extremely powerful prover, much like the classical protocols of [LFKN92] and [Sha92]. Using our analysis, we also hint at possible ways one might try to realize a protocol where the prover can be weaker, namely a quantum computer (i.e. a BQP machine).
We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by \cite{AG17} showing a quantum-inspired interactive protocol ($\IP$) for PreciseBQP where the prover is only assumed to be a $\PreciseBQP$ machine, and show that the result can be strengthened to show an $\IP$ for $\NP^{\PP}$ with a prover which is only assumed to be an $\NP^{\PP}$ machine - which was not known before. We also show how the protocol can be used to directly verify $\QMA$ computations, thus connecting the sum-check protocol by \cite{AAV13} with the result of \cite{AG17,LFKN90}. Our results shed light on a quantum-inspired proof for $\IP=\PSPACE$, as $\PreciseQMA$ captures the full $\PSPACE$ power.
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can check whether quantum computers are indeed producing correct results. This task, known as quantum verification , has been highlighted as a significant challenge on the road to scalable quantum computing technology. We review the most significant approaches to quantum verification and compare them in terms of structure, complexity and required resources. We also comment on the use of cryptographic techniques which, for many of the presented protocols, has proven extremely useful in performing verification. Finally, we discuss issues related to fault tolerance, experimental implementations and the outlook for future protocols.
The promise of scalable quantum technology appears more realistic, after recent advances in both theory and experiment. Assuming a quantum computer is developed, the task of verifying the correctness of its outcome becomes crucial. Unfortunately, for a system that involves many particles, predicting its evolution via classical simulation becomes intractable. Moreover, verification of the outcome by computational methods, i.e. involving a classical witness, is believed inefficient for the hardest problems solvable by a quantum computer. A feasible alternative to verify quantum computation is via cryptographic methods, where an untrusted prover has to convince a weak verifier for the correctness of his outcome. This is the approach we take in this thesis. In the most standard configuration the prover is capable of computing all polynomial-time quantum circuits and the verifier is restricted to classical with very modest quantum power. The goal of existing verification protocols is to reduce the quantum requirements for the verifier - ideally making it purely classical - and reduce the communication complexity. In Part II we propose a composition of two existing verification protocols [Fitzsimons and Kashefi, 2012], [Aharonov et al., 2010] that achieves quadratic improvement in communication complexity, while keeping the quantum requirements for the verifier modest. Along this result, several new techniques are proposed, including the generalization of [Fitzsimons and Kashefi, 2012] to prime dimensions. In Part III we discuss the idea of model-specific quantum verification, where the prover is restricted to intermediate quantum power, i.e. between full-fledged quantum and purely classical, thus more feasible experimentally. As a proof of principle we propose a verification protocol for the One-Pure-Qubit computer [Knill and Laflamme, 1998], which tolerates noise and is capable of computing hard problems such as large matrix trace estimation. The verification protocol is an adaptation of [Fitzsimons and Kashefi, 2012] running on Measurement-Based Quantum Computing with newly proved properties of the underlying resources. Connections of quantum verification to other security primitives are considered in Part IV. Authenticated quantum communication has been already proved to relate to quantum verification. We expand this by proposing a quantum authentication protocol derived from [Fitzsimons and Kashefi, 2012] and discuss implications to verification with purely classical verifier. Connections between quantum security primitives, namely blindness - prover does not learn the computation -, and classical security are considered in Part V. We introduce a protocol where a client with restricted classical resources computes blindly a universal classical gate with the help of an untrusted server, by adding modest quantum capabilities to both client and server. This example of quantum-enhanced classical security we prove to be a task classically impossible.