25 search results - page 3 / 5 » Mixed States in Quantum Cryptography |
COCO
2005
Springer
15 years 5 months ago
2005
Springer
109
click to vote
STOC
2003
ACM
15 years 12 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
112
click to vote
TOC
2010
14 years 6 months ago
2010
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
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, ...