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

arXiv:quant-ph/0210055

The underlying digraph of a coined quantum random walk

Simone Severini B

Published Oct 8, 2002• 9 citations
arXivHTMLPDF

Abstract

We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs and in-split graphs in symbolic dynamics.
DOI
10.48550/arxiv.quant-ph/0210055

Related papers

Line digraphs and coined quantum random walks

Simone Severini B

Abstract. In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The notion of line digraph has been introduced by Harary and Norman [HN60] in 1960. A classic survey on line graphs and digraphs is [HB78]; a recent one is [P95]. Line digraphs are used in the design and analysis of interconnection networks (see e.g. [FYA84]). Line digraphs are also used in algorithms for DIRECTED MAX-CUT [CE90] and TRAVELLING SALESMAN [GKWS98]. Definition 1 (Line digraph). The line digraph − → LD of a digraph ( D = (V, A) is the

•Oct 8, 2002•2 citations

Discrete Quantum Walks on Graphs and Digraphs

Chris D. Godsil, Hanmeng Zhan

Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.

Cambridge University Press eBooks•Dec 23, 2022•15 citations

Generic quantum walks with memory on regular graphs

Dan Li, Michael Mc Gettrick, Fei Gao +2 more

Quantum walks with memory (QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM have been presented up to now. It is desired to design more QWM for research, so that we can explore the potential of QWM. In this work, by presenting the one-to-one correspondence between QWM on a regular graph and quantum walks without memory (QWoM) on a line digraph of the regular graph, we construct a generic model of QWM on regular graphs. This construction gives a general scheme for building all possible standard QWM on regular graphs and makes it possible to study properties of different kinds of QWM. Here, by taking the simplest example, which is QWM with one memory on the line, we analyze some properties of QWM, such as variance, occupancy rate, and localization.

arXiv:1508.07674•Physical Review A•Apr 15, 2016•17 citations

Staggered quantum walks on graphs

Renato Portugal

The staggered quantum-walk model makes it possible to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model, which in its turn is entirely included in the staggered model. In order to compare those three quantum-walk models, we put them in the staggered formalism and show that the Szegedy and coined models are defined on a special subclass of graphs. This inclusion scheme is also true when the searching framework is added. We use graph theory to characterize which staggered quantum walks can be reduced to the Szegedy or coined quantum-walk model. We analyze a staggered-based search that cannot be included in Szegedy's model and show numerically that this search is more efficient than a random-walk-based search.

arXiv:1603.02210•Physical Review A•Jun 27, 2016•46 citations

Coined quantum walks on percolation graphs

Godfrey Leung, Paul Knott, Joe Bailey +1 more

Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line), we introduce a simple notion of quantum tunnelling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero as the percolation probability decreases towards the critical point. This provides an example of fractional scaling in quantum-walk dynamics.

arXiv:1006.1283•New Journal of Physics•Dec 9, 2010•49 citations

Classification of coined quantum walks on the line and comparison to correlated classical random walks

Lukas Hantzko, Lennart Binkowski

Abstract We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead to symmetric quantum walks for arbitrary coins and provide a bijective parametrisation of all symmetric quantum walks modulo distributional equivalence. Extending beyond the symmetric case, we also give a surjective parametrisation of all coined quantum walks under the same equivalence relation, as well as a bijective parametrisation modulo equivalence of their limiting distributions. Furthermore, we derive corrected closed-form expressions for the walk amplitudes, resolving inaccuracies in previous literature, and generalise the approach to the correlated classical random walk. This unified framework enables a direct comparison between quantum and classical dynamics. Additionally, we discuss the asymptotic scaling of variances for both models, identifying quadratic spreading as a hallmark of non-trivial quantum walks and contrasting it with the linear behaviour of classical walks, except at the extremal points of maximal correlation. Finally, we compare the limiting distributions arising from quantum walks with those of the classical case. Graphical abstract - compact classification results for symmetric and general quantum walks, as well as classically correlated random walks - quantum walks spread ballistically while classically correlated random walks approach Gaussian limiting distribution - quantum coin parameter directly influence limiting distribution’s skewness

arXiv:2507.23524•The European Physical Journal D•Jul 1, 2026•0 citations
Abstract. In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The notion of line digraph has been introduced by Harary and Norman [HN60] in 1960. A classic survey on line graphs and digraphs is [HB78]; a recent one is [P95]. Line digraphs are used in the design and analysis of interconnection networks (see e.g. [FYA84]). Line digraphs are also used in algorithms for DIRECTED MAX-CUT [CE90] and TRAVELLING SALESMAN [GKWS98]. Definition 1 (Line digraph). The line digraph − → LD of a digraph ( D = (V, A) is the
Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.
Quantum walks with memory (QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM have been presented up to now. It is desired to design more QWM for research, so that we can explore the potential of QWM. In this work, by presenting the one-to-one correspondence between QWM on a regular graph and quantum walks without memory (QWoM) on a line digraph of the regular graph, we construct a generic model of QWM on regular graphs. This construction gives a general scheme for building all possible standard QWM on regular graphs and makes it possible to study properties of different kinds of QWM. Here, by taking the simplest example, which is QWM with one memory on the line, we analyze some properties of QWM, such as variance, occupancy rate, and localization.
The staggered quantum-walk model makes it possible to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model, which in its turn is entirely included in the staggered model. In order to compare those three quantum-walk models, we put them in the staggered formalism and show that the Szegedy and coined models are defined on a special subclass of graphs. This inclusion scheme is also true when the searching framework is added. We use graph theory to characterize which staggered quantum walks can be reduced to the Szegedy or coined quantum-walk model. We analyze a staggered-based search that cannot be included in Szegedy's model and show numerically that this search is more efficient than a random-walk-based search.
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line), we introduce a simple notion of quantum tunnelling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero as the percolation probability decreases towards the critical point. This provides an example of fractional scaling in quantum-walk dynamics.
Abstract We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead to symmetric quantum walks for arbitrary coins and provide a bijective parametrisation of all symmetric quantum walks modulo distributional equivalence. Extending beyond the symmetric case, we also give a surjective parametrisation of all coined quantum walks under the same equivalence relation, as well as a bijective parametrisation modulo equivalence of their limiting distributions. Furthermore, we derive corrected closed-form expressions for the walk amplitudes, resolving inaccuracies in previous literature, and generalise the approach to the correlated classical random walk. This unified framework enables a direct comparison between quantum and classical dynamics. Additionally, we discuss the asymptotic scaling of variances for both models, identifying quadratic spreading as a hallmark of non-trivial quantum walks and contrasting it with the linear behaviour of classical walks, except at the extremal points of maximal correlation. Finally, we compare the limiting distributions arising from quantum walks with those of the classical case. Graphical abstract - compact classification results for symmetric and general quantum walks, as well as classically correlated random walks - quantum walks spread ballistically while classically correlated random walks approach Gaussian limiting distribution - quantum coin parameter directly influence limiting distribution’s skewness