Quantum interactive proofs with competing provers

DOI10.1007/978-3-540-31856-9_50MaRDI QIDQ5710712zbMATH OpenOpenAlexFDO

Authors Gus Gutoski, John Watrous

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Quantum multiprover interactive proofs with communicating provers
• Quantum multi-prover interactive proof systems with limited prior entanglement.
• scientific article; zbMATH DE number 5899305
• Quantum multi-prover interactive proof systems with limited prior entanglement
• PSPACE has constant-round quantum interactive proof systems

Cited in

(13)

• Constant-space quantum interactive proofs against multiple provers
• On the power of quantum, one round, two prover interactive proof systems
• scientific article; zbMATH DE number 5899305 (Why is no real title available?)
• Parallel approximation of min-max problems
• Pointer Quantum PCPs and Multi-Prover Games
• Quantum coin hedging, and a counter measure
• Quantum hedging in two-round prover-verifier interactions
• Interactive proofs with competing teams of no-signaling provers
• scientific article; zbMATH DE number 6292749 (Why is no real title available?)
• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Complexity limitations on one-turn quantum refereed games
• The entangled quantum polynomial hierarchy collapses
• Random measurement bases, quantum state distinction and applications to the hidden subgroup problem

This page was built for publication: Quantum interactive proofs with competing provers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710712)