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:1408.6647 · Physical Review Letters

Driven Quantum Walks

Craig S. Hamilton, Regina Kruse, Linda Sansoni, Christine Silberhorn, Igor Jex

Published Aug 21, 2014• 34 citations
arXivHTMLPDF

Abstract

We introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down-conversion, leading to fundamentally different phenomena. We compare these striking differences by relating the driven quantum walks to the original quantum walk. Next, we illustrate typical dynamics of such systems and show that these walks can be controlled by various pump configurations and phase matchings. Finally, we end by proposing an application of this process based on a quantum search algorithm that performs faster than a classical search.

DOI
10.1103/physrevlett.113.083602

Related papers

Driven discrete time quantum walks

Craig S. Hamilton, Sonja Barkhofen, Linda Sansoni +2 more

We introduce the driven discrete time quantum walk (QW), where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original QW. These dynamics have two regimes, which we illustrate using the one-dimensional line. Then, we explore a search application which has certain advantages over current search protocols, namely that it does not require a complicated initial state nor a specific measurement time to observe the marked state. Finally, we describe a potential experimental implementation using existing technology.

arXiv:1606.08996•New Journal of Physics•Jul 6, 2016•14 citations

Driven Gaussian quantum walks

Philip Held, Melanie Engelkemeier, Syamsundar De +3 more

Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian quantum walk is introduced. In contrast to typically considered quantum walks in optical settings, we describe the operation of the walk in terms of a nonlinear map rather than a unitary operation, e.g., by replacing a beam-splitter-type coin with a two-mode squeezer, being a process that is controlled and driven by a pump field. This opens previously unattainable possibilities for quantum walks that include nonlinear elements as core components of their operation, vastly extending their range of applications. A full framework for driven Gaussian quantum walks is developed, including methods to dynamically characterize nonlinear, quantum, and quantum-nonlinear effects. Moreover, driven Gaussian quantum walks are compared with their classically interfering and linear counterparts, which are based on classical coherence of light rather than quantum superpositions. In particular, the generation and boost of highly multimode entanglement, squeezing, and other quantum effects are studied over the duration of the nonlinear walk. Importantly, we prove the quantumness of the evolution itself, regardless of the input state. A scheme for an experimental realization is proposed. Furthermore, nonlinear properties of driven Gaussian quantum walks are explored, such as amplification that leads to an ever increasing number of correlated quantum particles, constituting a source of new walkers during the walk. Therefore, a concept for quantum walks is proposed that leads to---and even produces---directly accessible quantum phenomena, and that renders the quantum simulation of nonlinear processes possible.

arXiv:2112.08981•Physical Review A•Apr 19, 2022•8 citations

Where to quantum walk

Viv M. Kendon

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always employed the quantum walk in the form of a program running on a quantum computer. Recent results showing that quantum walks are "universal for quantum computation" relate entirely to algorithms, and do not imply that a physical quantum walk could provide a new architecture for quantum computers. Nonetheless, quantum walks used to model transport phenomena in spin chains and biomolecules broaden their scope well beyond algorithms, and reopen the question of when a physical implementation might provide useful computational outputs. In this article we determine the conditions under which a physical quantum walk experiment could provide useful results beyond the reach of classical computation.

arXiv:1107.3795•Jul 19, 2011•13 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 Walks via Quantum Cellular Automata for Simulating Quantum Computation

Tanish Singh

The quantum walk is a subset of classical random walks.Considerable research has lately been conducted on quantum walks in relation to quantum computing.The walk may be thought of as a type of quantum cellular automata.In a broader sense, there is a one-to-one link between them.Furthermore, we look at another type of quantum cellular automata that may be thought of as a quantum version of stochastic cellular automata.The quantum walk formalism is a widely used and quite practical paradigm for modelling quantum systems such as Dirac equation simulations, discrete dynamics in both the low and high energy regimes, and the development of a multitude of quantum algorithms.The walker in a QW moves in a quantum superposition of pathways, and the ensuing interference serves as the foundation for a broad range of quantum algorithms, including quantum search, graph isomorphism issues, and rating nodes in a network.To generate a block representation of n-dimensional quantum cellular automata, we apply the following general result to them.As a result, we have demonstrated that their generic, axiomatic formulation nevertheless produces a unifying, operational representation of them.Some non-trivial ramifications are investigated, such as the fact that bijective non-reversible CA are not physical as closed systems, or that quantum information can move faster than classical informationwithin some specified dynamics.Finally, we present n-dimensional quantum cellular automata that can simulate anything else.This means that the initial configuration and local transition rule of any one-dimensional QCA may be stored within the universal QCA's initial configuration.The simulated QCA will then correspond to many phases of the universal QCA.In the sense that each cell in the simulated QCA is represented as a group of nearby cells in the universal QCA, the simulation preserves the topology.Because the encoding is linear, it bears no cost of the calculation.

