Quantum hedging in two-round prover-verifier interactions

DOI10.4230/LIPIcs.TQC.2017.5zbMath1427.81007arXiv1310.7954OpenAlexW2963833961MaRDI QIDQ4637979

Vincent F. Russo, Abel Molina, Srinivasan Arunachalam

Publication date: 3 May 2018

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

zbMATH Keywords

quantum informationparallel repetitionprover-verifier interactions

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Quantum measurement theory, state operations, state preparations (81P15) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

Quantum hedging in two-round prover-verifier interactions ⋮ Quantum coin hedging, and a counter measure

Uses Software

• CVX
• QETLAB

Cites Work

• Unbounded-error quantum computation with small space bounds
• Symmetry groups, semidefinite programs, and sums of squares
• Small Value Parallel Repetition for General Games
• Near-Optimal and Explicit Bell Inequality Violations
• Postselection Finite Quantum Automata
• A Parallel Repetition Theorem
• Simple unified form for the major no-hidden-variables theorems
• Quantum hedging in two-round prover-verifier interactions
• Two-Message Quantum Interactive Proofs Are in PSPACE
• Hedging bets with correlated quantum strategies
• Proposed Experiment to Test Local Hidden-Variable Theories
• Quantum computing, postselection, and probabilistic polynomial-time
• Entanglement in Interactive Proof Systems with Binary Answers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum hedging in two-round prover-verifier interactions