Sciweavers

28 search results - page 2 / 6
» Quantum Arthur-Merlin Games
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 10 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CORR
2010
Springer
197views Education» more  CORR 2010»
13 years 3 months ago
Quantum Strategic Game Theory
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relatio...
Shengyu Zhang
ENTCS
2008
89views more  ENTCS 2008»
13 years 6 months ago
A Quantum Game Semantics for the Measurement Calculus
In this paper we present a game semantics for a quantum programming language based on a new definition of quantum strategies. The language studied is MCdata, a typed version of th...
Yannick Delbecque
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 11 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 21 days ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
Rahul Jain, John Watrous