Sciweavers

519 search results - page 3 / 104
» On the Role of Shared Entanglement
Sort
View
FOCS
2008
IEEE
13 years 7 months ago
Quantum Multi Prover Interactive Proofs with Communicating Provers
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 6 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 8 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
TIT
2002
72views more  TIT 2002»
13 years 5 months ago
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
Charles H. Bennett, Peter W. Shor, John A. Smolin,...
USENIX
2003
13 years 7 months ago
Secure and Flexible Global File Sharing
Trust management credentials directly authorize actions, rather than divide the authorization task into authentication and access control. Unlike traditional credentials, which bi...
Stefan Miltchev, Vassilis Prevelakis, Sotiris Ioan...