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

Spreading and transport properties of quantum walks

İ. Yalçınkaya

Published Aug 1, 2016• 0 citations
OpenAlex

Abstract

Quantum computing aims to harness and exploit the quantum mechanical phenomena such as superposition, entanglement and contextuality in order to encode and process information. In this context, quantum walks, which has been suggested as the quantum counterpart of classical random walks, is an emerging topic in quantum computing that provides powerful techniques for developing new quantum algorithms, quantum simulation and quantum state transfer. This thesis intends to investigate the properties of quantum walks which may potentially promote further work in such techniques in quantum computation. We first propose a novel method for transferring arbitrary unknown qubit state between two points in space with quantum walk architecture. We determine the cases providing perfect state transfers over both finite and infinite lattices with different boundary conditions and we introduce recovery operators assisting the transfer process. Next, by modeling the incoherent and coherent transport with classical random walks and quantum walks, respectively, we calculate the transport efficiencies over an explosive percolation lattice. We show that the minimal correlation between discrete clusters leads to maximal localizations which originating from random scatterings. These localization effects, however, are rather small when compared to the supportive effect of the abrupt growth of the largest cluster on transport efficiency, which eventually allows us to obtain more efficient transports in case of minimal correlations. We support our results with further calculations on whether the eigenstates of the systems we study are localized or not. Lastly, we turn our attention to the spreading dynamics and the coin-position entanglement for two-dimensional quantum walks under an artificial magnetic fields by introducing Peierls phases to the system. In particular, we show that the spreading of the quantum walk is diffusive rather than ballistic when the ratio of the magnetic flux through unit cell - where the walk takes place - to the flux quantum is an irrational number. On the contrary, the walk recovers its original ballistic behavior when this ratio is chosen to be a rational number. Furthermore, we demonstrate that coin-position entanglement is nearly maximum under an artificial magnetic field, even for large number of steps.

Related papers

Quantum walks and quantum computation

Katherine Elizabeth Barr

The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. \nIn this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discrete time walk is particularly amenable to investigation using numerical methods, from which most of the results in this thesis are derived, and is the main focus of the work presented. Two aspects of the discrete time walk are investigated: their transport properties \nand their interpretation as quantum computers. I investigated the transport properties in two ways, by looking for a particular type of transport known as perfect \nstate transfer, and examining the transport properties of a new type of coin operator. \nThe search for perfect state transfer concentrated on modifications of small cycles. I found that perfect state transfer is rare for the choices of coin operators \ntested. The structures tested for perfect state transfer were based on cycles, and it appears that the type of modification has more of an effect than the size of the \ncycle. This makes intuitive sense, as the modifications found to lead to walks exhibiting perfect state transfer affected only the initial and target node of the cycle. \nI then investigated a new type of coin operator which does not allow amplitude to return to the node it has come from. This effectively simulates a dimer. Using the general form of this type of operator and random variables for each parameter, I found that the expected distance of the walker from the origin, and standard deviation, were independent of the initial condition. The second half of the thesis concentrates on computational applications of quantum \nwalks using the language acceptance model. I first note their equivalence to a type of quantum automaton known as the QFA-WOM, and this provides an intuitive understanding of the role of the WOM. I then use a more direct construction to show that they can accept a range of formal languages. Using this construction allows us to use superpositions of words as inputs, and the insights provided by investigating these suggest a new way of approaching the problem of quantum state discrimination.

•May 1, 2013•0 citations

Coined quantum walks on percolation graphs

Godfrey Leung, Paul Knott, Joe Bailey +1 more

Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line), we introduce a simple notion of quantum tunnelling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero as the percolation probability decreases towards the critical point. This provides an example of fractional scaling in quantum-walk dynamics.

arXiv:1006.1283•New Journal of Physics•Dec 9, 2010•52 citations

Properties of distribution and entanglement in discrete-time quantum walk with percolation

An Zhiyun, Zhi-Jian Li

