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:1804.04331 · Physical Review A

Boundary-induced coherence in the staggered quantum walk on different topologies

Jalil Khatibi Moqadam, A. T. Rezakhani

Published Jul 18, 2018• 5 citations
arXivHTMLPDF

Abstract

The staggered quantum walk is a type of discrete-time quantum-walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered dynamics on a two-dimensional lattice composed of superconducting microwave resonators connected with tunable couplings. The naive generalization of the one-dimensional staggered dynamics generates two uncoupled one-dimensional quantum walks; thus more complex partitions need to be employed. However, by analyzing the coherence of the dynamics, we show that the quantumness of the evolution corresponding to two independent one-dimensional quantum walks can be elevated to the level of a single two-dimensional quantum walk, only by modifying the boundary conditions. In fact, by changing the lattice boundary conditions (or topology), we explore the walk on different surfaces such as a torus, a Klein bottle, a real projective plane, and a sphere. The coherence and the entropy reach different levels depending on the topology of the surface. We observe that the entropy captures similar information as coherence; thus we use it to explore the effects of boundaries on the dynamics of the continuous-time quantum walk and the classical random walk.

DOI
10.1103/physreva.98.012123

Related papers

Staggered quantum walk on hexagonal lattices

Bruno Chagas, Renato Portugal, Stefan Boettcher +1 more

A discrete-time staggered quantum walk was recently introduced as a generalization that allows the unification of other versions, such as the coined and Szegedy's walk. However, it also produces forms of quantum walks not covered by previous versions. To explore their properties, we study here the staggered walk on a hexagonal lattice. Such a walk is defined using a set of overlapping tessellations that cover the graph edges, and each tessellation is a partition of the node set into cliques. The hexagonal lattice requires at least three tessellations. Each tessellation is associated with a local unitary operator and the product of the local operators defines the evolution operator of the staggered walk on the graph. After defining the evolution operator on the hexagonal lattice, we analyze the quantum walk dynamics with the focus on the position standard deviation and localization. We also obtain analytic results for the time complexity of spatial search algorithms with one marked node using cyclic boundary conditions.

arXiv:1806.10249•Physical Review A•Nov 9, 2018•5 citations

Staggered quantum walks with superconducting microwave resonators

Jalil Khatibi Moqadam, M. C. de Oliveira, Renato Portugal

The staggered quantum walk is a model defined by the product of local operators associated with two or more independent graph tessellations. This model is versatile, encompasses several well-known discrete-time quantum walks, and inherits interesting features of the continuous-time quantum walk. We propose an implementation of the staggered quantum walk model with superconducting microwave resonators, where the required local operations are provided by the nearest neighbor interaction of the resonators coupled through superconducting quantum interference devices. The tunability of the interactions makes this system an excellent toolbox for this class of quantum walks. We focus on the one-dimensional case and discuss its generalization to a more general class known as triangle-free graphs.

arXiv:1609.09844•Physical review. B./Physical review. B•Apr 5, 2017•16 citations

Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians

Renato Portugal, Tharso D. Fernandes

Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It avails to test the ability of quantum walk models to provide efficient algorithms from the theoretical side and means to implement quantum walks in laboratories from the practical side. In this paper, we rigorously prove that the recent-proposed staggered quantum walk model provides an efficient quantum search on the two-dimensional lattice, if the reflection operators associated with the graph tessellations are used as Hamiltonians, which is an important theoretical result for validating the staggered model with Hamiltonians. Numerical results show that on the two-dimensional lattice staggered models without Hamiltonians are not as efficient as the one described in this paper and are, in fact, as slow as classical random-walk-based algorithms.

arXiv:1701.01468•Physical Review A•Apr 26, 2017•19 citations

A simulator for discrete quantum walks on lattices

João Rodrigues, Nikola Paunković, Paulo Mateus

