Sciweavers

587 search results - page 33 / 118
» Quantum computation and quantum information
Sort
View
QCQC
1998
Springer
104views Communications» more  QCQC 1998»
14 years 2 months ago
Trapped Ion Quantum Computer Research at Los Alamos
Abstract. We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are d...
D. F. V. James, M. S. Gulley, M. H. Holzscheiter, ...
FOCS
1998
IEEE
14 years 2 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
FOCS
2007
IEEE
14 years 4 months ago
The Power of Quantum Systems on a Line
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ASAP
2006
IEEE
109views Hardware» more  ASAP 2006»
14 years 4 months ago
Describing Quantum Circuits with Systolic Arrays
In the simulation of quantum circuits the matrices and vectors used to represent unitary operations and qubit states grow exponentially as the number of qubits increase. For insta...
Aasavari Bhave, Eurípides Montagne, Edgar G...