Results 1  10
of
42
Consequences and Limits of Nonlocal Strategies
, 2010
"... Thispaperinvestigatesthepowersandlimitationsofquantum entanglementinthecontext of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement outperform all possible classical strategies. One implication ofthese examples ..."
Abstract

Cited by 120 (20 self)
 Add to MetaCart
(Show Context)
Thispaperinvestigatesthepowersandlimitationsofquantum entanglementinthecontext of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement outperform all possible classical strategies. One implication ofthese examplesis that entanglement canprofoundly affectthesoundness property of twoprover interactive proof systems. We then establish limits on the probability with which strategies making use of entanglement can win restricted types of nonlocal games. These upperbounds mayberegardedasgeneralizationsof Tsirelsontypeinequalities, which place bounds on the extent to which quantum information can allow for the violation of Bell inequalities. We also investigate the amount of entanglement required by optimal and nearly optimal quantum strategies forsome games.
Toward a general theory of quantum games
 In Proceedings of 39th ACM STOC
, 2006
"... Abstract We study properties of quantum strategies, which are complete specifications of a givenparty's actions in any multipleround interaction involving the exchange of quantum information with one or more other parties. In particular, we focus on a representation of quantumstrategies that g ..."
Abstract

Cited by 44 (14 self)
 Add to MetaCart
(Show Context)
Abstract We study properties of quantum strategies, which are complete specifications of a givenparty's actions in any multipleround interaction involving the exchange of quantum information with one or more other parties. In particular, we focus on a representation of quantumstrategies that generalizes the ChoiJamiol/kowski representation of quantum operations. This new representation associates with each strategy a positive semidefinite operator acting onlyon the tensor product of its input and output spaces. Various facts about such representations are established, and two applications are discussed: the first is a new and conceptually simpleproof of Kitaev's lower bound for strong coinflipping, and the second is a proof of the exact characterization QRG = EXP of the class of problems having quantum refereed games. 1 Introduction The theory of games provides a general structure within which both cooperation and competitionamong independent entities may be modeled, and provides powerful tools for analyzing these models. Applications of this theory have fundamental importance in many areas of science.This paper considers games in which the players may exchange and process quantum information. We focus on competitive games, and within this context the types of games we consider arevery general. For instance, they allow multiple rounds of interaction among the players involved, and place no restrictions on players ' strategies beyond those imposed by the theory of quantuminformation. While classical games can be viewed as a special case of quantum games, it is important tostress that there are fundamental differences between general quantum games and classical games. For example, the two most standard representations of classical games, namely the normal formand extensive form representations, are not directly applicable to general quantum games. This is due to the nature of quantum information, which admits a continuum of pure (meaning extremal)
Alexandria digital library
 Communications of the ACM
, 1995
"... We investigate definitions of and protocols for multiparty quantum computing in the scenario where the secret data are quantum systems. We work in the quantum informationtheoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of veri ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
We investigate definitions of and protocols for multiparty quantum computing in the scenario where the secret data are quantum systems. We work in the quantum informationtheoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to establish that any multiparty quantum computation can be securely performed as long as the number of dishonest players is less than n/6.
Interaction in Quantum Communication and the Complexity of Set Disjointness
, 2001
"... One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet in some scenarios there are ways of conveying information with much fewer, even exponentially fewer, qubits than possible ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
(Show Context)
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet in some scenarios there are ways of conveying information with much fewer, even exponentially fewer, qubits than possible classically [1], [2], [3]. Moreover, some of these methods have a very simple structurethey involve only few message exchanges between the communicating parties. We consider the question as to whether every classical protocol may be transformed to a \simpler" quantum protocolone that has similar eciency, but uses fewer message exchanges.
Quantum weak coin flipping with arbitrarily small bias
 WCF, 2007. quantph:0711.4114. 11 [SR01] [SR02] Ashwin Nayak and
"... “God does not play dice. He flips coins instead. ” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructio ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
“God does not play dice. He flips coins instead. ” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kitaev’s formalism relating coin flipping and operator monotone functions may succeed. For those foolhardy enough to even try, a complete tutorial is included. Contents 1
On Rounds in Quantum Communication
 IEEE Transactions on Information Theory
, 2000
"... We investigate the power of interaction in two player quantum communication protocols. Our main result is a roundscommunication hierarchy for the pointer jumping function f k . We show that f k needs quantum communication n) if Bob starts the communication and the number of rounds is limited to k ( ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We investigate the power of interaction in two player quantum communication protocols. Our main result is a roundscommunication hierarchy for the pointer jumping function f k . We show that f k needs quantum communication n) if Bob starts the communication and the number of rounds is limited to k (for any constant k). Trivially, if Alice starts, O(k log n) communication in k rounds suces. The lower bound employs a result relating the relative von Neumann entropy between density matrices to their trace distance and uses a new measure of information.
An Optimally Fair Coin Toss
"... We address one of the foundational problems in cryptography: the bias of coinflipping protocols. Coinflipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We address one of the foundational problems in cryptography: the bias of coinflipping protocols. Coinflipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of the honest party. A classical result by Cleve [STOC ’86] showed that for any twoparty rround coinflipping protocol there exists an efficient adversary that can bias the output of the honest party by Ω(1/r). However, the best previously known protocol only guarantees O(1 / √ r) bias, and the question of whether Cleve’s bound is tight has remained open for more than twenty years. In this paper we establish the optimal tradeoff between the round complexity and the bias of twoparty coinflipping protocols. Under standard assumptions, we show that Cleve’s lower bound is tight: we construct an rround protocol with bias O(1/r).
Multiparty quantum coin flipping
 Proceedings of the 19th IEEE Annual Conference on Computational Complexity, 250–259
, 2004
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Exact quantum algorithms for the leader election problem
 In Proceedings of the TwentySecond Symposium on Theoretical Aspects of Computer Science (STACS 2005), volume 3404 of Lecture Notes in Computer Science
, 2005
"... ar ..."
(Show Context)
Parallel approximation of noninteractive zerosum quantum games
, 2008
"... This paper studies a simple class of zerosum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players ’ payoffs. We prove that an equilibrium point of any such game can be approxi ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
This paper studies a simple class of zerosum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players ’ payoffs. We prove that an equilibrium point of any such game can be approximated by means of an efficient parallel algorithm, which implies that oneturn quantum refereed games, wherein the referee is specified by a quantum circuit, can be simulated in polynomial space. 1