233 search results - page 6 / 47 » Interactive Proofs For Quantum Computations |
103
click to vote
STOC
1993
ACM
15 years 3 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
112
click to vote
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
EUROCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...