Quantum interactive proofs using quantum energy teleportation

06/14/2023
by   Kazuki Ikeda, et al.
0

We present a simple quantum interactive proof (QIP) protocol using the quantum state teleportation (QST) and quantum energy teleportation (QET) protocols. QET is a technique that allows a receiver at a distance to extract the local energy by local operations and classical communication (LOCC), using the energy injected by the supplier as collateral. QET works for any local Hamiltonian with entanglement and, for our study, it is important that getting the ground state of a generic local Hamiltonian is quantum Merlin Arthur (QMA)-hard. The key motivations behind employing QET for these purposes are clarified. Firstly, in cases where a prover possesses the correct state and executes the appropriate operations, the verifier can effectively validate the presence of negative energy with a high probability (Completeness). Failure to select the appropriate operators or an incorrect state renders the verifier incapable of observing negative energy (Soundness). Importantly, the verifier solely observes a single qubit from the prover's transmitted state, while remaining oblivious to the prover's Hamiltonian and state (Zero-knowledge). Furthermore, the analysis is extended to distributed quantum interactive proofs, where we propose multiple solutions for the verification of each player's measurement. The complexity class of our protocol in the most general case belongs to QIP(3)=PSPACE, hence it provides a secure quantum authentication scheme that can be implemented in small quantum communication devices. It is straightforward to extend our protocol to Quantum Multi-Prover Interactive Proof (QMIP) systems, where the complexity is expected to be more powerful (PSPACE⊂QMIP=NEXPTIME). In our case, all provers share the ground state entanglement, hence it should belong to a more powerful complexity class QMIP^*.

READ FULL TEXT

page 1

page 4

page 6

page 8

research
05/27/2019

Perfect zero knowledge for quantum multiprover interactive proofs

In this work we consider the interplay between multiprover interactive p...
research
11/18/2019

Zero-Knowledge for QMA from Locally Simulatable Proofs

We provide several advances to the understanding of the class of Quantum...
research
07/22/2022

Learning Distributed Quantum State Discrimination with Noisy Classical Communications

Consider a distributed quantum sensing system in which Alice and Bob are...
research
06/10/2022

Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement

Savitch's theorem states that NPSPACE computations can be simulated in P...
research
04/11/2019

NEEXP in MIP*

We study multiprover interactive proof systems. The power of classical m...
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...

Please sign up or login with your details

Forgot password? Click here to reset