most citedWhether a quantum computation employs nonlocal resources is operationally undecidable

1 citations · 2 across the 5 of their papers we have counts for

collaborators

5 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

Amplituhedra for generic quantum processes via the TQNN representation of UQC

Chris Fields, James F. Glazebrook, Antonino Marcianò +1

We study the relationship between computation and scattering both operationally (hence phenomenologically) and formally. We develop a representation of universal quantum computatio…

quant-ph2025★ 1 cited

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★ 1 cited

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…

hep-th2024

Communication protocols and QECC from the perspective of TQFT, Part II: QECCs as spacetimes

Chris Fields, James F. Glazebrook, Antonino Marciano

Topological quantum field theories (TQFTs) provide a general, minimal-assumption language for describing quantum-state preparation and measurement. They therefore provide a general…