Related papers: Quantum Democracy Is Possible
Notwithstanding it is well known that von Neumann's projection postulate is inapplicable to most realistic measurement procedures, it keeps haunting the foundations of quantum mechanics. In particular its applicability to EPR experiments is…
It is shown that in two-state quantum theory, a generic quantum state can be described by a non-computable real number. In terms of this, the criterion for measurement outcome is simply and deterministically defined. This demonstration is…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…
Due to the existence of incompatible observables, the propositional calculus of a quantum system does not form a Boolean algebra but an orthomodular lattice. Such lattice can be realised as a lattice of subspaces on a real, complex or…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
Linearity allows several versions of reality to simultaneously exist in the state vector. But it implies that there is no interaction between versions, and that there will never be perception of more than one version. It also implies, in…
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…
Quantum theory implies, and empirical evidence confirms, that while particles $\textit{can}$ exhibit wave-like behavior in interferometric experiments, this behavior is so limited as $\textit{not}$ to allow for third- and higher-order…
In a quantum world, reference frames are ultimately quantum systems too -- but what does it mean to "jump into the perspective of a quantum particle"? In this work, we show that quantum reference frame (QRF) transformations appear naturally…
Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under…
Quantum theory demands that, in contrast to classical physics, not all properties can be simultaneously well defined. The Heisenberg Uncertainty Principle is a manifestation of this fact. Another important corollary arises that there can be…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…
Several finite dimensional quasi-probability representations of quantum states have been proposed to study various problems in quantum information theory and quantum foundations. These representations are often defined only on restricted…
At the onset of quantum mechanics, it was argued that the new theory would entail a rejection of classical logic. The main arguments to support this claim come from the non-commutativity of quantum observables, which allegedly would…
In simple -- but selected -- quantum systems, the probability distribution determined by the ground state wave function is infinitely divisible. Like all simple quantum systems, the Euclidean temporal extension leads to a system that…
The failure of distributivity in quantum logic is motivated by the principle of quantum superposition. However, this principle can be encoded differently, i.e., in different logico-algebraic objects. As a result, the logic of experimental…
Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic…
The Alberti-Uhlmann criterion states that any given qubit dichotomy can be transformed into any other given qubit dichotomy by a quantum channel if and only if the testing region of the former dichotomy includes the testing region of the…
A new attempt is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the modern standard point…