English
Related papers

Related papers: Atomic Entailment and Atomic Inconsistency and Cla…

200 papers

The claim that there is an inconsistency of quantum-classical dynamics [1] is investigated. We point out that a consistent formulation of quantum and classical dynamics which can be used to describe quantum measurement processes is already…

Quantum Physics · Physics 2007-05-23 E. C. G. Sudarshan

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…

Logic · Mathematics 2016-01-13 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…

Quantum Physics · Physics 2009-11-11 Caterina Mora , Hans Briegel

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

It is a fundamental problem how the universal concept of classical chaos emerges from the microscopic description of quantum mechanics. We here study standard classical chaos in a framework of quantum mechanics. In particular, we design a…

Quantum Physics · Physics 2023-09-26 Taiki Haga , Shin-ichi Sasa

We discuss the problem of the separation of total correlations in a given quantum state into entanglement, dissonance, and classical correlations using the concept of relative entropy as a distance measure of correlations. This allows us to…

Quantum Physics · Physics 2010-03-03 Kavan Modi , Tomasz Paterek , Wonmin Son , Vlatko Vedral , Mark Williamson

Motivated by recent discussions of entanglement in the context of high energy scattering, we consider the relation between the entanglement entropy of a highly excited state of a quantum system and the classical entanglement entropy of the…

Quantum Physics · Physics 2023-01-18 Haowu Duan , Alex Kovner , Vladimir V. Skokov

We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives…

Logic in Computer Science · Computer Science 2012-08-28 Erich Grädel , Jouko Väänänen

In the initial stages of its development, atomic theory had to bypass the laws of classical electromagnetism in an ad hoc manner in order to explain the stability of atoms. In quantum mechanics, however, the classical theory may find again…

Popular Physics · Physics 2021-07-01 Costas J. Papachristou

In this review we discuss intriguing properties of apparently classical optical fields, that go beyond purely classical context and allow us to speak about quantum characteristics of such fields and about their applications in quantum…

Quantum Physics · Physics 2019-05-22 Natalia Korolkova , Gerd Leuchs

Non-classical probability (along with its underlying logic) is a defining feature of quantum mechanics. A formulation that incorporates them, inherently and directly, would promise a unified description of seemingly different prescriptions…

Quantum Physics · Physics 2019-05-21 Soumik Adhikary , Sooryansh Asthana , V. Ravishankar

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 introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…

Logic in Computer Science · Computer Science 2014-01-17 Yi Zhou , Yan Zhang

The concept of determinism for a classical system is interpreted as the requirement that the solution to the Cauchy problem for the equations of motion governing this system be unique. This requirement is generally assumed to hold for all…

High Energy Physics - Theory · Physics 2008-11-26 Boris Kosyakov

We argue that entanglement is the essential non-classical ingredient which provides the computational speed-up in quantum algorithms as compared to algorithms based on the processes of classical physics.

Quantum Physics · Physics 2007-05-23 Richard Jozsa

For systems consisting of distinguishable particles, there exists an agreed upon notion of entanglement which is fundamentally based on the possibility of addressing individually each one of the constituent parties. Instead, the…

Quantum Physics · Physics 2020-09-24 F. Benatti , R. Floreanini , F. Franchini , U. Marzolino

We provide an interpretation of entanglement based on classical correlations between measurement outcomes of complementary properties: states that have correlations beyond a certain threshold are entangled. The reverse is not true, however.…

Quantum Physics · Physics 2015-05-26 Lorenzo Maccone , Dagmar Bruss , Chiara Macchiavello

Various topics concerning the entanglement of composite quantum systems are considered with particular emphasis concerning the strict relations of such a problem with the one of attributing objective properties to the constituents. Most of…

Quantum Physics · Physics 2007-05-23 Giancarlo Ghirardi , Luca Marinatto , Tullio Weber

Given an arbitrary statistical theory, different from quantum mechanics, how to decide which are the nonclassical correlations? We present a formal framework which allows for a definition of nonclassical correlations in such theories,…

Quantum Physics · Physics 2016-11-26 F. Holik , C. Massri , A. Plastino

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko