3 papers
quant-ph2025
Operational protocols cannot certify classicality
Chris Fields, James F. Glazebrook, Antonino Marcianò +1
The existence and practical utility of operational protocols that certify entanglement raises the question of whether operational protocols exist that certify the absence of entang…
quant-ph2025
Whether a quantum computation employs nonlocal resources is operationally undecidable
Chris Fields, James F. Glazebrook, Antonino Marciano +1
Computational complexity characterizes the usage of spatial and temporal resources by computational processes. In the classical theory of computation, e.g. in the Turing Machine mo…
quant-ph2024
ER = EPR is an operational theorem
Chris Fields, James F. Glazebrook, Antonino Marciano +1
We show that in the operational setting of a two-agent, local operations, classical communication (LOCC) protocol, Alice and Bob cannot operationally distinguish monogamous entangl…