Quantum hedging in two-round prover-verifier interactions
From MaRDI portal
Publication:4637979
DOI10.4230/LIPICS.TQC.2017.5zbMATH Open1427.81007arXiv1310.7954OpenAlexW2963833961MaRDI QIDQ4637979FDOQ4637979
Authors: Srinivasan Arunachalam, Abel Molina, Vincent F. Russo 
Publication date: 3 May 2018
Abstract: We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and Watrous (arXiv:1104.1140) studied such a game that exhibited a perfect form of hedging, where the risk of losing a first game can completely offset the corresponding risk for a second game. This is a non-classical quantum phenomenon, and establishes the impossibility of performing strong error-reduction for quantum interactive proof systems by parallel repetition, unlike for classical interactive proof systems. We take a step in this article towards a better understanding of the hedging phenomenon by giving a complete characterization of when perfect hedging is possible for a natural generalization of the game in arXiv:1104.1140. Exploring in a different direction the subject of quantum hedging, and motivated by implementation concerns regarding loss-tolerance, we also consider a variation of the protocol where the player who receives the question can choose to restart the game rather than return an answer. We show that in this setting there is no possible hedging for any game played with state spaces corresponding to finite-dimensional complex Euclidean spaces.
Full work available at URL: https://arxiv.org/abs/1310.7954
Recommendations
- STACS 2005
- Quantum coin hedging, and a counter measure
- Quantum multiprover interactive proofs with communicating provers
- Quantum interactive proofs and the complexity of separability testing
- On the power of quantum, one round, two prover interactive proof systems
- Using entanglement in quantum multi-prover interactive proofs
- Quantum interactive proofs with weak error bounds
- scientific article; zbMATH DE number 1979492
- Constant-space quantum interactive proofs against multiple provers
- On QMA protocols with two short quantum proofs
Applications of game theory (91A80) Cryptography (94A60) Quantum measurement theory, state operations, state preparations (81P15) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Disciplined convex programming
- Proposed experiment to test local hidden-variable theories
- Quantum computing, postselection, and probabilistic polynomial-time
- Unbounded-error quantum computation with small space bounds
- Symmetry groups, semidefinite programs, and sums of squares
- Near-optimal and explicit Bell inequality violations
- Towards a general theory of quantum games
- Simple unified form for the major no-hidden-variables theorems
- Properties of local quantum operations with shared entanglement
- Title not available (Why is that?)
- A Parallel Repetition Theorem
- Two-Message Quantum Interactive Proofs Are in PSPACE
- Title not available (Why is that?)
- Small value parallel repetition for general games
- Hedging bets with correlated quantum strategies
- Postselection finite quantum automata
- Entanglement in Interactive Proof Systems with Binary Answers
- Quantum hedging in two-round prover-verifier interactions
Cited In (3)
Uses Software
This page was built for publication: Quantum hedging in two-round prover-verifier interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637979)
