Zero-Knowledge for QMA from Locally Simulatable Proofs

11/18/2019
by   Anne Broadbent, et al.
0

We provide several advances to the understanding of the class of Quantum Merlin-Arthur proof systems (QMA), the quantum analogue of NP. First, we answer a longstanding open question by showing that the Consistency of Local Density Matrices problem is QMA-complete under Karp reductions. We also show for the first time a commit-and-open computational zero-knowledge proof system for all of QMA as a quantum analogue of a "sigma" protocol. We then define a Proof of Quantum Knowledge, which guarantees that a prover is effectively in possession of a quantum witness in an interactive proof, and show that our zero-knowledge proof system satisfies this definition. Finally, we show that our proof system can be used to establish that QMA has a quantum non-interactive zero-knowledge proof system in the secret parameters setting. Our main technique consists in developing locally simulatable proofs for all of QMA: this is an encoding of a QMA witness such that it can be efficiently verified by probing only five qubits and, furthermore, the reduced density matrix of any five-qubit subsystem can be computed in polynomial time and is independent of the witness. This construction follows the techniques of Grilo, Slofstra, and Yuen [FOCS 2019].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

Oracle Separations Between Quantum and Non-interactive Zero-Knowledge Classes

We study the relationship between problems solvable by quantum algorithm...
research
03/05/2018

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Zero knowledge plays a central role in cryptography and complexity. The ...
research
12/25/2019

Towards a quantum-inspired proof for IP = PSPACE

We explore quantum-inspired interactive proof systems where the prover i...
research
11/12/2021

Verified Optimization

Optimization is used extensively in engineering, industry, and finance, ...
research
08/17/2020

Parallel repetition with a threshold in quantum interactive proofs

In this note, we show that O(log (1/ϵ)) rounds of parallel repetition wi...
research
06/14/2023

Quantum interactive proofs using quantum energy teleportation

We present a simple quantum interactive proof (QIP) protocol using the q...

Please sign up or login with your details

Forgot password? Click here to reset