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...
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...
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...
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,...
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...