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

One-dimensional Hadamard Quantum Walk on a Cycle with Rotational Implementation

Κωνσταντίνος Γεωργόπουλος, Paolo Zuliani

Published Nov 1, 2019• 3 citations
OpenAlex

Abstract

Quantum walks have been extensively studied recently, mainly due to their vast difference in behavior to classical random walks. This paper is concerned with discrete time and space quantum walks of particles that propagate through a one-dimensional line. This line can be either a lattice or a graph or any other form of mathematical structure that can be viewed as a one-dimensional line. First is defined a concrete way to describe the unitary evolution of a quantum walk through a balanced coin operator and a shift operator. Then follows the implementation of the quantum walk on an $8$-cycle, i.e a cycle graph with $8$ nodes, which is then run locally as a simulation and on IBM's quantum computer. The paper explores two implementations of the quantum walk as a quantum circuit: the first one consists of generalised controlled inversions, as introduced in \cite{EffWalk}, whereas the second one tries to replace them with rotation operators around the basis states. The main aim is to find a way around the caveat resulting from the large amount of ancilla qubits required to carry out the computation in the case where only generalised inverters are used. Next, another three experiments are computed, involving cycles with a larger state space, more specifically $16$, $32$ and $64$ possible positions. In order to measure the magnitude of the error of the circuit we use the cross entropy benchmarking method, calculated through the Hellinger distance. Finally, a derivation of the variance of the quantum walk is provided along with a calculation of the variance for our experiment.

Related papers

Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers

K Georgopoulos, C Emary, P Zuliani

This paper explores two circuit approaches for quantum walks: The first consists of generalized controlled inversions, whereas the second one effectively replaces them with rotation operations around the basis states. We show the theoretical foundation of the rotational implementation. The rotational approach nullifies the large amount of ancilla qubits required to carry out the computation when using the inverter implementation. Our results concentrate around the comparison of the two architectures in terms of structure, benefits, and detriments, as well as the computational resources needed for each approach. We show that the inverter approach requires exponentially fewer gates than the rotations but almost half the number of qubits in the system. Finally, we execute a number of experiments using an IBM quantum computer. The experiments show the effects of noise in our circuits. Small two-qubit quantum walks evolve closer to our expectations, whereas for a larger number of steps or state space the evolution is severely affected by noise.

•Feb 8, 2021•0 citations

Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers

Κωνσταντίνος Γεωργόπουλος, Clive Emary, Paolo Zuliani

This paper explores two circuit approaches for quantum walks: The first consists of generalized controlled inversions, whereas the second one effectively replaces them with rotation operations around the basis states. We show the theoretical foundation of the rotational implementation. The rotational approach nullifies the large amount of ancilla qubits required to carry out the computation when using the inverter implementation. Our results concentrate around the comparison of the two architectures in terms of structure, benefits, and detriments, as well as the computational resources needed for each approach. We show that the inverter approach requires exponentially fewer gates than the rotations but almost half the number of qubits in the system. Finally, we execute a number of experiments using an IBM quantum computer. The experiments show the effects of noise in our circuits. Small two-qubit quantum walks evolve closer to our expectations, whereas for a larger number of steps or state space the evolution is severely affected by noise.

arXiv:1911.00305•Physical Review A•Feb 8, 2021•27 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

Quantum Walks on the Line with Phase Parameters

Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita +1 more

In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.

arXiv:1109.1866•IEICE Transactions on Information and Systems•Jan 1, 2012•4 citations

Unveiling hidden topological phases of a one-dimensional Hadamard quantum walk

Hideaki Obuse, János K. Asbóth, Yuki Nishimura +1 more

Quantum walks, whose dynamics is prescribed by alternating unitary coin and shift operators, possess topological phases akin to those of Floquet topological insulators, driven by a time-periodic field. While there is ample theoretical work on topological phases of quantum walks where the coin operators are spin rotations, in experiments a different coin, the Hadamard operator, is often used instead. This was the case in a recent photonic quantum walk experiment, where protected edge states were observed between two bulks whose topological invariants, as calculated by the standard theory, were the same. This hints at a hidden topological invariant in the Hadamard quantum walk. We establish a relation between the Hadamard and the spin rotation operator, which allows us to apply the recently developed theory of topological phases of quantum walks to the one-dimensional Hadamard quantum walk. The topological invariants we derive account for the edge state observed in the experiment; we thus reveal the hidden topological invariant of the one-dimensional Hadamard quantum walk.

