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:quant-ph/0104126

Probabilities, Tensors and Qubits

Alexander Yu. Vlasov

Published Apr 26, 2001• 3 citations
arXivHTMLPDF

Abstract

In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities in the set may be represented linearly via coefficients of density matrix and it is very similar with description using mixed states, but also may give some alternative view on specific properties of quantum circuits due to possibility of direct comparison with classical statistical paradigm.

DOI
10.48550/arxiv.quant-ph/0104126

Related papers

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

Mapping of Quantum Systems to the Probability Simplex

Deniz D. Yavuz, Anirudh Yadav

We start with the simplest quantum system (a two-level system, i.e., a qubit) and discuss a one-to-one mapping of the quantum state in a two-dimensional Hilbert space to a vector in an eight dimensional probability space (probability simplex). We then show how the usual transformations of the quantum state, specifically the Hadamard gate and the single-qubit phase gate, can be accomplished with appropriate transformations of the mapped vector in the probability simplex. One key defining feature of both the mapping to the simplex and the transformations in the simplex is that they are not linear. These results show that both the initial state and the time evolution of a qubit can be fully captured in an eight dimensional probability simplex (or equivalently using three classical probabilistic bits). We then discuss multi-partite quantum systems and their mapping to the probability simplex. Here, the key tool is the identical tensor product structure of combining multiple quantum systems as well as multiple probability spaces. Specifically, we explicitly show how to implement an analog of the two-qubit controlled-not (CNOT) gate in the simplex. We leave it an open problem how much the quantum dynamics of $N$ qubits can be captured in a probability simplex with $3N$ classical probabilistic bits. Finally, we also discuss the equivalent of the Schrodinger's equation for the wavefunction (in a Hilbert space of arbitrary dimension), which dictates the time evolution of the vectors in the simplex.

arXiv:2301.06572•Jan 16, 2023•2 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

Introduction to Quantum Theory

Andrei Yu. Khrennikov

This chapter contains a brief introduction to mathematical formalism and QM axiomatics. It is oriented to non-physicists. Since QM is a statistical theory it is natural to start with the classical probability model (Kolmogorov [ 191 ], 1933). Then we present the basics of the theory of Hilbert spaces and Hermitian operators and the representation of pure and mixed states by normalized vectors and density operators. This introduction is sufficient to formulate the axiomatics of QM in the form of five postulates. The projection postulate (the most questionable postulate of QM) is presented in a separate section. We sharply distinguish between the cases of quantum observables represented by Hermitian operators with nondegenerate and degenerate spectra, von Neumann’s and Ltiders’s forms of the projection postulate. The axiomatics is completed by a short section on the main interpretations of QM. The projection postulate (LUders’s form) plays a crucial role in the definition of quantum conditional (transition) probability. By operating with the latter we consider interference of probabilities for two incompatible observables as a modification of the formula of total probability by adding the interference term. This viewpoint to interference of probabilities was elaborated in a series of works by Khrennikov. Since classical probability theory is based on the 142 Boolean algebra of events, a violation of the law of total probability can be treated as the probabilistic sign of a violation of the laws of the Boolean logics. From this viewpoint, quantum theory can be considered as representing a new kind of logic, so-called quantum logic. The latter is also briefly presented in a separate section. We continue this review with a new portion of quantum mathematics, namely the notion of the tensor product of Hilbert spaces and the tensor product of operators. After the section on Dirac’s notation with ket and bra vector, we discuss briefly the notion of qubit and entanglement of a few qubits. This chapter concludes with a presentation of the detailed analysis of the probabilistic structure of the two-slit experiment in a bunch of different experimental contexts. This contextual structure leads to a violation of the law of total probability and non-Kolmogorovean probabilistic structure of this experiment.

•Jul 22, 2020•6 citations

Classical simulation of quantum circuits using a multiqubit Bloch vector representation of density matrices

Qunsheng Huang, Christian B. Mendl

In the Bloch sphere picture, one finds the coefficients for expanding a single-qubit density operator in terms of the identity and Pauli matrices. A generalization to $n$ qubits via tensor products represents a density operator by a real vector of length ${4}^{n}$, conceptually similar to a state vector. Here, we study this approach for the purpose of quantum circuit simulation, including noise processes. The tensor structure leads to computationally efficient algorithms for applying circuit gates and performing few-qubit quantum operations. In view of variational circuit optimization, we study ``backpropagation'' through a quantum circuit and gradient computation based on this representation, and generalize our analysis to the Lindblad equation for modeling the (nonunitary) time evolution of a density operator.

arXiv:2103.13962•Physical Review A•Feb 9, 2022•7 citations

Qubit state vector in probability representation of quantum mechanics

Vladimir N. Chernega, Olga V. Man’ko, Vladimir I. Man’ko

