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

Scientific Reports

Floquet-engineered quantum walks

Haruna Katayama, Noriyuki Hatakenaka, Toshiyuki Fujii

Published Oct 16, 2020• 6 citations
Publisher

Abstract

The quantum walk is the quantum-mechanical analogue of the classical random walk, which offers an advanced tool for both simulating highly complex quantum systems and building quantum algorithms in a wide range of research areas. One prominent application is in computational models capable of performing any quantum computation, in which precisely controlled state transfer is required. It is, however, generally difficult to control the behavior of quantum walks due to stochastic processes. Here we unveil the walking mechanism based on its particle-wave duality and then present tailoring quantum walks using the walking mechanism (Floquet oscillations) under designed time-dependent coins, to manipulate the desired state on demand, as in universal quantum computation primitives. Our results open the path towards control of quantum walks.

DOI
10.1038/s41598-020-74418-w

Related papers

Theoretical Studies on Quantum Walks with a Time-varying Coin

Haruna Katayama, Noriyuki Hatakenaka, Toshiyuki Fujii

Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically time-varying coin both numerically and analytically, in order to explore the controllability of quantum walks while preserving its random nature.

arXiv:2004.01333•Electronic Proceedings in Theoretical Computer Science•Apr 1, 2020•2 citations

Toward quantum control in discrete-time quantum walks

S. Panahiyan

Discrete-time quantum walks are among the branches of quantum information and computation. They are platforms for developing quantum algorithms for quantum computers. In addition, due to their universal primitive nature, discrete-time quantum walks have been used to simulate other quantum systems and phenomena that are observed in physics and chemistry. To fully utilize the potentials that the discrete-time quantum walks hold in their applications, control over the discrete-time quantum walks and their properties becomes essential. In this dissertation, we propose two models for attaining a high level of control over the discrete-time quantum walks. In the first one, we incorporate a dynamical nature for the unitary operator performing the quantum walks. This enables us to readily control the properties of the walker and produce diverse behaviors for it. We show that with our proposal, the important properties of the discrete-time quantum walks such as variance would indeed improve. To explore the potential of this proposal, we apply it in the simulations of topological phases in condensed matter physics. With our proposal, we can control the simulations and determine the type of topological phenomena that should be simulated. In addition, we confirm simulations of topological phases and boundary states that can be observed in one-, two- and three-dimensional systems. Finally, we report the emergence of exotic phase structures in form of cell-like structures that contain all types of topological phases and boundary states of certain classes. In our second proposal, we take advantage of resources available in quantum mechanics, namely quantum entanglement and entangled qubits. In this proposal, we use entangled qubits in the structure of a quantum walk and show that by tuning the initial entanglement between these qubits and how these qubits are modified through the walk, one is able to produce diverse behaviors for the quantum walk and control its behavior.

•Jan 1, 2021•0 citations

Quantum Walk Computing: Theory, Implementation, and Application

Xiaogang Qiang, Shixin Ma, Haijing Song

The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.

arXiv:2404.04178•Intelligent Computing•Jan 1, 2024•77 citations

Quantum Walk Schemes for Universal Quantum Computation

