Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
arXiv:2003.10712
Abstract
The posthoc verification protocol [J. F. Fitzsimons, M. Hajdu{\v s}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] enables an information-theoretically-sound non-interactive verification of quantum computing, but the message from the prover to the verifier is quantum and the verifier has to do single-qubit measurements. The Mahadev protocol removes these quantum parts, but the soundness becomes the computational one. In this paper, we construct an information-theoretically-sound non-interactive classical verification protocol for quantum computing with a trusted center. The trusted center sends random BB84 states to the prover, and the classical descriptions of these BB84 states to the verifier. The messages from the center to the prover and the verifier are independent of the instance. By slightly modifying our protocol, we also construct a non-interactive statistical zero-knowledge proof system for QMA with the trusted center.
arXiv comment14 pages, no figure
References in corpus (14)
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Verification of quantum computation: An overview of existing approaches
- Experimental verification of quantum computations
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Verification of Many-Qubit States
- Demonstration of measurement-only blind quantum computing
- Non-interactive classical verification of quantum computation
- Quantum proofs can be verified using only single qubit measurements
- Classical verification of quantum circuits containing few basis changes
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Towards a quantum-inspired proof for IP = PSPACE