arXiv:1505.03264•Physical Review B•Jul 23, 2015•81 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
Quantum walks have been extensively studied recently, mainly due to their
vast difference in behavior to classical random walks. This paper is concerned
with discrete time and space quantum walks of particles that propagate through
a one-dimensional line. This line can be either a lattice or a graph or any
other form of mathematical structure that can be viewed as a one-dimensional
line. First is defined a concrete way to describe the unitary evolution of a
quantum walk through a balanced coin operator and a shift operator. Then
follows the implementation of the quantum walk on an 888-cycle, i.e a cycle
graph with 888 nodes, which is then run locally as a simulation and on IBM's
quantum computer. The paper explores two implementations of the quantum walk as
a quantum circuit: the first one consists of generalised controlled inversions,
as introduced in \cite{EffWalk}, whereas the second one tries to replace them
with rotation operators around the basis states. The main aim is to find a way
around the caveat resulting from the large amount of ancilla qubits required to
carry out the computation in the case where only generalised inverters are
used. Next, another three experiments are computed, involving cycles with a
larger state space, more specifically 161616, 323232 and 646464 possible positions.
In order to measure the magnitude of the error of the circuit we use the cross
entropy benchmarking method, calculated through the Hellinger distance.
Finally, a derivation of the variance of the quantum walk is provided along
with a calculation of the variance for our experiment.
This paper explores two circuit approaches for quantum walks: The first consists of generalized controlled inversions, whereas the second one effectively replaces them with rotation operations around the basis states. We show the theoretical foundation of the rotational implementation. The rotational approach nullifies the large amount of ancilla qubits required to carry out the computation when using the inverter implementation. Our results concentrate around the comparison of the two architectures in terms of structure, benefits, and detriments, as well as the computational resources needed for each approach. We show that the inverter approach requires exponentially fewer gates than the rotations but almost half the number of qubits in the system. Finally, we execute a number of experiments using an IBM quantum computer. The experiments show the effects of noise in our circuits. Small two-qubit quantum walks evolve closer to our expectations, whereas for a larger number of steps or state space the evolution is severely affected by noise.
This paper explores two circuit approaches for quantum walks: The first consists of generalized controlled inversions, whereas the second one effectively replaces them with rotation operations around the basis states. We show the theoretical foundation of the rotational implementation. The rotational approach nullifies the large amount of ancilla qubits required to carry out the computation when using the inverter implementation. Our results concentrate around the comparison of the two architectures in terms of structure, benefits, and detriments, as well as the computational resources needed for each approach. We show that the inverter approach requires exponentially fewer gates than the rotations but almost half the number of qubits in the system. Finally, we execute a number of experiments using an IBM quantum computer. The experiments show the effects of noise in our circuits. Small two-qubit quantum walks evolve closer to our expectations, whereas for a larger number of steps or state space the evolution is severely affected by noise.
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.
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.
Quantum walks, whose dynamics is prescribed by alternating unitary coin and shift operators, possess topological phases akin to those of Floquet topological insulators, driven by a time-periodic field. While there is ample theoretical work on topological phases of quantum walks where the coin operators are spin rotations, in experiments a different coin, the Hadamard operator, is often used instead. This was the case in a recent photonic quantum walk experiment, where protected edge states were observed between two bulks whose topological invariants, as calculated by the standard theory, were the same. This hints at a hidden topological invariant in the Hadamard quantum walk. We establish a relation between the Hadamard and the spin rotation operator, which allows us to apply the recently developed theory of topological phases of quantum walks to the one-dimensional Hadamard quantum walk. The topological invariants we derive account for the edge state observed in the experiment; we thus reveal the hidden topological invariant of the one-dimensional Hadamard quantum walk.
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/ .