Quantum interactive proofs using quantum energy teleportation

DOI10.1007/s11128-024-04448-0zbMATH Open1542.81163MaRDI QIDQ6566210

Kazuki Ikeda, Adam Lowe

Publication date: 3 July 2024

Published in: Quantum Information Processing (Search for Journal in Brave)

zbMATH Keywords

entanglementquantum teleportationcomputational complexity theoryquantum interactive proofsquantum energy teleportationquantum zero-knowledge proofsquantum multi-prover interactive proofs

Mathematics Subject Classification ID

Quantum computation (81P68) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)

Cites Work

• Unnamed Item
• A protocol for quantum energy distribution
• Non-deterministic exponential time has two-prover interactive protocols
• Quantum Arthur-Merlin games
• The power of quantum systems on a line
• Entangled Games Are Hard to Approximate
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Interactive Distributed Proofs
• Quantum energy teleportation across a three-spin Ising chain in a Gibbs state
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

This page was built for publication: Quantum interactive proofs using quantum energy teleportation