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

International Journal of Modern Physics B

QUANTUM MAPS WITH SPACE EXTENT: A PARADIGM FOR LATTICE QUANTUM WALKS

Daniel Krzysztof Wojcik

Published May 23, 2006• 7 citations
Publisher

Abstract

Classical multibaker maps are deterministic models of classical random walks. Quantum multibaker maps are their quantum versions. As such, they can be naturally considered quantum random walks. In this review we discuss the construction and properties of quantum multibaker maps and related, more general models, in the context of the recent results in dynamical systems approach to nonequilibrium statistical mechanics. Properties of other models of quantum walks are also discussed.

DOI
10.1142/s0217979206034509

Related papers

Quantum multibaker maps: Extreme quantum regime

Daniel Krzysztof Wojcik, J. R. Dorfman

We introduce a family of models for quantum mechanical, one-dimensional random walks, called quantum multibaker maps (QMB). These are Weyl quantizations of the classical multibaker models previously considered by Gaspard, Tasaki, and others. Depending on the properties of the phase's parametrizing the quantization, we consider only two classes of the QMB maps: uniform and random. Uniform QMB maps are characterized by phases that are the same in every unit cell of the multibaker chain. Random QMB maps have phases that vary randomly from unit cell to unit cell. The eigenstates in the former case are extended while in the latter they are localized. In the uniform case and for large variant Planck's over 2pi, analytic solutions can be obtained for the time-dependent quantum states for periodic chains and for open chains with absorbing boundary conditions. Steady state solutions and the properties of the relaxation to a steady state for a uniform QMB chain in contact with "particle" reservoirs can also be described analytically. The analytical results are consistent with, and confirmed by, results obtained from numerical methods. We report here results for the deep quantum regime (large variant Planck's over 2pi ) of the uniform QMB, as well as some results for the random QMB. We leave the moderate and small variant Planck's over 2pi results as well as further consideration of the other versions of the QMB for further publications.

arXiv:cond-mat/0203494•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Sep 13, 2002•11 citations

A random walk approach to quantum algorithms

Viv M. Kendon

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.

arXiv:quant-ph/0609035•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 18, 2006•116 citations

Random Walks: A Review of Algorithms and Applications

Feng Xia, Jiaying Liu, Hansong Nie +3 more

A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together.

arXiv:2008.03639•IEEE Transactions on Emerging Topics in Computational Intelligence•Nov 25, 2019•295 citations

Review on Quantum Walk Algorithm

Wenda Zhou

Abstract Quantum walk is the quantum version of classical random walk, which has shown great advantage over classical algorithms. In this article, main discoveries and breakthroughs along with several applications in the last two decades are reviewed and discussed. Reducing hitting time and diminishing mixing time, as two hot research fields, are addressed. Possibility of universal computation with more generic case of quantum walk is also mentioned. In the future, we can expect new methods and models being feasible ways to approach the theoretical lower bounds of related problems, as well as more efficient applications on specific scene.

Journal of Physics Conference Series•Jan 1, 2021•21 citations

Quantum walks: a comprehensive review

Salvador Elías Venegas-Andraca

Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entangle-ment as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete-time quantum walks.

•Jan 1, 2012•436 citations

Disorder and decoherence in coined quantum walks

Rong Zhang, Hao Qin, Bao Tang +1 more

This article aims to provide a review on quantum walks. Starting form a basic idea of discrete-time quantum walks, we will review the impact of disorder and decoherence on the properties of quantum walks. The evolution of the standard quantum walks is deterministic and disorder introduces randomness to the whole system and change interference pattern leading to the localization effect. Whereas, decoherence plays the role of transmitting quantum walks to classical random walks.

Chinese Physics B•Nov 1, 2013•18 citations
Classical multibaker maps are deterministic models of classical random walks. Quantum multibaker maps are their quantum versions. As such, they can be naturally considered quantum random walks. In this review we discuss the construction and properties of quantum multibaker maps and related, more general models, in the context of the recent results in dynamical systems approach to nonequilibrium statistical mechanics. Properties of other models of quantum walks are also discussed.
We introduce a family of models for quantum mechanical, one-dimensional random walks, called quantum multibaker maps (QMB). These are Weyl quantizations of the classical multibaker models previously considered by Gaspard, Tasaki, and others. Depending on the properties of the phase's parametrizing the quantization, we consider only two classes of the QMB maps: uniform and random. Uniform QMB maps are characterized by phases that are the same in every unit cell of the multibaker chain. Random QMB maps have phases that vary randomly from unit cell to unit cell. The eigenstates in the former case are extended while in the latter they are localized. In the uniform case and for large variant Planck's over 2pi, analytic solutions can be obtained for the time-dependent quantum states for periodic chains and for open chains with absorbing boundary conditions. Steady state solutions and the properties of the relaxation to a steady state for a uniform QMB chain in contact with "particle" reservoirs can also be described analytically. The analytical results are consistent with, and confirmed by, results obtained from numerical methods. We report here results for the deep quantum regime (large variant Planck's over 2pi ) of the uniform QMB, as well as some results for the random QMB. We leave the moderate and small variant Planck's over 2pi results as well as further consideration of the other versions of the QMB for further publications.
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together.
Abstract Quantum walk is the quantum version of classical random walk, which has shown great advantage over classical algorithms. In this article, main discoveries and breakthroughs along with several applications in the last two decades are reviewed and discussed. Reducing hitting time and diminishing mixing time, as two hot research fields, are addressed. Possibility of universal computation with more generic case of quantum walk is also mentioned. In the future, we can expect new methods and models being feasible ways to approach the theoretical lower bounds of related problems, as well as more efficient applications on specific scene.
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entangle-ment as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete-time quantum walks.