On the power of quantum, one round, two prover interactive proof systems
From MaRDI portal
Publication:2467210
DOI10.1007/S11128-007-0068-ZzbMATH Open1137.81008DBLPjournals/qip/RapaportT07arXiv0707.1136OpenAlexW2085002016WikidataQ62398469 ScholiaQ62398469MaRDI QIDQ2467210FDOQ2467210
Publication date: 21 January 2008
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is characterized as a superoperator norm. We get some partial results about the superoperator norm, and in particular we analyze the "rank one" case.
Full work available at URL: https://arxiv.org/abs/0707.1136
Recommendations
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- STACS 2005
- Quantum multiprover interactive proofs with communicating provers
- Quantum interactive proofs and the complexity of separability testing
- Quantum interactive proofs with weak error bounds
- On quantum interactive proofs with short messages
- scientific article; zbMATH DE number 1979492
- On the power of many one-bit provers
- Constant-space quantum interactive proofs against multiple provers
Cites Work
- Title not available (Why is that?)
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Title not available (Why is that?)
- Non-deterministic exponential time has two-prover interactive protocols
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Quantum multi-prover interactive proof systems with limited prior entanglement.
Cited In (2)
This page was built for publication: On the power of quantum, one round, two prover interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467210)
