English
Related papers

Related papers: Paraconsistent Foundations for Quantum Probability

200 papers

We define an index of compatibility for a probabilistic theory (PT). Quantum mechanics with index 0 and classical probability theory with index 1 are at the two extremes. In this way, quantum mechanics is at least as incompatible as any PT.…

Quantum Physics · Physics 2022-09-01 Stan Gudder

Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one…

Quantum Physics · Physics 2022-03-31 András Gilyén , Alexander Poremba

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

Probabilistic Quantum Memory (PQM) is a data structure that computes the distance from a binary input to all binary patterns stored in superposition on the memory. This data structure allows the development of heuristics to speed up…

In an empirical logic, an experimentally verifiable proposition P relating to a quantum system is assigned the value of either true of false if the system is in the pure state that belongs or, respectively, does not belong to the Hilbert…

Quantum Physics · Physics 2019-05-01 Arkady Bolotin

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

Logic · Mathematics 2013-12-17 Jesse Alama

The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…

Quantum Physics · Physics 2014-01-17 M. I. Dyakonov

Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…

Quantum Physics · Physics 2015-06-05 E. D. Vol

A system of quantum reasoning for a closed system is developed by treating non-relativistic quantum mechanics as a stochastic theory. The sample space corresponds to a decomposition, as a sum of orthogonal projectors, of the identity…

Quantum Physics · Physics 2009-10-30 Robert B. Griffiths

According to various no-go results in the foundations of quantum mechanics, for any system associated to a Hilbert space of dimension higher than two, it is not possible to assign definite truth values to all propositions pertaining to the…

Quantum Physics · Physics 2026-04-15 Vassilios Karakostas

In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear…

Mathematical Physics · Physics 2010-12-21 Gerd Niestegge

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Logic in Computer Science · Computer Science 2007-05-23 Jørgen Villadsen

We consider the quantum computational process as viewed by an insider observer: this is equivalent to an isomorphism between the quantum computer and a quantum space, namely the fuzzy sphere. The result is the formulation of a reversible…

Quantum Physics · Physics 2007-05-23 Paola A. Zizzi

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…

Quantum Physics · Physics 2007-06-13 M. I. Dyakonov

We consider probabilistic theories in which the most elementary system, a two-dimensional system, contains one bit of information. The bit is assumed to be contained in any complete set of mutually complementary measurements. The…

Quantum Physics · Physics 2009-07-10 Caslav Brukner , Anton Zeilinger

To perform reliable quantum computation, quantum error correction is indispensable. In certain cases, continuous covariance symmetry of the physical system can make exact error correction impossible. In this work we study the approximate…

Quantum Physics · Physics 2023-08-25 Hao Dai

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

Artificial Intelligence · Computer Science 2013-04-05 Enrique H. Ruspini

Quantum fidelity is one of the most important measures of similarity between mixed quantum states. However, the usual formulation is cumbersome and hard to understand when encountering the first time. This work shows in a novel, elegant…

Quantum Physics · Physics 2023-10-11 Adrian Müller

Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…

Quantum Physics · Physics 2009-11-07 M. A. Man'ko , V. I. Man'ko , R. Vilela Mendes

Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of…

Quantum Physics · Physics 2022-02-04 Seiseki Akibue , Go Kato , Seiichiro Tani