IARJSET•Nov 30, 2021•0 citations

Quantum random walks: An introductory overview

Julia Kempe

This article aims to provide an introductory survey on quantum random walks.Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks.We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context.We will mention recent developments in this new area and outline some open questions. God does not play dice.

arXiv:quant-ph/0303081•Contemporary Physics•Jul 1, 2003•1,670 citations
We introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down-conversion, leading to fundamentally different phenomena. We compare these striking differences by relating the driven quantum walks to the original quantum walk. Next, we illustrate typical dynamics of such systems and show that these walks can be controlled by various pump configurations and phase matchings. Finally, we end by proposing an application of this process based on a quantum search algorithm that performs faster than a classical search.
We introduce the driven discrete time quantum walk (QW), where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original QW. These dynamics have two regimes, which we illustrate using the one-dimensional line. Then, we explore a search application which has certain advantages over current search protocols, namely that it does not require a complicated initial state nor a specific measurement time to observe the marked state. Finally, we describe a potential experimental implementation using existing technology.
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian quantum walk is introduced. In contrast to typically considered quantum walks in optical settings, we describe the operation of the walk in terms of a nonlinear map rather than a unitary operation, e.g., by replacing a beam-splitter-type coin with a two-mode squeezer, being a process that is controlled and driven by a pump field. This opens previously unattainable possibilities for quantum walks that include nonlinear elements as core components of their operation, vastly extending their range of applications. A full framework for driven Gaussian quantum walks is developed, including methods to dynamically characterize nonlinear, quantum, and quantum-nonlinear effects. Moreover, driven Gaussian quantum walks are compared with their classically interfering and linear counterparts, which are based on classical coherence of light rather than quantum superpositions. In particular, the generation and boost of highly multimode entanglement, squeezing, and other quantum effects are studied over the duration of the nonlinear walk. Importantly, we prove the quantumness of the evolution itself, regardless of the input state. A scheme for an experimental realization is proposed. Furthermore, nonlinear properties of driven Gaussian quantum walks are explored, such as amplification that leads to an ever increasing number of correlated quantum particles, constituting a source of new walkers during the walk. Therefore, a concept for quantum walks is proposed that leads to---and even produces---directly accessible quantum phenomena, and that renders the quantum simulation of nonlinear processes possible.
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always employed the quantum walk in the form of a program running on a quantum computer. Recent results showing that quantum walks are "universal for quantum computation" relate entirely to algorithms, and do not imply that a physical quantum walk could provide a new architecture for quantum computers. Nonetheless, quantum walks used to model transport phenomena in spin chains and biomolecules broaden their scope well beyond algorithms, and reopen the question of when a physical implementation might provide useful computational outputs. In this article we determine the conditions under which a physical quantum walk experiment could provide useful results beyond the reach of classical computation.
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 quantum walk is a subset of classical random walks.Considerable research has lately been conducted on quantum walks in relation to quantum computing.The walk may be thought of as a type of quantum cellular automata.In a broader sense, there is a one-to-one link between them.Furthermore, we look at another type of quantum cellular automata that may be thought of as a quantum version of stochastic cellular automata.The quantum walk formalism is a widely used and quite practical paradigm for modelling quantum systems such as Dirac equation simulations, discrete dynamics in both the low and high energy regimes, and the development of a multitude of quantum algorithms.The walker in a QW moves in a quantum superposition of pathways, and the ensuing interference serves as the foundation for a broad range of quantum algorithms, including quantum search, graph isomorphism issues, and rating nodes in a network.To generate a block representation of n-dimensional quantum cellular automata, we apply the following general result to them.As a result, we have demonstrated that their generic, axiomatic formulation nevertheless produces a unifying, operational representation of them.Some non-trivial ramifications are investigated, such as the fact that bijective non-reversible CA are not physical as closed systems, or that quantum information can move faster than classical informationwithin some specified dynamics.Finally, we present n-dimensional quantum cellular automata that can simulate anything else.This means that the initial configuration and local transition rule of any one-dimensional QCA may be stored within the universal QCA's initial configuration.The simulated QCA will then correspond to many phases of the universal QCA.In the sense that each cell in the simulated QCA is represented as a group of nearby cells in the universal QCA, the simulation preserves the topology.Because the encoding is linear, it bears no cost of the calculation.
This article aims to provide an introductory survey on quantum random walks.Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks.We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context.We will mention recent developments in this new area and outline some open questions. God does not play dice.