Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Scalable networks for discrete quantum random walks (4 pages)

Shingo Fujiwara

Published Jan 1, 2005• 0 citations
OpenAlex

Related papers

Quantum random walks using quantum accelerator modes (8 pages)

Keith R. Burnett, Zhi Ma, S. A. Gardiner +1 more

Physical Review A•Jan 1, 2006•1 citation

Scattering model for quantum random walks on a hypercube (8 pages)

Jozef Košík, Vladimír Bužek

Physical Review A•Jan 1, 2005•2 citations

Asymmetries in symmetric quantum walks on two-dimensional networks (9 pages)

A. Volta, Oliver Mülken, A. Blumen

Physical Review A•Jan 1, 2005•4 citations

From quantum graphs to quantum random walks

Gregor Tanner

arXiv:quant-ph/0504224•Springer eBooks•Jun 25, 2006•20 citations

Scalable networks for discrete quantum random walks

Shingo Fujiwara, H. Osaki, I. M. Buluta +1 more

Recently, quantum random walks (QRWs) have been thoroughly studied in order to develop new quantum algorithms. In this paper we propose scalable quantum networks for discrete QRWs on circles, lines, and also in higher dimensions. In our method the information about the position of the walker is stored in a quantum register and the network consists of only one-qubit rotation and ${(\text{controlled})}^{n}\text{\ensuremath{-}}\mathrm{NOT}$ gates, therefore it is purely computational and independent of the physical implementation. As an example, we describe the experimental realization in an ion-trap system.

Physical Review A•Sep 23, 2005•14 citations

Quantum random walks: an introductory overview

Julia Kempe

Contemporary Physics•Jan 1, 2009•130 citations
Recently, quantum random walks (QRWs) have been thoroughly studied in order to develop new quantum algorithms. In this paper we propose scalable quantum networks for discrete QRWs on circles, lines, and also in higher dimensions. In our method the information about the position of the walker is stored in a quantum register and the network consists of only one-qubit rotation and ${(\text{controlled})}^{n}\text{\ensuremath{-}}\mathrm{NOT}$ gates, therefore it is purely computational and independent of the physical implementation. As an example, we describe the experimental realization in an ion-trap system.