Related papers: Quantum Democracy Is Possible
Arrow's Theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or…
It often goes unnoticed that, even for a finite number of degrees of freedom, the canonical commutation relations have many inequivalent irreducible unitary representations; the free particle and a particle in a box provide examples that…
We prove that there exists a nonprincipal ultrafilter $\mathcal U$ on $\mathbb N$ such that for every countable (or separable) structure $B$ in a countable language the quotient map from the reduced product associated with the Fr\'echet…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
Quantum theory is extremely successful in explaining most physical phenomena, and is not contradicted by any experiment. Yet, the theory has many puzzling features : the occurrence of probabilities, the unclear distinction between the…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
We conjecture that appropriate K-theoretic Gromov-Witten invariants of complex flag manifolds G/B are governed by finite-difference versions of Toda systems constructed in terms of the Langlands-dual quantized universal enveloping algebras…
Quantum Field Theory (QFT) represents a vast generalization of Quantum Mechanics (QM), as it deals with systems that have an infinite number of degrees of freedom. The Stone-von Neumann theorem, which establishes the equivalence of…
We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature $(\lor,\perp,0,1)$, where `$\perp$' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable:…
This article shows that one can consistently incorporate nonunitary representations of at least one group into the ``ordinary'' nonrelativistic quantum mechanics. This group turns out to be Lorentz group thus giving us an alternative…
Quantum Mechanics is a good example of a successful theory. Most of atomic phenomena are described well by quantum mechanics and cases such as Lamb Shift that are not described by quantum mechanics, are described by quantum electrodynamics.…
It is shown that neither the wave picture nor the ordinary particle picture offers a satisfactory explanation of the double-slit experiment. The Physicists who have been successful in formulating theories in the Newtonian Paradigm with its…
Is quantum mechanics about 'states'? Or is it basically another kind of probability theory? It is argued that the elementary formalism of quantum mechanics operates as a well-justified alternative to 'classical' instantiations of a…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…
Quantum bits can be isolated to perform useful information-theoretic tasks, even though physical systems are fundamentally described by very high-dimensional operator algebras. This is because qubits can be consistently embedded into…
One of the essential building blocks of classical computer programs is the "if" clause, which executes a subroutine depending on the value of a control variable. Similarly, several quantum algorithms rely on applying a unitary operation…
We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming…
Despite its enormous empirical success, the formalism of quantum theory still raises fundamental questions: why is nature described in terms of complex Hilbert spaces, and what modifications of it could we reasonably expect to find in some…
Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…