We investigate one-dimensional discrete-time quantum walk on the line where the links between neighboring sites are randomly broken. Two link-broken ways, static percolation and dynamical percolation, are considered. The former means that the broken links are fixed in position space at each time step, while the latter is that broken links are varied with time step. Our attention focuses on the effects of these disorders on two physical quantities, the probability distribution and the entanglement between the coin degree of freedom and position degree of freedom. Choosing Hadamard coin operator and assuming the walker to start from the position eigenstate|0〉and attach itself to a coherent coin state 1/√2 (|↑〉+ i|↓〉), we give the statistical average results after making numerical calculations many times. The choices of coin operator and initial state, resulting in a symmetric probability distribution about origin in the ideal case, is helpful in comparing with different cases in different disorder strengths. It is shown that the probability distribution of static percolation quantum walk can change from a coherent behavior at short time to Anderson localization at longer time, while the dynamical percolation quantum walk can change to a classical diffusive behavior. With the decrease of the percolation probability, these transitions become faster. The entanglement for ideal case without disorder reaches a constant value after a short time evolution. The static percolation makes the entanglement less than that of ideal case and fluctuate irregularly around a certain value. The situation is very different for the dynamical percolation:the entanglement increases smoothly with the time step and can exceed the constant value in the ideal case at some time. Both of entanglements for two types of percolations decrease with reducing percolation probability. As a striking characteristic, the entanglement in dynamical case can tend to maximum regardless of percolation probability in long time limit, while the static case cannot. In the model for our study, the randomized unitary operations, induced by the static and dynamical percolations, can lead to some noticeable effects on the transport and entanglement of discrete time quantum walk. The results about the interplay between disorder and entanglement not only assist quantum information processing, but also give more options to further explore and understand disorder physical processes in nature.

Acta Physica Sinica•Jan 1, 2017•0 citations

Quantum Walks in Time

Andreas Schreiber

Quantum walks are the quantum mechanical analog to classical random walks. However, due to the wavelike nature of quantum particles, they reveal drastically different dynamics compared to their classical counterpart. These unique properties make quantum walks a new promising platform for quantum algorithms and a powerful tool to understand complex transport phenomena. This thesis presents three experiments specifically designed to send photons on a quantum walk. The experiments are based on a fiber network spreading the photonic wave packets over discrete time bins. With these Quantum Walks in Time we simulate the propagation of quantum particles in various different environments, revealing diverse dynamics such as a fast ballistic spread and an Anderson-like localization effect. Furthermore we use our concept to implement the first quantum walk on a two-dimensional lattice. The underlying topology allows for investigations of the intriguing dynamics of two strongly interacting quantum particles, which reveals unique effects such as the creation of bound states.

•Jan 1, 2014•2 citations

Quantum walks on random lattices: Diffusion, localization, and the absence of parametric quantum speedup

Rostislav Duda, Moein N. Ivaki, Isac Sahlberg +2 more

Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms, and quantum simulation of condensed-matter systems. The key property of quantum walks, which lies at the heart of their quantum information applications, is the possibility for a parametric quantum speedup in propagation compared to classical random walks. In this work we study propagation of quantum walks on percolation-generated two-dimensional random lattices. In large-scale simulations of topological and trivial split-step walks, we identify distinct prediffusive and diffusive behaviors at different timescales. Importantly, we show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speedup, reducing the motion to ordinary diffusion. By increasing the randomness, quantum walks eventually stop spreading due to Anderson localization. Near the localization threshold, we find that the quantum walks become subdiffusive. The fragility of quantum speedup implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.

arXiv:2210.05310•Physical Review Research•Jun 5, 2023•13 citations

Fractional scaling of quantum walks on percolation lattices

Viv M. Kendon, Godfrey Leung, Joe Bailey +1 more

