Sciweavers

23 search results - page 3 / 5
» One-dimensional quantum walks
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 2 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 11 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
STOC
2003
ACM
88views Algorithms» more  STOC 2003»
14 years 7 months ago
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto, Ed...