AIP conference proceedings

Representation of probabilistic data by complex probability amplitudes; the case of triple—valued observables

Petter Nyman, Irina Basieva, Andrei Yu. Khrennikov, Gregg S. Jaeger, M. Schlosshauer, Gregor Weihs

Published Jan 1, 2011• 0 citations

Abstract

We study the problem of representation of statistical data (of any origin) by a complex probability amplitude. This paper is devoted to representation of data collected from measurements of two trichotomous observables.

DOI: 10.1063/1.3578734

Related papers

Representation of probabilistic data by complex probability amplitudes; the case of triple—valued observables

Peter Nyman, Irina Basieva

AIP conference proceedingsJan 1, 20115 citations

Inverse quantum measurement problem

D. Sokolovski, S. Martínez-Garaot, M. Pons

Quantum mechanics relates probability of an observable event to the absolute square of the corresponding probability amplitude. It may, therefore, seem that the information about the amplitudes' phases must be irretrievably lost in the experimental data. Yet, there are experiments which report measurements of wave functions, and closely related quantities such as Bohm's velocities and positions of bohmian particles. We invert the question, and ask under which conditions the values of quantum amplitudes can be recovered from observed probability distributions and averages.

arXiv:1907.12480Jul 29, 20190 citations

Representation of Probabilistic Data by Quantum-Like Hyperbolic Amplitudes

Andrei Yu. Khrennikov

Advances in Applied Clifford AlgebrasNov 1, 20086 citations

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.2194Aug 10, 20112 citations

Quantum Mechanics without Probability Amplitudes

William K. Wootters

First steps are taken toward a formulation of quantum mechanics which avoids the use of probability amplitudes and is expressed entirely in terms of observable probabilities. Quantum states are represented not by state vectors or density matrices but by “probability tables,” which contain only the probabilities of the outcomes of certain special measurements. The rule for computing transition probabilities, normally given by the squared modulus of the inner product of two state vectors, is re-expressed in terms of probability tables. The new version of the rule is surprisingly simple, especially when one considers that the notion of complex phases, so crucial in the evaluation of inner products, is entirely absent from the representation of states used here.

Princeton University Press eBooksJul 5, 20170 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, 20110 citations