Using entanglement in quantum multi-prover interactive proofs

DOI10.1007/s00037-009-0275-3zbMath1213.68285arXiv0711.3715OpenAlexW2174563490WikidataQ59792848 ScholiaQ59792848MaRDI QIDQ626625

Thomas Vidick, Hirotada Kobayashi, Keiji Matsumoto, Julia Kempe

Publication date: 18 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.3715

zbMATH Keywords

entanglementquantum computinginteractive proof systemsmultiprover interactive proof systems

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ How to Verify a Quantum Computation ⋮ Parallelization of entanglement-resistant multi-prover interactive proofs

This page was built for publication: Using entanglement in quantum multi-prover interactive proofs