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:1609.09844 · Physical review. B./Physical review. B

Staggered quantum walks with superconducting microwave resonators

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

Published Apr 5, 2017• 16 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevb.95.144506

Related papers

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

Jalil Khatibi Moqadam, A. T. Rezakhani

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.

arXiv:1804.04331•Physical Review A•Jul 18, 2018•5 citations

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

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

The Staggered Quantum Walk Model

Renato Portugal, Raqueline A. M. Santos, T. D. Fern +1 more

There are at least three models of discrete-time quantum walks (QWs) on graphs currently under active development. In this work we focus on the equivalence of two of them, known as Szegedy’s and staggered QWs. We give a formal definition of the staggered model and discuss generalized versions for searching marked vertices. Using this formal definition, we prove that any instance of Szegedy’s model is equivalent to an instance of the staggered model. On the other hand, we show that there are instances of the staggered model that cannot be cast into Szegedy’s framework. Our analysis also works when there are marked vertices. We show that Szegedy’s spatial search algorithms can be converted into search algorithms in staggered QWs. We take advantage of the similarity of those models to define the quantum hitting time in the staggered model and to describe a method to calculate the eigenvalues and eigenvectors of the evolution operator of staggered QWs. 1

•Jan 1, 2015•59 citations

Staggered quantum walk on a line of diamonds

Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal

The staggered model is a discrete-time quantum walk model, whose evolution operator is obtained from a set of graph tessellations. We use this model to analyze the standard deviation of the probability distribution on a line of diamonds. The results help to understand the dynamics of quantum walks and it can be used as tools for building quantum algorithms.

Proceeding Series of the Brazilian Society of Computational and Applied Mathematics•Dec 19, 2018•0 citations

Discrete-Time Quantum Walks on Oriented Graphs

Bruno Chagas, Renato Portugal

The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define discrete-time quantum walks on arbitrary oriented graphs by partitioning a graph into tessellations, which is a collection of disjoint cliques that cover the vertex set. By using the adjacency matrices associated with the tessellations, we define local unitary operators, whose product is the evolution operator of our quantum walk model. We introduce a parameter, called alpha, that quantifies the amount of orientation. We show that the parameter alpha can be tuned in order to increase the amount of quantum walk-based transport on oriented graphs.

arXiv:2001.04814•Electronic Proceedings in Theoretical Computer Science•Apr 1, 2020•4 citations
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.
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.
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.
There are at least three models of discrete-time quantum walks (QWs) on graphs currently under active development. In this work we focus on the equivalence of two of them, known as Szegedy’s and staggered QWs. We give a formal definition of the staggered model and discuss generalized versions for searching marked vertices. Using this formal definition, we prove that any instance of Szegedy’s model is equivalent to an instance of the staggered model. On the other hand, we show that there are instances of the staggered model that cannot be cast into Szegedy’s framework. Our analysis also works when there are marked vertices. We show that Szegedy’s spatial search algorithms can be converted into search algorithms in staggered QWs. We take advantage of the similarity of those models to define the quantum hitting time in the staggered model and to describe a method to calculate the eigenvalues and eigenvectors of the evolution operator of staggered QWs. 1
The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define discrete-time quantum walks on arbitrary oriented graphs by partitioning a graph into tessellations, which is a collection of disjoint cliques that cover the vertex set. By using the adjacency matrices associated with the tessellations, we define local unitary operators, whose product is the evolution operator of our quantum walk model. We introduce a parameter, called alpha, that quantifies the amount of orientation. We show that the parameter alpha can be tuned in order to increase the amount of quantum walk-based transport on oriented graphs.