6533b832fe1ef96bd129ab6c
RESEARCH PRODUCT
Quantum Random Walks – New Method for Designing Quantum Algorithms
Andris Ambainissubject
Discrete mathematicsTheoretical computer scienceHeterogeneous random walk in one dimensionQuantum annealingTheoryofComputation_GENERALRandom walkMathematics::ProbabilitySearch algorithmComputerSystemsOrganization_MISCELLANEOUSQuantum phase estimation algorithmQuantum algorithmQuantum walkQuantum computerMathematicsdescription
Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on "glued trees" graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2008-01-05 |