QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
By Andris Ambainis. 2003
575 citations recorded by the source corpus.
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/2180a338a7702f658037bdd1f1f44e159690e5ed
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Salvador Elías Venegas-Andraca
- Miklos Santha
- Andrew M. Childs
- Frédéric Magniez
- Ashwin Nayak
- Jérémie Roland
- Ryan Babbush
- Hartmut Neven
In Computational Theory and Mathematics
- Salvador Elías Venegas-Andraca
- Miklos Santha
- Andrew M. Childs
- Frédéric Magniez
- Ashwin Nayak
- Jérémie Roland
- Andris Ambainis
- Hartmut Neven
Citations in the corpus
- Search via quantum walk (2006, methodology): “Generally coined quantum walk can make quantum walk faster than the continuous time quantum walk( Ambainis (2005)).”
- Quantum walks: a comprehensive review (2012, background): “A variant of Definition 16, the element distinctness problem, was analyzed by Ambainis in [28]: Definition 21 Element distinctness problem [410].”
- Quantum walk algorithm for element distinctness (2003, methodology): “We will also use families of permutations with a similar properties.”
- Universal quantum computation using the discrete-time quantum walk (2009, background): “d in computer science for algorithm design, many quantum algorithms have been developed based upon quantum walks, with varying speed ups over the best known classical algorithms for the same problem, [7]. These solve the problems using two different approaches: hitting times and searching. In hitting”
- Quantum Walk Based Search Algorithms (2008, methodology): “For a detailed introduction to quantum walks the reader is referred to the excellent surveys of Kempe [20] and Ambainis [5].”
- What is the Computational Value of Finite Range Tunneling (2015, background): “[82] Andris Ambainis, Quantum Walks and Their Algorithmic Applications, Int.”