Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Multi-oracle interactive protocols with constant space verifiers
Journal of Computer and System Sciences
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
A game-theoretic classification of interactive complexity classes
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Classical and Quantum Computation
Classical and Quantum Computation
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Multiparty Quantum Coin Flipping
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Quantum Weak Coin-Flipping with Bias of 0.192
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Upper Bounds for Quantum Interactive Proofs with Competing Provers
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Can quantum mechanics help distributed computing?
ACM SIGACT News
Proceedings of the forty-second ACM symposium on Theory of computing
Properties of local quantum operations with shared entanglement
Quantum Information & Computation
Journal of the ACM (JACM)
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the existence of loss-tolerant quantum oblivious transfer protocols
Quantum Information & Computation
| Hi-index | 0.00 |
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus on a representation of quantum strategies that generalizes the Choi-Jamiolkowski representation of quantum , with respect to which each strategy is described by a single operations. This new representation associates with each strategy a positive semidefinite operator acting only on 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 simple proof of Kitaev's lower bound for strong coin-flipping, and the second is a proof of the exact characterization QRG = EXP of the class of problems having quantum refereed games.