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:hep-th/9208005 · International Journal of Modern Physics A

QUANTUM RANDOM WALKS AND TIME REVERSAL

Shahn Majid

Published Oct 10, 1993• 27 citations
arXivHTMLPDF

Abstract

Classical random walks and Markov processes are easily described by Hopf algebras. It is also known that groups and Hopf algebras (quantum groups) lead to classical and quantum diffusions. We study here the more primitive notion of a quantum random walk associated with a general Hopf algebra and show that it has a simple physical interpretation in quantum mechanics. This is by means of a representation theorem motivated from the theory of Kac algebras: If H is any Hopf algebra, it may be realized in Lin(H) in such a way that Δh=W(h⊗1)W−1 for an operator W. This W is interpreted as the time evolution operator for the system at time t coupled quantum-mechanically to the system at time t+δ. Finally, for every Hopf algebra there is a dual one, leading us to a duality operation for quantum random walks and quantum diffusions and a notion of the coentropy of an observable. The dual system has its time reversed with respect to the original system, leading us to a novel kind of CTP theorem.

DOI
10.1142/s0217751x93001818

Related papers

ON ALGEBRAIC AND QUANTUM RANDOM WALKS

Demosthenes Ellinas

Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and the canonical Heisenberg-Weyl algebra hw, and by introducing appropriate functionals on those algebras, examples of ARWs are constructed. These walks involve short and long range transition probabilities as in the case of R walk, bistochastic matrices as for the case of Z_N walk, or coherent state vectors as in the case of hw walk. The increase of classical entropy due to majorization order of those ARWs is shown, and further their corresponding evolution equations are obtained. Especially for the case of hw ARW, the diffusion limit of evolution equation leads to a quantum master equation for the density matrix of a boson system interacting with a bath of quantum oscillators prepared in squeezed vacuum state. A number of generalizations to other types of ARWs and some open problems are also stated. Next, QRWs are briefly presented together with some of their distinctive properties, such as their enhanced diffusion rates, and their behavior in respect to the relation of majorization to quantum entropy. Finally, the relation of ARWs to QRWs is investigated in terms of the theorem of unitary extension of completely positive trace preserving (CPTP) evolution maps by means of auxiliary vector spaces. It is applied to extend the CPTP step evolution map of a ARW for a quantum walker system into a unitary step evolution map for an associated QRW of a walker+quantum coin system. Examples and extensions are provided.

arXiv:quant-ph/0510128•Quantum Probability and Infinite Dimensional Analysis•Jan 1, 2005•7 citations

Quantum random walks and combinatorics

Shahn Majid

This is the first of two physically-oriented chapters in which we take a break from R-matrices and such topics and explore instead a completely different setting in which Hopf algebras arise naturally. This is the setting of logic, quantum mechanics and probability theory, in all of which contexts the coproduct Δ of the Hopf algebra plays the role of ‘sharing out’ possibilities. The theory has potential applications in computer science as well. In Boolean algebra and quantum mechanics, the product in the algebra corresponds in some sense to deduction of facts (‘putting two and two together’), and supplementing this structure with a coproduct provides a kind of reverse of this process by sharing out possible explanations of a fact. This provides the general theme of the present chapter. The chapter can also be viewed as background material for the next chapter, where we present a number of concrete models of quantum-mechanical Hopf algebras of observables. The simplest example of a combinatorial Hopf algebra is the shuffle algebra associated to an alphabet of symbols. Here the coproduct of a word is the formal sum of all pairs of words which could be shuffled to give the original word . Here, a shuffle of two words takes symbols from each of the words and interleaves them randomly while preserving the order of each word (this is exactly what you do when shuffling a pack of cards).

Cambridge University Press eBooks•Dec 14, 1995•1 citation

QUANTUM OPERATIONS INDUCED BY CLASSICAL RANDOMNESS: THE CASE OF QUBIT

I. Tsohantjis

