Sciweavers

121 search results - page 20 / 25
» The complexity of the Quantum Adiabatic Algorithm
Sort
View
FOCS
2003
IEEE
15 years 3 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 7 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson
DAC
2010
ACM
15 years 2 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
DAC
2004
ACM
15 years 11 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
RIVF
2007
14 years 11 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille