Experimental implementation of the quantum random-walk algorithm
By Jiangfeng Du, Hui Li, Xiaodong Xu, M. Shi, Jihui Wu, Xianyi Zhou, R. Han. 2002
178 citations recorded by the source corpus.
The quantum random walk is a possible approach to construct quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper, we present the experimental implementation of the quantum random-walk algorithm on a nuclear-magnetic-resonance quantum computer. We observe that the quantum walk is in sharp contrast to its classical counterpart. In particular, the properties of the quantum walk strongly depends on the quantum entanglement.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/a6e647eb8dc7f3ad1e539a8ddb588a58baa17887
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
- Miklos Santha
- Ashwin Nayak
- Jérémie Roland
- Frédéric Magniez
- Andrew M. Childs
- Salvador Elías Venegas-Andraca
- Vedran Dunjko
- Hans J. Briegel
In Computational Theory and Mathematics
- Miklos Santha
- Ashwin Nayak
- Jérémie Roland
- Frédéric Magniez
- Andrew M. Childs
- Salvador Elías Venegas-Andraca
- Vedran Dunjko
- Hans J. Briegel
Citations in the corpus
- Search via quantum walk (2006, background): “Indeed, we can write | ψ i as S and S is a subspace of A + B , conclusion (3) of Theorem 6 can be applied, which implies that | τ ik ≤ 2 1 ck .”