Sciweavers

1352 search results - page 199 / 271
» Fault-Tolerant Quantum Computation
Sort
View
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

Lecture Notes
889views
15 years 7 months ago
Future Directions in Computing
Silicon-based electronics is the foundation of computing devices. The computer industry is reaching an important milestone, where physical limits arising from using optical lithogr...
Sherief Reda
STACS
1999
Springer
14 years 13 days ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer
BMCBI
2005
130views more  BMCBI 2005»
13 years 8 months ago
Squid - a simple bioinformatics grid
Background: BLAST is a widely used genetic research tool for analysis of similarity between nucleotide and protein sequences. This paper presents a software application entitled &...
Paulo C. Carvalho, Rafael V. Glória, Antoni...