Difference between revisions of "Store:Khrennikov04"

 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
==2. Classical versus quantum probability==
==2. Classical versus quantum probability==


CP was mathematically formalized by Kolmogorov (1933)<ref name=":2" /> This is the calculus of probability measures, where a non-negative weight <math>p(A)</math> is assigned to any event <math>A</math>. The main property of CP is its additivity: if two events <math>O_1, O_2</math> are disjoint, then the probability of disjunction of these events equals to the sum of probabilities:
CP was mathematically formalized by Kolmogorov (1933)<ref name=":2" /> This is the calculus of probability measures, where a non-negative weight <math>p(A)</math> is assigned to any event {{F:Khrennikov001}}. The main property of CP is its additivity: if two events {{F:Khrennikov006}} are disjoint, then the probability of disjunction of these events equals to the sum of probabilities:


{| width="80%" |
{| width="80%" |

Latest revision as of 17:21, 24 September 2022

2. Classical versus quantum probability

CP was mathematically formalized by Kolmogorov (1933)[1] This is the calculus of probability measures, where a non-negative weight  is assigned to any event . The main property of CP is its additivity: if two events  are disjoint, then the probability of disjunction of these events equals to the sum of probabilities:

   

QP is the calculus of complex amplitudes or in the abstract formalism complex vectors. Thus, instead of operations on probability measures one operates with vectors. We can say that QP is a vector model of probabilistic reasoning. Each complex amplitude  gives the probability by the Born’s rule: Probability is obtained as the square of the absolute value of the complex amplitude.

   


(for the Hilbert space formalization, see Section 3.2, formula (7)). By operating with complex probability amplitudes, instead of the direct operation with probabilities, one can violate the basic laws of CP.

In CP, the formula of total probability (FTP) is derived by using additivity of probability and the Bayes formula, the definition of conditional probability, ,

Consider the pair,  and , of discrete classical random variables. Then

 


Thus, in CP the -probability distribution can be calculated from the -probability and the conditional probabilities

In QP, classical FTP is perturbed by the interference term (Khrennikov, 2010[2]); for dichotomous quantum observables  and  of the von Neumann-type, i.e., given by Hermitian operators  and , the quantum version of FTP has the form:

 
 


If the interference term7 is positive, then the QP-calculus would generate a probability that is larger than its CP-counterpart given by the classical FTP (2). In particular, this probability amplification is the basis of the quantum computing supremacy.

There is a plenty of statistical data from cognitive psychology, decision making, molecular biology, genetics and epigenetics demonstrating that biosystems, from proteins and cells (Asano et al., 2015b[3]) to humans (Khrennikov, 2010[4], Busemeyer and Bruza, 2012[5]) use this amplification and operate with non-CP updates. We continue our presentation with such examples.

  1. Cite error: Invalid <ref> tag; no text was provided for refs named :2
  2. Khrennikov A. Ubiquitous Quantum Structure: From Psychology To Finances Springer, Berlin-Heidelberg-New York(2010)
  3. Cite error: Invalid <ref> tag; no text was provided for refs named :11
  4. Khrennikov A. Ubiquitous Quantum Structure: From Psychology To Finances Springer, Berlin-Heidelberg-New York(2010)
  5. Cite error: Invalid <ref> tag; no text was provided for refs named :10