SearcharxivSearch

arXiv subjects

Michel Feldmann

Publications and source records attributed to Michel Feldmann.

6 recordsLinked to original sources

Information-theoretic interpretation of quantum formalism

We present an information-theoretic interpretation of quantum formalism based on a Bayesian framework and devoid of any extra axiom or principle. Quantum information is construed as a technique for analyzing a logical system subject to classical constraints, based on a question-and-answer procedure. The problem is posed from a particular batch of queries while the constraints are represented by the truth table of a set of Boolean functions. The Bayesian inference technique consists in assigning a probability distribution within a real-valued probability space to the joint set of queries in order to satisfy the constraints. The initial query batch is not unique and alternative batches can be considered at will. They are enabled mechanically from the initial batch, quite simply by transcribing the probability space into a Hilbert space. It turns out that this sole procedure leads to exactly recover the standard quantum information theory and thus provides an information-theoretic rationale to its technical rules. In this framework, the great challenges of quantum mechanics become simple platitudes: Why is the theory probabilistic? Why is the theory linear? Where does the Hilbert space come from? In addition, most of the paradoxes, such as uncertainty principle, entanglement, contextuality, nonsignaling correlation, measurement problem, etc., become straightforwards features. In the end, our major conclusion is that quantum information is nothing but classical information processed by a mature form of Bayesian inference technique and, as such, consubstantial with Aristotelian logic.

cs.IT

Solving satisfiability by Bayesian inference

We demonstrate that any logical problem can be solved by Bayesian inference. In this approach, the distinction between complexity classes vanishes. The method is illustrated by solving the 3-SAT problem in polynomial time. Beyond this, Bayesian inference could be the background of artificial neural network theory.

cs.CC

Polynomial time factoring algorithm using Bayesian arithmetic

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion that P = NP. Now, we implement this concept in elementary arithmetic and especially in multiplication. This provides a polynomial time deterministic factoring algorithm, while no such algorithm is known to day. This result clearly appeals for a revaluation of the current cryptosystems. The Bayesian arithmetic environment can also be regarded as a toy model for quantum mechanics.

cs.DS

Classical description of quantum randomness using stochastic gauge systems

We present a classical probability model appropriate to the description of quantum randomness. This tool, that we have called stochastic gauge system, constitutes a contextual scheme in which the Kolmogorov probability space depends upon the experimental setup, in accordance with quantum mechanics. Therefore, the probability space behaves like a gauge parameter. We discuss the technical issues of this theory and apply the concept to classically emulate quantum entangled states and even `super-quantum' systems. We exhibit bipartite examples leading to maximum violation of Bell-CHSH inequalities like EPR pairs or exceeding the Tsirelson bound like PR-boxes, as well as tripartite cases simulating GHZ or W-states. We address also the question of partially correlated systems and multipartite entanglements. In this model, the classical equivalent of the entanglement entropy is identified with the Kullback-Leibler divergence. Hence, we propose a natural generalisation of this function to multipartite systems, leading to a simple evaluation of the degree of entanglement and determining the bounds of maximum entanglement. Finally, we obtain a constructive necessary and sufficient condition of multipartite entanglement.

quant-ph

Classical counterexample to Bell's theorem

We describe a strictly classical dice game, which emulates the main features of the EPR experiment, including violation of Bell's inequalities. Therefore, the standard interpretation that Bell's theorem provides necessary conditions for `local realism' is disproved.

physics.gen-ph

New loophole for the EPR paradox

We exhibit a classical model free from any paradox which exactly simulates the spin EPR test. We conclude that Bell's inequality violation is a strictly classical phenomenon, contrary to a general belief.

quant-ph