Michael S. Underwood

Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small `widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction. The many-particle quantum walk can be viewed as a single quantum walk undergoing perfect state transfer on a larger weighted graph, obtained via equitable partitioning. I extend this formalism to non-simple graphs. Examples of the application of equitable partitioning to the analysis of quantum walks and many-particle quantum systems are discussed.

•Jan 1, 2013•0 citations

Floquet engineering of continuous-time quantum walks: Toward the simulation of complex and next-nearest-neighbor couplings

Leonardo Novo, Sofia Ribeiro

The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum algorithms. In experimental settings, however, there is limited control over the coupling coefficients between the different nodes of the graph (which are usually considered to be real valued), thereby restricting the types of quantum walks that can be implemented. In this paper, we apply the idea of Floquet engineering in the context of continuous-time quantum walks, i.e., we define periodically driven Hamiltonians which can be used to simulate the dynamics of certain target continuous-time quantum walks. We focus on two main applications: (i) simulating quantum walks that break time-reversal symmetry due to complex coupling coefficients and (ii) increasing the connectivity of the graph by simulating the presence of next-nearest-neighbor couplings. Our paper provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks, or investigating quantum dynamics in highly connected structures.

arXiv:2012.00448•Physical Review A•Apr 26, 2021•10 citations

Implementation of quantum random walk on a real quantum computer

Warat Puengtambol, Prapong Prechaprapranwong, Unchalisa Taetragool

Abstract A random walk is one of the widely adopted random processes for simulation and approximation in multiple areas of science and engineering. Quantum random walk is an analog version of the classical random walk. It was first introduced in 1993 by Y. Aharonov et al. They presented that, with the nature of quantum characteristic, the average length of the walking path on a line is possible to larger than a classical random walk can produce. Therefore, the quantum random walk can be used as a tool to construct many other quantum algorithms. Moreover, it can solve graph problems that many real-world problems can be formulated. However, quantum algorithms are only useful in practice if we can implement them efficiently on a quantum computer. In this study, we are then interested in designing and implementing a quantum circuit that can be run on a real quantum computing device. We firstly focus on the most straightforward, which is a one-dimension, quantum random walk algorithm. Then, the quantum circuits are developed and implemented on a real quantum computer and a quantum computing simulator using software development kits provided by IBM. Lastly, the performance and results of the quantum circuits tested on both computing platforms are presented.

Journal of Physics Conference Series•Jan 1, 2021•11 citations
The quantum walk is the quantum-mechanical analogue of the classical random walk, which offers an advanced tool for both simulating highly complex quantum systems and building quantum algorithms in a wide range of research areas. One prominent application is in computational models capable of performing any quantum computation, in which precisely controlled state transfer is required. It is, however, generally difficult to control the behavior of quantum walks due to stochastic processes. Here we unveil the walking mechanism based on its particle-wave duality and then present tailoring quantum walks using the walking mechanism (Floquet oscillations) under designed time-dependent coins, to manipulate the desired state on demand, as in universal quantum computation primitives. Our results open the path towards control of quantum walks.
Discrete-time quantum walks are among the branches of quantum information and computation. They are platforms for developing quantum algorithms for quantum computers. In addition, due to their universal primitive nature, discrete-time quantum walks have been used to simulate other quantum systems and phenomena that are observed in physics and chemistry. To fully utilize the potentials that the discrete-time quantum walks hold in their applications, control over the discrete-time quantum walks and their properties becomes essential. In this dissertation, we propose two models for attaining a high level of control over the discrete-time quantum walks. In the first one, we incorporate a dynamical nature for the unitary operator performing the quantum walks. This enables us to readily control the properties of the walker and produce diverse behaviors for it. We show that with our proposal, the important properties of the discrete-time quantum walks such as variance would indeed improve. To explore the potential of this proposal, we apply it in the simulations of topological phases in condensed matter physics. With our proposal, we can control the simulations and determine the type of topological phenomena that should be simulated. In addition, we confirm simulations of topological phases and boundary states that can be observed in one-, two- and three-dimensional systems. Finally, we report the emergence of exotic phase structures in form of cell-like structures that contain all types of topological phases and boundary states of certain classes. In our second proposal, we take advantage of resources available in quantum mechanics, namely quantum entanglement and entangled qubits. In this proposal, we use entangled qubits in the structure of a quantum walk and show that by tuning the initial entanglement between these qubits and how these qubits are modified through the walk, one is able to produce diverse behaviors for the quantum walk and control its behavior.
The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.
Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small `widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction. The many-particle quantum walk can be viewed as a single quantum walk undergoing perfect state transfer on a larger weighted graph, obtained via equitable partitioning. I extend this formalism to non-simple graphs. Examples of the application of equitable partitioning to the analysis of quantum walks and many-particle quantum systems are discussed.
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum algorithms. In experimental settings, however, there is limited control over the coupling coefficients between the different nodes of the graph (which are usually considered to be real valued), thereby restricting the types of quantum walks that can be implemented. In this paper, we apply the idea of Floquet engineering in the context of continuous-time quantum walks, i.e., we define periodically driven Hamiltonians which can be used to simulate the dynamics of certain target continuous-time quantum walks. We focus on two main applications: (i) simulating quantum walks that break time-reversal symmetry due to complex coupling coefficients and (ii) increasing the connectivity of the graph by simulating the presence of next-nearest-neighbor couplings. Our paper provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks, or investigating quantum dynamics in highly connected structures.
Abstract A random walk is one of the widely adopted random processes for simulation and approximation in multiple areas of science and engineering. Quantum random walk is an analog version of the classical random walk. It was first introduced in 1993 by Y. Aharonov et al. They presented that, with the nature of quantum characteristic, the average length of the walking path on a line is possible to larger than a classical random walk can produce. Therefore, the quantum random walk can be used as a tool to construct many other quantum algorithms. Moreover, it can solve graph problems that many real-world problems can be formulated. However, quantum algorithms are only useful in practice if we can implement them efficiently on a quantum computer. In this study, we are then interested in designing and implementing a quantum circuit that can be run on a real quantum computing device. We firstly focus on the most straightforward, which is a one-dimension, quantum random walk algorithm. Then, the quantum circuits are developed and implemented on a real quantum computer and a quantum computing simulator using software development kits provided by IBM. Lastly, the performance and results of the quantum circuits tested on both computing platforms are presented.