Quantum walks can be used to model processes such as transport in spin chains and bio-molecules. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well-studied on regular structures and also shown to be sensitive to defects and imperfections. Using numerical simulation, we study the spreading properties of quantum walks on percolation lattices for both bond and site percolation. The randomly missing edges or sites provide a controlled amount of disorder in the regular Cartesian lattice. In one dimension (the line) we introduce a simple model of quantum tunneling to allow the walk to proceed past the missing edges or sites. This allows the quantum walk to spread faster than a classical random walk for short times, but at longer times the disorder localises the quantum walk. In two dimensions, we observe fractional scaling of the spreading with the number of steps of the walk. For percolation above the 85% level, we obtain faster spreading than classical random walks on the full lattice.

Journal of Physics Conference Series•Mar 1, 2011•2 citations
Quantum computing aims to harness and exploit the quantum mechanical phenomena such as superposition, entanglement and contextuality in order to encode and process information. In this context, quantum walks, which has been suggested as the quantum counterpart of classical random walks, is an emerging topic in quantum computing that provides powerful techniques for developing new quantum algorithms, quantum simulation and quantum state transfer. This thesis intends to investigate the properties of quantum walks which may potentially promote further work in such techniques in quantum computation. We first propose a novel method for transferring arbitrary unknown qubit state between two points in space with quantum walk architecture. We determine the cases providing perfect state transfers over both finite and infinite lattices with different boundary conditions and we introduce recovery operators assisting the transfer process. Next, by modeling the incoherent and coherent transport with classical random walks and quantum walks, respectively, we calculate the transport efficiencies over an explosive percolation lattice. We show that the minimal correlation between discrete clusters leads to maximal localizations which originating from random scatterings. These localization effects, however, are rather small when compared to the supportive effect of the abrupt growth of the largest cluster on transport efficiency, which eventually allows us to obtain more efficient transports in case of minimal correlations. We support our results with further calculations on whether the eigenstates of the systems we study are localized or not. Lastly, we turn our attention to the spreading dynamics and the coin-position entanglement for two-dimensional quantum walks under an artificial magnetic fields by introducing Peierls phases to the system. In particular, we show that the spreading of the quantum walk is diffusive rather than ballistic when the ratio of the magnetic flux through unit cell - where the walk takes place - to the flux quantum is an irrational number. On the contrary, the walk recovers its original ballistic behavior when this ratio is chosen to be a rational number. Furthermore, we demonstrate that coin-position entanglement is nearly maximum under an artificial magnetic field, even for large number of steps.
The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. \nIn this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discrete time walk is particularly amenable to investigation using numerical methods, from which most of the results in this thesis are derived, and is the main focus of the work presented. Two aspects of the discrete time walk are investigated: their transport properties \nand their interpretation as quantum computers. I investigated the transport properties in two ways, by looking for a particular type of transport known as perfect \nstate transfer, and examining the transport properties of a new type of coin operator. \nThe search for perfect state transfer concentrated on modifications of small cycles. I found that perfect state transfer is rare for the choices of coin operators \ntested. The structures tested for perfect state transfer were based on cycles, and it appears that the type of modification has more of an effect than the size of the \ncycle. This makes intuitive sense, as the modifications found to lead to walks exhibiting perfect state transfer affected only the initial and target node of the cycle. \nI then investigated a new type of coin operator which does not allow amplitude to return to the node it has come from. This effectively simulates a dimer. Using the general form of this type of operator and random variables for each parameter, I found that the expected distance of the walker from the origin, and standard deviation, were independent of the initial condition. The second half of the thesis concentrates on computational applications of quantum \nwalks using the language acceptance model. I first note their equivalence to a type of quantum automaton known as the QFA-WOM, and this provides an intuitive understanding of the role of the WOM. I then use a more direct construction to show that they can accept a range of formal languages. Using this construction allows us to use superpositions of words as inputs, and the insights provided by investigating these suggest a new way of approaching the problem of quantum state discrimination.
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line), we introduce a simple notion of quantum tunnelling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero as the percolation probability decreases towards the critical point. This provides an example of fractional scaling in quantum-walk dynamics.
We investigate one-dimensional discrete-time quantum walk on the line where the links between neighboring sites are randomly broken. Two link-broken ways, static percolation and dynamical percolation, are considered. The former means that the broken links are fixed in position space at each time step, while the latter is that broken links are varied with time step. Our attention focuses on the effects of these disorders on two physical quantities, the probability distribution and the entanglement between the coin degree of freedom and position degree of freedom. Choosing Hadamard coin operator and assuming the walker to start from the position eigenstate|0〉and attach itself to a coherent coin state 1/√2 (|↑〉+ i|↓〉), we give the statistical average results after making numerical calculations many times. The choices of coin operator and initial state, resulting in a symmetric probability distribution about origin in the ideal case, is helpful in comparing with different cases in different disorder strengths. It is shown that the probability distribution of static percolation quantum walk can change from a coherent behavior at short time to Anderson localization at longer time, while the dynamical percolation quantum walk can change to a classical diffusive behavior. With the decrease of the percolation probability, these transitions become faster. The entanglement for ideal case without disorder reaches a constant value after a short time evolution. The static percolation makes the entanglement less than that of ideal case and fluctuate irregularly around a certain value. The situation is very different for the dynamical percolation:the entanglement increases smoothly with the time step and can exceed the constant value in the ideal case at some time. Both of entanglements for two types of percolations decrease with reducing percolation probability. As a striking characteristic, the entanglement in dynamical case can tend to maximum regardless of percolation probability in long time limit, while the static case cannot. In the model for our study, the randomized unitary operations, induced by the static and dynamical percolations, can lead to some noticeable effects on the transport and entanglement of discrete time quantum walk. The results about the interplay between disorder and entanglement not only assist quantum information processing, but also give more options to further explore and understand disorder physical processes in nature.
Quantum walks are the quantum mechanical analog to classical random walks. However, due to the wavelike nature of quantum particles, they reveal drastically different dynamics compared to their classical counterpart. These unique properties make quantum walks a new promising platform for quantum algorithms and a powerful tool to understand complex transport phenomena. This thesis presents three experiments specifically designed to send photons on a quantum walk. The experiments are based on a fiber network spreading the photonic wave packets over discrete time bins. With these Quantum Walks in Time we simulate the propagation of quantum particles in various different environments, revealing diverse dynamics such as a fast ballistic spread and an Anderson-like localization effect. Furthermore we use our concept to implement the first quantum walk on a two-dimensional lattice. The underlying topology allows for investigations of the intriguing dynamics of two strongly interacting quantum particles, which reveals unique effects such as the creation of bound states.
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms, and quantum simulation of condensed-matter systems. The key property of quantum walks, which lies at the heart of their quantum information applications, is the possibility for a parametric quantum speedup in propagation compared to classical random walks. In this work we study propagation of quantum walks on percolation-generated two-dimensional random lattices. In large-scale simulations of topological and trivial split-step walks, we identify distinct prediffusive and diffusive behaviors at different timescales. Importantly, we show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speedup, reducing the motion to ordinary diffusion. By increasing the randomness, quantum walks eventually stop spreading due to Anderson localization. Near the localization threshold, we find that the quantum walks become subdiffusive. The fragility of quantum speedup implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.
Quantum walks can be used to model processes such as transport in spin chains and bio-molecules. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well-studied on regular structures and also shown to be sensitive to defects and imperfections. Using numerical simulation, we study the spreading properties of quantum walks on percolation lattices for both bond and site percolation. The randomly missing edges or sites provide a controlled amount of disorder in the regular Cartesian lattice. In one dimension (the line) we introduce a simple model of quantum tunneling to allow the walk to proceed past the missing edges or sites. This allows the quantum walk to spread faster than a classical random walk for short times, but at longer times the disorder localises the quantum walk. In two dimensions, we observe fractional scaling of the spreading with the number of steps of the walk. For percolation above the 85% level, we obtain faster spreading than classical random walks on the full lattice.