Echoing the recent Google success: Foundational Roots of Quantum Supremacy

11/23/2019
by   Andrei Khrennikov, et al.
0

The recent Google's claim on breakthrough in quantum computing is a gong signal for further analysis of foundational roots of (possible) superiority of some quantum algorithms over the corresponding classical algorithms. This note is a step in this direction. We start with critical analysis of rather common reference to entanglement and quantum nonlocality as the basic sources of quantum superiority. We elevate the role of the Bohr's principle of complementarity[%s] (PCOM) by interpreting the Bell-experiments as statistical tests of this principle. (Our analysis also includes comparison of classical vs genuine quantum entanglements.) After a brief presentation of PCOM and endowing it with the information interpretation, we analyze its computational counterpart. The main implication of PCOM is that by using the quantum representation of probability, one need not compute the joint probability distribution (jpd) for observables involved in the process of computation. Jpd's calculation is exponentially time consuming. Consequently, classical probabilistic algorithms involving calculation of jpd for n random variables can be over-performed by quantum algorithms (for big values of n). Quantum algorithms are based on quantum probability calculus. It is crucial that the latter modifies the classical formula of total probability (FTP). Probability inference based on the quantum version of FTP leads to constructive interference of probabilities increasing probabilities of some events. We also stress the role the basic feature of the genuine quantum superposition comparing with the classical wave superposition: generation of discrete events in measurements on superposition states. Finally, the problem of superiority of quantum computations is coupled with the quantum measurement problem and linearity of dynamics of the quantum state update.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2015

Factor Graphs for Quantum Probabilities

A factor-graph representation of quantum-mechanical probabilities (invol...
research
03/31/2021

Tossing Quantum Coins and Dice

The procedure of tossing quantum coins and dice is described. This case ...
research
06/07/2023

Quantum Distance Calculation for ε-Graph Construction

In machine learning and particularly in topological data analysis, ϵ-gra...
research
04/03/2019

On the classical complexity of quantum interference of indistinguishable bosons

The classical complexity of sampling from the probability distribution o...
research
10/23/2022

Google's Quantum Supremacy Claim: Data, Documentation, and Discussion

In October 2019, Nature published a paper describing an experiment that ...
research
09/06/2021

Analyzing XOR-Forrelation through stochastic calculus

In this note we present a simplified analysis of the quantum and classic...
research
05/01/2023

Questions and Concerns About Google's Quantum Supremacy Claim

In October 2019, Nature published a paper [6] describing an experimental...

Please sign up or login with your details

Forgot password? Click here to reset