Sciweavers

55 search results - page 2 / 11
» Adiabatic Quantum Computation is Equivalent to Standard Quan...
Sort
View
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 5 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
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 5 months ago
Non-classical Role of Potential Energy in Adiabatic Quantum Annealing
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical po...
Arnab Das
FOCS
2007
IEEE
13 years 11 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...
ECCC
2008
98views more  ECCC 2008»
13 years 5 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
AIPS
2006
13 years 6 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss