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:0803.1391 · Open Systems & Information Dynamics

Algorithm for Quantum-like Representation: Transformation of Probabilistic Data into Vectors on Bloch's Sphere

Andrei Yu. Khrennikov

Published Sep 1, 2008• 7 citations
arXivHTMLPDF

Abstract

In this paper, we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed, cf. [1] and [2] on recent numerical simulation for quantum correlations. The Bloch's sphere is used for the visualization of results of numerical simulation. On the one hand, creation of such a quantum-like (QL) representation and its numerical approval is an important step in clarification of extremely complicated interrelation between classical and quantum randomness. On the other hand, it opens new possibilities for applying the mathematical formalism of QM in other domains of science.

DOI
10.1142/s1230161208000183

Related papers

Quantum-like Representation of Macroscopic Configurations

Andrei Yu. Khrennikov

The aim of this paper is to apply a contextual probabilistic model (in the spirit of Mackey, Gudder, Ballentine) to represent and to generalize some results of quantum logic about possible macroscopic quantum-like (QL) behaviour. The crucial point is that our model provides QL-representation of macroscopic configurations in terms of complex probability amplitudes -- wave functions of such configurations. Thus, instead of the language of propositions which is common in quatum logic, we use the language of wave functions which is common in the conventional presentation of QM. We propose a quantum-like representation algorithm, QLRA, which maps probabilistic data of any origin in complex (or even hyperbolic) Hilbert space. On the one hand, this paper clarifyes some questions in foundations of QM, since some rather mystical quantum features are illustrated on the basis of behavior of macroscopic systems. On the other hand, the approach developed in this paper may be used e.g. in biology, sociology, or psychology. Our example of QL-representation of hidden macroscopic configurations can find natural applications in those domains of science.

arXiv:0705.3898•May 26, 2007•2 citations

On relations between classical and quantum theories of information and probability

Peter Nyman

In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometric interference term and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical data is collected from measurements of two dichotomous and trichotomous observables respectively. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum--like representation. We also study simulations of quantum computers on classical computers.Although it can not be denied that great progress have been made in quantum technologies, it is clear that there is still a huge gap between the creation of experimental quantum computers and realization of a quantum computer that can be used in applications. Therefore the simulation of quantum computations on classical computers became an important part in the attempt to cover this gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. The second part of this thesis is devoted to adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulations on classical computers. Concretely we represent Simon's algorithm, Deutsch-Josza algorithm, Shor's algorithm, Grover's algorithm and quantum error-correcting codes in the Mathematica symbolic language. We see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include future algorithms in this framework.

•Jan 1, 2011•0 citations

Quantum-like Probabilistic Models Outside Physics

Andrei Yu. Khrennikov

We present a quantum-like (QL) model in that contexts (complexes of e.g. mental, social, biological, economic or even political conditions) are represented by complex probability amplitudes. This approach gives the possibility to apply the mathematical quantum formalism to probabilities induced in any domain of science. In our model quantum randomness appears not as irreducible randomness (as it is commonly accepted in conventional quantum mechanics, e.g., by von Neumann and Dirac), but as a consequence of obtaining incomplete information about a system. We pay main attention to the QL description of processing of incomplete information. Our QL model can be useful in cognitive, social and political sciences as well as economics and artificial intelligence. In this paper we consider in a more detail one special application -- QL modeling of brain's functioning. The brain is modeled as a QL-computer.

arXiv:physics/0702250•WORLD SCIENTIFIC eBooks•Jun 1, 2008•15 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

Quantum representation of the earth based on the bloch sphere

Chan Li, Zhu Cao, Dayong Lu +2 more

Implementing a digital Earth requires processing an enormous amount of data. Compared with classical algorithms, quantum algorithms can take exponential or quadratic acceleration and are more suitable for processing big data. However, existing quantum models require massive resources to process data on the Earth due to their low compatibility with spheres. So, we propose a quantum representation of the Earth based on the Bloch sphere (QREB), which is tailor-made for the Earth. Based on this model, the scale transformation and specific rotation transformation only need to change one variable. And the time complexity of the quantum point of interest extraction algorithm based on this model is the square root of the classical algorithm. Moreover, in the example of extracting thin black lines on the basketball, the accuracy is improved from 50% to 87.5%. The QREB model can reduce the resources required to process spherical data and accelerate the realization of a digital Earth.

International Journal of Quantum Information•Aug 11, 2025•1 citation

On hyperbolic interferences in the quantum--like representation algorithm for the case of triple-valued observables

Peter Nyman

