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 Quantum Information

QUANTUM OPERATIONS INDUCED BY CLASSICAL RANDOMNESS: THE CASE OF QUBIT

I. Tsohantjis

Published May 30, 2007• 0 citations
Publisher

Abstract

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.

DOI
10.1142/s0219749907002979

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

Probability Representation of Quantum Channels

Ashot S. Avanesov, Vladimir I. Man’ko

Using the known possibility to associate the completely positive maps with density matrices and recent results on expressing the density matrices with sets of classical probability distributions of dichotomic random variables we construct the probability representation of the completely positive maps. In this representation, any completely positive map of qubit state density matrix is identified with the set of classical coin probability distributions. Examples of the maps of qubit states are studied in detail. The evolution equation of quantum states is written in the form of the classical-like kinetic equation for probability distributions identified with qubit state.

arXiv:1904.03036•Lobachevskii Journal of Mathematics•Oct 1, 2019•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

QUANTUM RANDOM WALKS AND TIME REVERSAL

Shahn Majid

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.

arXiv:hep-th/9208005•International Journal of Modern Physics A•Oct 10, 1993•26 citations

Linear Algebra in Quantum Computing

Byoungwook Jang

The immense power of computing has been continually growing, yet we still want more speed and computing capacity. If, as Moores Law states, the number of transistors on a microprocessor continues to double every other year, we will find the circuits on a microprocessor measured on an atomic scale in a couple of decades. Then, we would start to consider quantum computers, which will make use of the power of atoms to perform memory and processing tasks. The mathematics behind quantum computers will be the focus of my presentation. The information contained in qubits (quantum bits), which are analogues of classical bits, can be represented in a matrix form, namely a density matrix. It has been found that a density matrix is positive semi-definite and of trace 1. The operators acting on density matrices need to preserve the trace and positivity so that the resulting output after processing the information is still a density matrix. Therefore, these operators can be thought of as a trace-preserving positive map. In this presentation, the definitions of such maps and properties will be introduced along with the theorems that are related to completely positive maps.

•Jan 1, 2014•0 citations

Simulation of quantum algorithms using classical probabilistic bits and circuits

Deniz D. Yavuz, Anirudh Yadav

We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a classical random variable with eight probabilistic outcomes). The key idea in this mapping is to store both the amplitude and phase information of the complex coefficients that describe the qubit state in the probabilities. Due to the identical tensor product structure of combining multiple quantum systems as well as multiple probability spaces, $n$ qubits are then mapped to a tensor product of $n$ 8-dimensional probabilistic vectors (i.e., the Hilbert space of dimension $2^n$ is mapped to a probability space of dimension $8^n$). After this initial mapping, we show how to implement the analogs of single-qubit and two-qubit gates in the probability space using correlation-inducing operations on these classical random variables. The key defining feature of both the mapping to the probability space and the transformations in this space (i.e., operations on the random variables) is that they are not linear, but instead affine. Using this architecture, the evolution of the $2^n$ complex coefficients of the quantum system can be tracked in the joint fully-correlated probabilities of the polynomial number of random variables. We then give specific procedures for implementing (1) the Deutsch-Jozsa algorithm, and (2) the Quantum Fourier Transform in the probability space. Identical to the Quantum case, simulating the Quantum Fourier Transform in the probability space requires $O(n)$ probabilistic bits and $O(n^2)$ (i.e., quadratic in the number of quantum bits) operations.

arXiv:2307.14452•Jul 26, 2023•1 citation
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.
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.
Using the known possibility to associate the completely positive maps with density matrices and recent results on expressing the density matrices with sets of classical probability distributions of dichotomic random variables we construct the probability representation of the completely positive maps. In this representation, any completely positive map of qubit state density matrix is identified with the set of classical coin probability distributions. Examples of the maps of qubit states are studied in detail. The evolution equation of quantum states is written in the form of the classical-like kinetic equation for probability distributions identified with qubit state.
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
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.
The immense power of computing has been continually growing, yet we still want more speed and computing capacity. If, as Moores Law states, the number of transistors on a microprocessor continues to double every other year, we will find the circuits on a microprocessor measured on an atomic scale in a couple of decades. Then, we would start to consider quantum computers, which will make use of the power of atoms to perform memory and processing tasks. The mathematics behind quantum computers will be the focus of my presentation. The information contained in qubits (quantum bits), which are analogues of classical bits, can be represented in a matrix form, namely a density matrix. It has been found that a density matrix is positive semi-definite and of trace 1. The operators acting on density matrices need to preserve the trace and positivity so that the resulting output after processing the information is still a density matrix. Therefore, these operators can be thought of as a trace-preserving positive map. In this presentation, the definitions of such maps and properties will be introduced along with the theorems that are related to completely positive maps.
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a classical random variable with eight probabilistic outcomes). The key idea in this mapping is to store both the amplitude and phase information of the complex coefficients that describe the qubit state in the probabilities. Due to the identical tensor product structure of combining multiple quantum systems as well as multiple probability spaces, nnn qubits are then mapped to a tensor product of nnn 8-dimensional probabilistic vectors (i.e., the Hilbert space of dimension 2n2^n2n is mapped to a probability space of dimension 8n8^n8n). After this initial mapping, we show how to implement the analogs of single-qubit and two-qubit gates in the probability space using correlation-inducing operations on these classical random variables. The key defining feature of both the mapping to the probability space and the transformations in this space (i.e., operations on the random variables) is that they are not linear, but instead affine. Using this architecture, the evolution of the 2n2^n2n complex coefficients of the quantum system can be tracked in the joint fully-correlated probabilities of the polynomial number of random variables. We then give specific procedures for implementing (1) the Deutsch-Jozsa algorithm, and (2) the Quantum Fourier Transform in the probability space. Identical to the Quantum case, simulating the Quantum Fourier Transform in the probability space requires O(n)O(n)O(n) probabilistic bits and O(n2)O(n^2)O(n2) (i.e., quadratic in the number of quantum bits) operations.