The question of quantum computation gates and quantum dissipation maps generated by means of classical random walks is addressed here in operations involving qubit states. Classical variables determining the manifold of qubit state vectors and density matrices are left to perform a classical random walk formulated algebraically by means of Hopf algebras. It is shown that this induces quantum operations on the qubits and density matrices which are further identified with e.g. known unitary transformations and completely positive trace preserving maps, depending upon the kind of random walk chosen.

International Journal of Quantum Information•May 30, 2007•0 citations

Quantum Diffusions and Appell Systems

Demosthenes Ellinas

Within the algebraic framework of Hopf algebras, random walks and associated diffusion equations (master equations) are constructed and studied for two basic operator algebras of Quantum Mechanics i.e the Heisenberg-Weyl algebra (hw) and its q-deformed version hw_q. This is done by means of functionals determined by the associated coherent state density operators. The ensuing master equations admit solutions given by hw and hw_q-valued Appell systems.

•Jan 14, 2000•4 citations

Hopf algebras, random walks and quantum master equations

Demosthenes Ellinas

Hopf algebras of functions and operators are utilized to develop a mathematical construction scheme for building algebraic random walks. The main construction treats systems of covariance formed by translation operator and its associated operator valued measures on e.g. the circle and the line, and derives an algebraic quantum random walk by means of completely positive trace preserving maps. Asymptotic limit of the action of such maps is shown to lead to quantum master equations of Lindblad type. 2000 MSC: 57T05, 60B15, 81R15

Journal of Generalized Lie Theory and Applications•Jan 1, 2008•1 citation

Dynamical Entropy of Quantum Random Walks

Duncan Wright

In this manuscript, we study discrete-time dynamics of systems that arise in physics and information theory, and the measure of disorder in these systems known as dy- namical entropy. The study of dynamics in classical systems is done from two distinct viewpoints: random walks and dynamical systems. Random walks are probabilistic in nature and are described by stochastic processes. On the other hand, dynami- cal systems are described algebraically and deterministic in nature. The measure of disorder from either viewpoint is known as dynamical entropy. Entropy is an essential notion in physics and information theory. Motivated by the study of disorder for the positions and velocities of gas molecules, the notion of entropy was first introduced mathematically by Boltzmann near the end of the 19th Century and gives rise to the second law of thermodynamics. Almost eighty years after Boltzmann, Shannon became the father of the new field of information theory when he produced his groundbreaking works where he used entropy as a measure of information transfer between two sources. In the last two years of the 1950’s, Kolmogorov and Sinai extended the notions of Boltzmann to a dynamical entropy. The Kolmogorov-Sinai dynamical entropy gives a measure for the disorder of a system of particles (e.g. gas molecules) averaged over time, quantifying the uncertainty in the dynamics of a system. The advent of quantum mechanics and its pervasiveness in nature has required the development of non-commutative generalizations of dynamics and dynamical entropy to the quantum regime. Many of each have been proposed. In particular, we recall the definitions of quantum random walks, dynamical systems and Markov chains. We motivate each generalization by relating to its classical counterpart. Quantum dynamical entropy (QDE) is a generalization of the Kolmogorov-Sinai dynamical entropy to quantum mechanics. There have been numerous definitions for QDE beginning with that of Connes, Narnhofer and Thirring in 1987. We focus on the semi- classical approach given by Słomczyński and Życzkowski in 1994 and the quantum Markov chain approach which started with Accardi, Ohya and Watanabe in 1997. Linearity of a dynamical entropy means that the dynamical entropy of the n-fold composition of a dynamical map with itself is equal to n times the dynamical entropy of the map for every positive integer n. We show that the quantum dynamical entropy introduced by Słomczyński and Życzkowski is nonlinear in the time interval between successive measurements of a quantum dynamical system. This is in contrast to Kolmogorov-Sinai dynamical entropy for classical dynamical systems, which is linear in time. We also compute the exact values of quantum dynamical entropy for the Hadamard walk with varying Lüders-von Neumann instruments and partitions. In 1948, Shannon proved the Source Coding Theorem which gives upper and lower bounds on the minimal expected codeword length in terms of the entropy of a ran- dom variable. This theorem can be leveraged to give the minimal expected average codeword length for a string of symbols in terms of entropy rate, which can be in- terpreted as the dynamical entropy of a stochastic process. In 1994, Schumacher defined indeterminate-length quantum codes and proved a Quantum Source Coding Theorem. We introduce the notion of stochastic ensembles of pure states and give a novel representation in terms of quantum Markov chains. Moreover, this representa- tion allows us to extend the Quantum Source Coding Theorem, giving the minimal expected average codeword length of an indeterminate-length quantum code in terms of quantum dynamical entropy. This manuscript includes joint work with Dr. George Androulakis (Mathematics, University of South Carolina).

