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:2211.05271 · Quantum Information Processing

Quantum circuits for discrete-time quantum walks with position-dependent coin operator

Ugo Nzongani, Julien Zylberman, Carlo-Elia Doncecchi, Armando Pérez, Fabrice Debbasch, Pablo Arnault

Published Jul 1, 2023• 11 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-03957-8

Related papers

Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks

Ugo Nzongani, Pablo Arnault

arXiv:2304.10460•Quantum Information Processing•May 15, 2024•2 citations

Discrete-Time Quantum Walks with Even-Dimensional Coins

Yunguo Lin, Yong Wang, Chengwei Zheng +3 more

•Jan 1, 2026•0 citations

Discrete-time quantum walks with energy-dependent coins

Alana Spak dos Santos, Thiago T. Tsutsui, Fabiano M. Andrade

In this work, we extend the scattering quantum walk (SQW) framework to a lattice of energy-dependent point interactions. This yields, within the coined quantum walk (CQW) formalism, a coin operator that is directly related to the scattering matrix of zero-range potentials. The model thus provides a discrete-time quantum-walk (DTQW) analog of a periodic array of point interactions of the Kronig-Penney type, where the walker's wavenumber serves as a continuous, physically transparent control parameter for the coin operation. We analyze the spectra and the dynamics of position probability and entanglement, yielding distinct results for specific energies and point interactions. We relate the spectral structure to the spatial probability distribution and explicitly characterize the long-time entanglement behavior for each point interaction. The transmission modulus determines the quasienergy gap, bandwidth, and maximum group velocity, while also controlling the long-time coin-position entanglement for the initial state considered. The four families of one-dimensional point interactions ($δ$, $δ'$, crossed and asymmetric) realize qualitatively distinct transmission profiles and span the full range of behavior, including enhanced or strongly suppressed spreading and oscillatory entanglement.

quant-pharXiv:2609.03272•Sep 4, 2026•0 citations

Discrete-time quantum walks generated by aperiodic fractal sequence of space coin operators

R. F. S. Andrade, A. M. C. Souza

Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.

arXiv:1806.04041•International Journal of Modern Physics C•Sep 6, 2018•4 citations

Discrete-time quantum walks in qudit systems

Amit Saha, Debasri Saha, Amlan Chakrabarti

arXiv:2207.04319•The European Physical Journal Plus•Nov 5, 2024•5 citations

Efficient implementation of quantum walk-based algorithms into the quantum gate model of computation

Allan Wing Bocanegra

Discrete-time quantum walks provide a universal model of computation, meaning that any computation done by a general purpose quantum computer can also be done by discrete-time quantum walks. In the last decades great progress has been done in this field, developing quantum walk-based algorithms that can outperform classical ones. However, current quantum computers work based on the quantum circuit model of computation, and the mapping from one model to the other is an open problem, thus as an attempt to address this problem, we in this work develop basic theory, experiments and simulations on quantum walks presented in the following way: In the first part of this work we provide a matrix analysis of the evolution operator of Unitary Coined Discrete-Time Quantum Walks (UCDTQW), which leads to the fact that any quantum circuit applied on a bipartite system can be considered as the shift operator of a UCDTQW, and vice versa. Furthermore, we show that the fact that the statevector associated to a quantum walker in a UCDTQW is a bipartite system, inherits the evolution operator the property to be a block matrix, where each block is a Kraus operator. We show that associated to the shift operator of any UCDTQW, there exists a directed multigraph on which the walker moves, thus mimicking the functionality of the transition matrix in a random walk. We also extend the definition of the coin operator in a UCDTQW to a superposition of coins that act on different vertices of the graph on which the UCDTQW takes place, and provide a description of how this can be implemented in circuit form. In the second part of this work, we study the mapping of evolution operators to the quantum circuit model, based on a special case when the shift operator has a block diagonal matrix representation. In this case we propose a mapping process that is straightforward, and apply this method to obtain quantum circuits that generate UCDTQW on the most common topologies found in the literature: the straight line, the cyclic graph, the hypercube and the complete graph. In view that the mapping is not unique, we provide different models for the some topologies, along with techniques to synthesize them. The obtained circuits were implemented on IBM’s quantum computers through the Quantum Composer platform, obtaining mixed results for the different models, but being the circuit associated to the complete graph the one with best performance. Finally, in the third part of this work, we use the theoretical framework proposed in the first two parts to analyze and modify a quantum walk-based search algorithm which proposed over 20 years ago, and then execute it for the first time on a general-purpose quantum computer provided by IBM.

•Jan 1, 2023•0 citations
In this work, we extend the scattering quantum walk (SQW) framework to a lattice of energy-dependent point interactions. This yields, within the coined quantum walk (CQW) formalism, a coin operator that is directly related to the scattering matrix of zero-range potentials. The model thus provides a discrete-time quantum-walk (DTQW) analog of a periodic array of point interactions of the Kronig-Penney type, where the walker's wavenumber serves as a continuous, physically transparent control parameter for the coin operation. We analyze the spectra and the dynamics of position probability and entanglement, yielding distinct results for specific energies and point interactions. We relate the spectral structure to the spatial probability distribution and explicitly characterize the long-time entanglement behavior for each point interaction. The transmission modulus determines the quasienergy gap, bandwidth, and maximum group velocity, while also controlling the long-time coin-position entanglement for the initial state considered. The four families of one-dimensional point interactions (δδδ, δ′δ'δ′, crossed and asymmetric) realize qualitatively distinct transmission profiles and span the full range of behavior, including enhanced or strongly suppressed spreading and oscillatory entanglement.
Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.
Discrete-time quantum walks provide a universal model of computation, meaning that any computation done by a general purpose quantum computer can also be done by discrete-time quantum walks. In the last decades great progress has been done in this field, developing quantum walk-based algorithms that can outperform classical ones. However, current quantum computers work based on the quantum circuit model of computation, and the mapping from one model to the other is an open problem, thus as an attempt to address this problem, we in this work develop basic theory, experiments and simulations on quantum walks presented in the following way: In the first part of this work we provide a matrix analysis of the evolution operator of Unitary Coined Discrete-Time Quantum Walks (UCDTQW), which leads to the fact that any quantum circuit applied on a bipartite system can be considered as the shift operator of a UCDTQW, and vice versa. Furthermore, we show that the fact that the statevector associated to a quantum walker in a UCDTQW is a bipartite system, inherits the evolution operator the property to be a block matrix, where each block is a Kraus operator. We show that associated to the shift operator of any UCDTQW, there exists a directed multigraph on which the walker moves, thus mimicking the functionality of the transition matrix in a random walk. We also extend the definition of the coin operator in a UCDTQW to a superposition of coins that act on different vertices of the graph on which the UCDTQW takes place, and provide a description of how this can be implemented in circuit form. In the second part of this work, we study the mapping of evolution operators to the quantum circuit model, based on a special case when the shift operator has a block diagonal matrix representation. In this case we propose a mapping process that is straightforward, and apply this method to obtain quantum circuits that generate UCDTQW on the most common topologies found in the literature: the straight line, the cyclic graph, the hypercube and the complete graph. In view that the mapping is not unique, we provide different models for the some topologies, along with techniques to synthesize them. The obtained circuits were implemented on IBM’s quantum computers through the Quantum Composer platform, obtaining mixed results for the different models, but being the circuit associated to the complete graph the one with best performance. Finally, in the third part of this work, we use the theoretical framework proposed in the first two parts to analyze and modify a quantum walk-based search algorithm which proposed over 20 years ago, and then execute it for the first time on a general-purpose quantum computer provided by IBM.