Sciweavers

508 search results - page 50 / 102
» Poly-locality in quantum computing
Sort
View
AC
1998
Springer
14 years 28 days ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
DIS
2001
Springer
14 years 1 months ago
An Integrated Framework for Extended Discovery in Particle Physics
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...
Sakir Kocabas, Pat Langley
IDTRUST
2009
ACM
14 years 3 months ago
Quantum resistant public key cryptography: a survey
Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which c...
Ray A. Perlner, David A. Cooper
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 8 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
COMPUTER
2000
96views more  COMPUTER 2000»
13 years 8 months ago
Beyond Bits: The Future of Quantum Information Processing
Andrew M. Steane, Eleanor G. Rieffel