Relational Hidden Variables and Non-Locality

Authors:
Samson Abramsky
Affiliations:
Department of Computer Science, University of Oxford, Oxford, U.K OX1 3QD
Venue:
Studia Logica
Year:
2013

Citing 6
Cited 2

Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Quantum computation and quantum information

Quantum computation and quantum information
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

On minimal constraint networks

Artificial Intelligence
Robust constraint satisfaction and local hidden variables in quantum mechanics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use a simple relational framework to develop the key notions and results on hidden variables and non-locality. The extensive literature on these topics in the foundations of quantum mechanics is couched in terms of probabilistic models, and properties such as locality and no-signalling are formulated probabilistically. We show that to a remarkable extent, the main structure of the theory, through the major No-Go theorems and beyond, survives intact under the replacement of probability distributions by mere relations.