Quantum logic is undecidable

Archive for Mathematical Logic 60 (3):329-341 (2020)
  Copy   BIBTEX

Abstract

We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature \\), where ‘\’ is the orthogonality relation. Our main result is that already its quasi-identities are undecidable: there is no algorithm to decide whether an implication between equations and orthogonality relations implies another equation. This is a corollary of a recent result of Slofstra in combinatorial group theory. It follows upon reinterpreting that result in terms of the hypergraph approach to quantum contextuality, for which it constitutes a proof of the inverse sandwich conjecture. It can also be interpreted as stating that a certain quantum satisfiability problem is undecidable.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-09-12

Downloads
16 (#905,992)

6 months
3 (#1,208,233)

Historical graph of downloads
How can I increase my downloads?