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:1109.3507

Spectral analysis of discrete-time quantum walks in the quarter plane

Clement Boateng Ampadu

Published Sep 15, 2011• 1 citation
arXivHTMLPDF

Abstract

Using the Cantero-Grunbaum-Moral-Velazquez (CGMV) method, we obtain the spectral measure for the quantum walk.
DOI
10.48550/arxiv.1109.3507

Related papers

The CGMV method for quantum walks

Maŕıa José Cantero, F. Alberto Grünbaum, L. Moral +1 more

Quantum Information Processing•Jul 15, 2012•54 citations

A Spectral Analysis of Discrete-Time Quantum Walks Related to the Birth and Death Chains

Choon-Lin Ho, Yusuke Ide, Norio Konno +2 more

arXiv:1706.01005•Journal of Statistical Physics•Mar 8, 2018•7 citations

Spectral Bounds and Quantum State Reconstruction in Multi-dimensional Discrete-Time Quantum Walks

Yiwen Ye, Yunguo Lin

Communications in computer and information science•Jan 1, 2025•0 citations

Localization of discrete-time quantum walks on a half line via the CGMV method

Norio Konno, Etsuo Segawa

We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. [1] showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle [2], expresses the dynamics of the quantum walk. Using the CGMV method introduced by them, the name is taken from their initials, we obtain the spectral measure for the quantum walk. As a corollary, we give another proof for localization of the quantum walk on homogeneous trees shown by Chisaki et al. [3].

arXiv:1008.5109•Aug 30, 2010•7 citations

Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix

M. A. Jafarizadeh, S. Salimi

arXiv:quant-ph/0510174•Annals of Physics•Feb 3, 2007•56 citations

On aggregation-quantization permutability problem for discrete-time Markov chains

Adam Doliwa, Artur Siemaszko, Adam Zalewski

Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding aggregated process. We extend the aggregation technique to the level of quantum Markov chains. We provide conditions under which application of these two operations - Szegedy's quantization and aggregation - give the same result. These consist of the strong lumpability of the underlying Markov chain supplemented by nonlinear relations, generalizing Kolmogorov's cycle condition, that account for the coefficients of both the original and the aggregated transition matrices. In particular, we show that the conditions are satisfied in the case of the random walk on graphs equipped with equitable partitions. We present several examples, which include the classical/quantum walks on Platonic solids. We discuss also relation of discrete-time classical/quantum walks on $N$-dimensional hypercube and the Ehrenfests urn model with $N$ particles. We apply our technique for of discrete-time walks on Cayley graphs of free groups. We also compare our results with those obtained using Cantero-Moral-Velazquez uniformization of unitary matrices.

quant-pharXiv:2603.14269•Mar 17, 2026•0 citations
We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. [1] showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle [2], expresses the dynamics of the quantum walk. Using the CGMV method introduced by them, the name is taken from their initials, we obtain the spectral measure for the quantum walk. As a corollary, we give another proof for localization of the quantum walk on homogeneous trees shown by Chisaki et al. [3].
Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding aggregated process. We extend the aggregation technique to the level of quantum Markov chains. We provide conditions under which application of these two operations - Szegedy's quantization and aggregation - give the same result. These consist of the strong lumpability of the underlying Markov chain supplemented by nonlinear relations, generalizing Kolmogorov's cycle condition, that account for the coefficients of both the original and the aggregated transition matrices. In particular, we show that the conditions are satisfied in the case of the random walk on graphs equipped with equitable partitions. We present several examples, which include the classical/quantum walks on Platonic solids. We discuss also relation of discrete-time classical/quantum walks on NNN-dimensional hypercube and the Ehrenfests urn model with NNN particles. We apply our technique for of discrete-time walks on Cayley graphs of free groups. We also compare our results with those obtained using Cantero-Moral-Velazquez uniformization of unitary matrices.