In this paper, we present a simulator for two-particle quantum walks on the line and one-particle on a two-dimensional squared lattice. It can be used to investigate the equivalence between the two cases (one- and two-particle walks) for various boundary conditions (open, circular, reflecting, absorbing and their combinations). For the case of a single walker on a two-dimensional lattice, the simulator can also implement the Möbius strip. Furthermore, other topologies for the walker are also simulated by the proposed tool, like certain types of planar graphs with degree up to 4, by considering missing links over the lattice. The main purpose of the simulator is to study the genuinely quantum effects on the global properties of the two-particle joint probability distribution on the entanglement between the walkers/axis. For that purpose, the simulator is designed to compute various quantities such as: the entanglement and classical correlations, (classical and quantum) mutual information, the average distance between the two walkers, different hitting times and quantum discord. These quantities are of vital importance in designing possible algorithmic applications of quantum walks, namely in search, 3-SAT problems, etc. The simulator can also implement the static partial measurements of particle(s) positions and dynamic breaking of the links between certain nodes, both of which can be used to investigate the effects of decoherence on the walker(s). Finally, the simulator can be used to investigate the dynamic Anderson-like particle localization by varying the coin operators of certain nodes on the line/lattice. We also present some illustrative and relevant examples of one- and two-particle quantum walks in various scenarios. The tool was implemented in C and is available on-line at http://qwsim.weebly.com/ .

International Journal of Modern Physics C•Mar 2, 2017•3 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•44 citations

Robust Genuine Multipartite Entanglement in Two Walker Quantum Walks

Sandipan Hazra, Tamoghna Das, Sougato Bose +1 more

Discrete-time quantum walks provide a versatile framework for investigating the generation, redistribution, and transport of quantum correlations in composite quantum systems. Here, we study the dynamics of bipartite and genuine multipartite entanglement in a two-walker discrete-time quantum walk on a one-dimensional lattice. By employing logarithmic negativity and the generalized geometric measure (GGM), we systematically characterize the redistribution of bipartite entanglement among different subsystem partitions and the emergence of genuine multipartite entanglement involving the two coin and two position degrees of freedom. We show that the entanglement dynamics are strongly influenced by the lattice topology. The open-boundary regime exhibits a monotonic redistribution of quantum correlations, whereas the closed-boundary regime gives rise to pronounced oscillatory behavior due to boundary-induced interference and recurrent wave-packet overlap. In the open-boundary regime, the GGM rapidly approaches its theoretical maximum value of $1/2$ and remains largely insensitive to the choice of the initial Bell state as well as to continuous variations of the local coin operator over a broad parameter range, except near the Pauli-$X$ coin. These results demonstrate that maximal genuine multipartite entanglement generation is a robust and generic feature of open-boundary two-walker discrete-time quantum walks, establishing them as promising platforms for engineering multipartite quantum correlations in quantum information processing and quantum simulation.

