Robust constraint satisfaction and local hidden variables in quantum mechanics

Authors:
Samson Abramsky;Georg Gottlob;Phokion G. Kolaitis
Affiliations:
Department of Computer Science, University of Oxford;Department of Computer Science, University of Oxford;University of California, Santa Cruz and IBM Research, Almaden
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 9
Cited 0

Correlation polytopes: their geometry and complexity

Mathematical Programming: Series A and B
From local to global consistency

Artificial Intelligence
Structure identification in relational data

Artificial Intelligence - Special volume on constraint-based reasoning
Synthesizing constraint expressions

Communications of the ACM
Constraint Processing

Constraint Processing
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Robust satisfiability of constraint satisfaction problems

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On minimal constraint networks

Artificial Intelligence
Relational Hidden Variables and Non-Locality

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by considerations in quantum mechanics, we introduce the class of robust constraint satisfaction problems in which the question is whether every partial assignment of a certain length can be extended to a solution, provided the partial assignment does not violate any of the constraints of the given instance. We explore the complexity of specific robust colorability and robust satisfiability problems, and show that they are NP-complete. We then use these results to establish the computational intractability of detecting local hidden-variable models in quantum mechanics.