•Jan 1, 2019•0 citations
Classical random walks and Markov processes are easily described by Hopf algebras. It is also known that groups and Hopf algebras (quantum groups) lead to classical and quantum diffusions. We study here the more primitive notion of a quantum random walk associated with a general Hopf algebra and show that it has a simple physical interpretation in quantum mechanics. This is by means of a representation theorem motivated from the theory of Kac algebras: If H is any Hopf algebra, it may be realized in Lin(H) in such a way that Δh=W(h⊗1)W−1 for an operator W. This W is interpreted as the time evolution operator for the system at time t coupled quantum-mechanically to the system at time t+δ. Finally, for every Hopf algebra there is a dual one, leading us to a duality operation for quantum random walks and quantum diffusions and a notion of the coentropy of an observable. The dual system has its time reversed with respect to the original system, leading us to a novel kind of CTP theorem.
Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and the canonical Heisenberg-Weyl algebra hw, and by introducing appropriate functionals on those algebras, examples of ARWs are constructed. These walks involve short and long range transition probabilities as in the case of R walk, bistochastic matrices as for the case of Z_N walk, or coherent state vectors as in the case of hw walk. The increase of classical entropy due to majorization order of those ARWs is shown, and further their corresponding evolution equations are obtained. Especially for the case of hw ARW, the diffusion limit of evolution equation leads to a quantum master equation for the density matrix of a boson system interacting with a bath of quantum oscillators prepared in squeezed vacuum state. A number of generalizations to other types of ARWs and some open problems are also stated. Next, QRWs are briefly presented together with some of their distinctive properties, such as their enhanced diffusion rates, and their behavior in respect to the relation of majorization to quantum entropy. Finally, the relation of ARWs to QRWs is investigated in terms of the theorem of unitary extension of completely positive trace preserving (CPTP) evolution maps by means of auxiliary vector spaces. It is applied to extend the CPTP step evolution map of a ARW for a quantum walker system into a unitary step evolution map for an associated QRW of a walker+quantum coin system. Examples and extensions are provided.
This is the first of two physically-oriented chapters in which we take a break from R-matrices and such topics and explore instead a completely different setting in which Hopf algebras arise naturally. This is the setting of logic, quantum mechanics and probability theory, in all of which contexts the coproduct Δ of the Hopf algebra plays the role of ‘sharing out’ possibilities. The theory has potential applications in computer science as well. In Boolean algebra and quantum mechanics, the product in the algebra corresponds in some sense to deduction of facts (‘putting two and two together’), and supplementing this structure with a coproduct provides a kind of reverse of this process by sharing out possible explanations of a fact. This provides the general theme of the present chapter. The chapter can also be viewed as background material for the next chapter, where we present a number of concrete models of quantum-mechanical Hopf algebras of observables. The simplest example of a combinatorial Hopf algebra is the shuffle algebra associated to an alphabet of symbols. Here the coproduct of a word is the formal sum of all pairs of words which could be shuffled to give the original word . Here, a shuffle of two words takes symbols from each of the words and interleaves them randomly while preserving the order of each word (this is exactly what you do when shuffling a pack of cards).
The question of quantum computation gates and quantum dissipation maps generated by means of classical random walks is addressed here in operations involving qubit states. Classical variables determining the manifold of qubit state vectors and density matrices are left to perform a classical random walk formulated algebraically by means of Hopf algebras. It is shown that this induces quantum operations on the qubits and density matrices which are further identified with e.g. known unitary transformations and completely positive trace preserving maps, depending upon the kind of random walk chosen.
Hopf algebras of functions and operators are utilized to develop a mathematical construction scheme for building algebraic random walks. The main construction treats systems of covariance formed by translation operator and its associated operator valued measures on e.g. the circle and the line, and derives an algebraic quantum random walk by means of completely positive trace preserving maps. Asymptotic limit of the action of such maps is shown to lead to quantum master equations of Lindblad type. 2000 MSC: 57T05, 60B15, 81R15
In this manuscript, we study discrete-time dynamics of systems that arise in physics and information theory, and the measure of disorder in these systems known as dy- namical entropy. The study of dynamics in classical systems is done from two distinct viewpoints: random walks and dynamical systems. Random walks are probabilistic in nature and are described by stochastic processes. On the other hand, dynami- cal systems are described algebraically and deterministic in nature. The measure of disorder from either viewpoint is known as dynamical entropy. Entropy is an essential notion in physics and information theory. Motivated by the study of disorder for the positions and velocities of gas molecules, the notion of entropy was first introduced mathematically by Boltzmann near the end of the 19th Century and gives rise to the second law of thermodynamics. Almost eighty years after Boltzmann, Shannon became the father of the new field of information theory when he produced his groundbreaking works where he used entropy as a measure of information transfer between two sources. In the last two years of the 1950’s, Kolmogorov and Sinai extended the notions of Boltzmann to a dynamical entropy. The Kolmogorov-Sinai dynamical entropy gives a measure for the disorder of a system of particles (e.g. gas molecules) averaged over time, quantifying the uncertainty in the dynamics of a system. The advent of quantum mechanics and its pervasiveness in nature has required the development of non-commutative generalizations of dynamics and dynamical entropy to the quantum regime. Many of each have been proposed. In particular, we recall the definitions of quantum random walks, dynamical systems and Markov chains. We motivate each generalization by relating to its classical counterpart. Quantum dynamical entropy (QDE) is a generalization of the Kolmogorov-Sinai dynamical entropy to quantum mechanics. There have been numerous definitions for QDE beginning with that of Connes, Narnhofer and Thirring in 1987. We focus on the semi- classical approach given by Słomczyński and Życzkowski in 1994 and the quantum Markov chain approach which started with Accardi, Ohya and Watanabe in 1997. Linearity of a dynamical entropy means that the dynamical entropy of the n-fold composition of a dynamical map with itself is equal to n times the dynamical entropy of the map for every positive integer n. We show that the quantum dynamical entropy introduced by Słomczyński and Życzkowski is nonlinear in the time interval between successive measurements of a quantum dynamical system. This is in contrast to Kolmogorov-Sinai dynamical entropy for classical dynamical systems, which is linear in time. We also compute the exact values of quantum dynamical entropy for the Hadamard walk with varying Lüders-von Neumann instruments and partitions. In 1948, Shannon proved the Source Coding Theorem which gives upper and lower bounds on the minimal expected codeword length in terms of the entropy of a ran- dom variable. This theorem can be leveraged to give the minimal expected average codeword length for a string of symbols in terms of entropy rate, which can be in- terpreted as the dynamical entropy of a stochastic process. In 1994, Schumacher defined indeterminate-length quantum codes and proved a Quantum Source Coding Theorem. We introduce the notion of stochastic ensembles of pure states and give a novel representation in terms of quantum Markov chains. Moreover, this representa- tion allows us to extend the Quantum Source Coding Theorem, giving the minimal expected average codeword length of an indeterminate-length quantum code in terms of quantum dynamical entropy. This manuscript includes joint work with Dr. George Androulakis (Mathematics, University of South Carolina).