Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center

03/24/2020
by   Tomoyuki Morimae, et al.
0

The posthoc verification protocol [J. F. Fitzsimons, M. Hajdušek, and T. Morimae, Physical Review Letters 120, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2021

Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing

We propose three constructions of classically verifiable non-interactive...
research
11/19/2019

Non-interactive classical verification of quantum computation

In a recent breakthrough, Mahadev constructed an interactive protocol th...
research
11/18/2019

Non-interactive zero-knowledge arguments for QMA, with preprocessing

A non-interactive zero-knowledge (NIZK) proof system for a language L∈NP...
research
08/23/2019

Semi-Quantum Money

Private quantum money allows a bank to mint quantum money states that it...
research
10/04/2022

Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications

The generation and verification of quantum states are fundamental tasks ...
research
07/25/2020

Multi-theorem (Malicious) Designated-Verifier NIZK for QMA

We present the first non-interactive zero-knowledge argument system for ...
research
12/25/2019

Towards a quantum-inspired proof for IP = PSPACE

We explore quantum-inspired interactive proof systems where the prover i...

Please sign up or login with your details

Forgot password? Click here to reset