quant-pharXiv:2608.13338•Aug 14, 2026•0 citations
The staggered quantum walk is a type of discrete-time quantum-walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered dynamics on a two-dimensional lattice composed of superconducting microwave resonators connected with tunable couplings. The naive generalization of the one-dimensional staggered dynamics generates two uncoupled one-dimensional quantum walks; thus more complex partitions need to be employed. However, by analyzing the coherence of the dynamics, we show that the quantumness of the evolution corresponding to two independent one-dimensional quantum walks can be elevated to the level of a single two-dimensional quantum walk, only by modifying the boundary conditions. In fact, by changing the lattice boundary conditions (or topology), we explore the walk on different surfaces such as a torus, a Klein bottle, a real projective plane, and a sphere. The coherence and the entropy reach different levels depending on the topology of the surface. We observe that the entropy captures similar information as coherence; thus we use it to explore the effects of boundaries on the dynamics of the continuous-time quantum walk and the classical random walk.
A discrete-time staggered quantum walk was recently introduced as a generalization that allows the unification of other versions, such as the coined and Szegedy's walk. However, it also produces forms of quantum walks not covered by previous versions. To explore their properties, we study here the staggered walk on a hexagonal lattice. Such a walk is defined using a set of overlapping tessellations that cover the graph edges, and each tessellation is a partition of the node set into cliques. The hexagonal lattice requires at least three tessellations. Each tessellation is associated with a local unitary operator and the product of the local operators defines the evolution operator of the staggered walk on the graph. After defining the evolution operator on the hexagonal lattice, we analyze the quantum walk dynamics with the focus on the position standard deviation and localization. We also obtain analytic results for the time complexity of spatial search algorithms with one marked node using cyclic boundary conditions.
The staggered quantum walk is a model defined by the product of local operators associated with two or more independent graph tessellations. This model is versatile, encompasses several well-known discrete-time quantum walks, and inherits interesting features of the continuous-time quantum walk. We propose an implementation of the staggered quantum walk model with superconducting microwave resonators, where the required local operations are provided by the nearest neighbor interaction of the resonators coupled through superconducting quantum interference devices. The tunability of the interactions makes this system an excellent toolbox for this class of quantum walks. We focus on the one-dimensional case and discuss its generalization to a more general class known as triangle-free graphs.
Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It avails to test the ability of quantum walk models to provide efficient algorithms from the theoretical side and means to implement quantum walks in laboratories from the practical side. In this paper, we rigorously prove that the recent-proposed staggered quantum walk model provides an efficient quantum search on the two-dimensional lattice, if the reflection operators associated with the graph tessellations are used as Hamiltonians, which is an important theoretical result for validating the staggered model with Hamiltonians. Numerical results show that on the two-dimensional lattice staggered models without Hamiltonians are not as efficient as the one described in this paper and are, in fact, as slow as classical random-walk-based algorithms.
In this paper, we present a simulator for two-particle quantum walks on the line and one-particle on a two-dimensional squared lattice. It can be used to investigate the equivalence between the two cases (one- and two-particle walks) for various boundary conditions (open, circular, reflecting, absorbing and their combinations). For the case of a single walker on a two-dimensional lattice, the simulator can also implement the Möbius strip. Furthermore, other topologies for the walker are also simulated by the proposed tool, like certain types of planar graphs with degree up to 4, by considering missing links over the lattice. The main purpose of the simulator is to study the genuinely quantum effects on the global properties of the two-particle joint probability distribution on the entanglement between the walkers/axis. For that purpose, the simulator is designed to compute various quantities such as: the entanglement and classical correlations, (classical and quantum) mutual information, the average distance between the two walkers, different hitting times and quantum discord. These quantities are of vital importance in designing possible algorithmic applications of quantum walks, namely in search, 3-SAT problems, etc. The simulator can also implement the static partial measurements of particle(s) positions and dynamic breaking of the links between certain nodes, both of which can be used to investigate the effects of decoherence on the walker(s). Finally, the simulator can be used to investigate the dynamic Anderson-like particle localization by varying the coin operators of certain nodes on the line/lattice. We also present some illustrative and relevant examples of one- and two-particle quantum walks in various scenarios. The tool was implemented in C and is available on-line at http://qwsim.weebly.com/ .
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.
Discrete-time quantum walks provide a versatile framework for investigating the generation, redistribution, and transport of quantum correlations in composite quantum systems. Here, we study the dynamics of bipartite and genuine multipartite entanglement in a two-walker discrete-time quantum walk on a one-dimensional lattice. By employing logarithmic negativity and the generalized geometric measure (GGM), we systematically characterize the redistribution of bipartite entanglement among different subsystem partitions and the emergence of genuine multipartite entanglement involving the two coin and two position degrees of freedom. We show that the entanglement dynamics are strongly influenced by the lattice topology. The open-boundary regime exhibits a monotonic redistribution of quantum correlations, whereas the closed-boundary regime gives rise to pronounced oscillatory behavior due to boundary-induced interference and recurrent wave-packet overlap. In the open-boundary regime, the GGM rapidly approaches its theoretical maximum value of 1/21/21/2 and remains largely insensitive to the choice of the initial Bell state as well as to continuous variations of the local coin operator over a broad parameter range, except near the Pauli-XXX coin. These results demonstrate that maximal genuine multipartite entanglement generation is a robust and generic feature of open-boundary two-walker discrete-time quantum walks, establishing them as promising platforms for engineering multipartite quantum correlations in quantum information processing and quantum simulation.