The quantum-like representation algorithm (QLRA) was introduced by A. Khrennikov \cite{K1,K2,K3,K4,K5} to solve the "inverse Born's rule problem", i.e. to construct a representation of probabilistic data - measured in any context of science - and represent this data by a complex or more general (A Clifford algebra is introduced for this more general representation) probability amplitude which matches a generalization of Born's rule. The outcome from QLRA will introduce the formula of total probability with an additional term of trigonometric, hyperbolic or hyper-trigonometric interference and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical datas are collected from measurements of two trichotomous observables and the complexity of the problem increased eventually compared to the case of dichotomous observables. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum-like representation. In this paper we will present a class of statistical data which satisfy these nonlinear constraints and have a quantum-like representation. This quantum-like representation induces trigonometric-, hyperbolic- and hyper-trigonometric interferences representation.

arXiv:1108.2194•Aug 10, 2011•2 citations
In this paper, we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed, cf. [1] and [2] on recent numerical simulation for quantum correlations. The Bloch's sphere is used for the visualization of results of numerical simulation. On the one hand, creation of such a quantum-like (QL) representation and its numerical approval is an important step in clarification of extremely complicated interrelation between classical and quantum randomness. On the other hand, it opens new possibilities for applying the mathematical formalism of QM in other domains of science.
The aim of this paper is to apply a contextual probabilistic model (in the spirit of Mackey, Gudder, Ballentine) to represent and to generalize some results of quantum logic about possible macroscopic quantum-like (QL) behaviour. The crucial point is that our model provides QL-representation of macroscopic configurations in terms of complex probability amplitudes -- wave functions of such configurations. Thus, instead of the language of propositions which is common in quatum logic, we use the language of wave functions which is common in the conventional presentation of QM. We propose a quantum-like representation algorithm, QLRA, which maps probabilistic data of any origin in complex (or even hyperbolic) Hilbert space. On the one hand, this paper clarifyes some questions in foundations of QM, since some rather mystical quantum features are illustrated on the basis of behavior of macroscopic systems. On the other hand, the approach developed in this paper may be used e.g. in biology, sociology, or psychology. Our example of QL-representation of hidden macroscopic configurations can find natural applications in those domains of science.
In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometric interference term and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical data is collected from measurements of two dichotomous and trichotomous observables respectively. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum--like representation. We also study simulations of quantum computers on classical computers.Although it can not be denied that great progress have been made in quantum technologies, it is clear that there is still a huge gap between the creation of experimental quantum computers and realization of a quantum computer that can be used in applications. Therefore the simulation of quantum computations on classical computers became an important part in the attempt to cover this gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. The second part of this thesis is devoted to adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulations on classical computers. Concretely we represent Simon's algorithm, Deutsch-Josza algorithm, Shor's algorithm, Grover's algorithm and quantum error-correcting codes in the Mathematica symbolic language. We see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include future algorithms in this framework.
We present a quantum-like (QL) model in that contexts (complexes of e.g. mental, social, biological, economic or even political conditions) are represented by complex probability amplitudes. This approach gives the possibility to apply the mathematical quantum formalism to probabilities induced in any domain of science. In our model quantum randomness appears not as irreducible randomness (as it is commonly accepted in conventional quantum mechanics, e.g., by von Neumann and Dirac), but as a consequence of obtaining incomplete information about a system. We pay main attention to the QL description of processing of incomplete information. Our QL model can be useful in cognitive, social and political sciences as well as economics and artificial intelligence. In this paper we consider in a more detail one special application -- QL modeling of brain's functioning. The brain is modeled as a QL-computer.
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.
Implementing a digital Earth requires processing an enormous amount of data. Compared with classical algorithms, quantum algorithms can take exponential or quadratic acceleration and are more suitable for processing big data. However, existing quantum models require massive resources to process data on the Earth due to their low compatibility with spheres. So, we propose a quantum representation of the Earth based on the Bloch sphere (QREB), which is tailor-made for the Earth. Based on this model, the scale transformation and specific rotation transformation only need to change one variable. And the time complexity of the quantum point of interest extraction algorithm based on this model is the square root of the classical algorithm. Moreover, in the example of extracting thin black lines on the basketball, the accuracy is improved from 50% to 87.5%. The QREB model can reduce the resources required to process spherical data and accelerate the realization of a digital Earth.
The quantum-like representation algorithm (QLRA) was introduced by A. Khrennikov \cite{K1,K2,K3,K4,K5} to solve the "inverse Born's rule problem", i.e. to construct a representation of probabilistic data - measured in any context of science - and represent this data by a complex or more general (A Clifford algebra is introduced for this more general representation) probability amplitude which matches a generalization of Born's rule. The outcome from QLRA will introduce the formula of total probability with an additional term of trigonometric, hyperbolic or hyper-trigonometric interference and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical datas are collected from measurements of two trichotomous observables and the complexity of the problem increased eventually compared to the case of dichotomous observables. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum-like representation. In this paper we will present a class of statistical data which satisfy these nonlinear constraints and have a quantum-like representation. This quantum-like representation induces trigonometric-, hyperbolic- and hyper-trigonometric interferences representation.