Review of probability representation of quantum mechanics where the system states are identified with fair probability distributions is presented. Examples of qubits and qutrits are given in detail. The explicit expressions of the qubit density matrices and qubit state vectors in terms of probabilities of dichotomic random variables are discussed. The wave function of a qubit state, and its phase which is not contained in the density matrix of the state, are expressed in terms of the dichotomic probabilities. The generalisation of the probability representation to the case of qudit state is considered. The Schrödinger–like equation for spectra of Hermitian and non Hermitian Hamiltonians is written in the new form of equation for the dichotomic probabilities.

AIP conference proceedings•Jan 1, 2021•0 citations
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities in the set may be represented linearly via coefficients of density matrix and it is very similar with description using mixed states, but also may give some alternative view on specific properties of quantum circuits due to possibility of direct comparison with classical statistical paradigm.
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.
We start with the simplest quantum system (a two-level system, i.e., a qubit) and discuss a one-to-one mapping of the quantum state in a two-dimensional Hilbert space to a vector in an eight dimensional probability space (probability simplex). We then show how the usual transformations of the quantum state, specifically the Hadamard gate and the single-qubit phase gate, can be accomplished with appropriate transformations of the mapped vector in the probability simplex. One key defining feature of both the mapping to the simplex and the transformations in the simplex is that they are not linear. These results show that both the initial state and the time evolution of a qubit can be fully captured in an eight dimensional probability simplex (or equivalently using three classical probabilistic bits). We then discuss multi-partite quantum systems and their mapping to the probability simplex. Here, the key tool is the identical tensor product structure of combining multiple quantum systems as well as multiple probability spaces. Specifically, we explicitly show how to implement an analog of the two-qubit controlled-not (CNOT) gate in the simplex. We leave it an open problem how much the quantum dynamics of NNN qubits can be captured in a probability simplex with 3N3N3N classical probabilistic bits. Finally, we also discuss the equivalent of the Schrodinger's equation for the wavefunction (in a Hilbert space of arbitrary dimension), which dictates the time evolution of the vectors in the simplex.
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.
This chapter contains a brief introduction to mathematical formalism and QM axiomatics. It is oriented to non-physicists. Since QM is a statistical theory it is natural to start with the classical probability model (Kolmogorov [ 191 ], 1933). Then we present the basics of the theory of Hilbert spaces and Hermitian operators and the representation of pure and mixed states by normalized vectors and density operators. This introduction is sufficient to formulate the axiomatics of QM in the form of five postulates. The projection postulate (the most questionable postulate of QM) is presented in a separate section. We sharply distinguish between the cases of quantum observables represented by Hermitian operators with nondegenerate and degenerate spectra, von Neumann’s and Ltiders’s forms of the projection postulate. The axiomatics is completed by a short section on the main interpretations of QM. The projection postulate (LUders’s form) plays a crucial role in the definition of quantum conditional (transition) probability. By operating with the latter we consider interference of probabilities for two incompatible observables as a modification of the formula of total probability by adding the interference term. This viewpoint to interference of probabilities was elaborated in a series of works by Khrennikov. Since classical probability theory is based on the 142 Boolean algebra of events, a violation of the law of total probability can be treated as the probabilistic sign of a violation of the laws of the Boolean logics. From this viewpoint, quantum theory can be considered as representing a new kind of logic, so-called quantum logic. The latter is also briefly presented in a separate section. We continue this review with a new portion of quantum mathematics, namely the notion of the tensor product of Hilbert spaces and the tensor product of operators. After the section on Dirac’s notation with ket and bra vector, we discuss briefly the notion of qubit and entanglement of a few qubits. This chapter concludes with a presentation of the detailed analysis of the probabilistic structure of the two-slit experiment in a bunch of different experimental contexts. This contextual structure leads to a violation of the law of total probability and non-Kolmogorovean probabilistic structure of this experiment.
In the Bloch sphere picture, one finds the coefficients for expanding a single-qubit density operator in terms of the identity and Pauli matrices. A generalization to nnn qubits via tensor products represents a density operator by a real vector of length 4n{4}^{n}4n, conceptually similar to a state vector. Here, we study this approach for the purpose of quantum circuit simulation, including noise processes. The tensor structure leads to computationally efficient algorithms for applying circuit gates and performing few-qubit quantum operations. In view of variational circuit optimization, we study ``backpropagation'' through a quantum circuit and gradient computation based on this representation, and generalize our analysis to the Lindblad equation for modeling the (nonunitary) time evolution of a density operator.
Review of probability representation of quantum mechanics where the system states are identified with fair probability distributions is presented. Examples of qubits and qutrits are given in detail. The explicit expressions of the qubit density matrices and qubit state vectors in terms of probabilities of dichotomic random variables are discussed. The wave function of a qubit state, and its phase which is not contained in the density matrix of the state, are expressed in terms of the dichotomic probabilities. The generalisation of the probability representation to the case of qudit state is considered. The Schrödinger–like equation for spectra of Hermitian and non Hermitian Hamiltonians is written in the new form of equation for the dichotomic probabilities.