On the computational complexity of detecting possibilistic locality

DOI10.1093/LOGCOM/EXX045zbMath1444.81007arXiv1609.05550OpenAlexW2521448234MaRDI QIDQ4684357

Andrew Simmons

Publication date: 28 September 2018

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.05550

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

How (Maximally) Contextual Is Quantum Mechanics?

This page was built for publication: On the computational complexity of detecting possibilistic locality