Classical verification of quantum circuits containing few basis changes

Abstract

We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier Hierarchy, the lowest level for which there is an established quantum advantage. We show that, when the circuit has an outcome with probability at least the inverse of some polynomial in the circuit size, the outcome can be checked in polynomial time with bounded error by a completely classical verifier. This verification procedure is based on random sampling of computational paths and is only possible given knowledge of the likely outcome.

5 pages, comments welcome!

References in corpus (3)

• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Post hoc verification with a single prover
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation

Cited by in corpus (7)

• Supervised learning with quantum enhanced feature spaces
• Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
• Sumcheck-based delegation of quantum computing to rational server
• On the role of coherence for quantum computational advantage
• A quantum homomorphic encryption scheme for polynomial-sized circuits
• Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
• Quantum Circuit Unoptimization