64 search results - page 1 / 13 » Quantum walk based search algorithms |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
CORR
2010
Springer
12 years 11 months ago
2010
Springer
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-...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
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...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...