Cover Image

Whether a quantum computation employs nonlocal resources is operationally undecidable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fields, Chris, Glazebrook, James F., Marciano, Antonino, Zappala, Emanuele
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal quantum computation in topological quantum neural networks and amplituhedron representation
by: Fields, Chris, et al.
Published: (2025)

ER = EPR is an operational theorem
by: Fields, Chris, et al.
Published: (2024)

Operational protocols cannot certify classicality
by: Fields, Chris, et al.
Published: (2025)

The membership problem for constant-sized quantum correlations is undecidable
by: Fu, Honghao, et al.
Published: (2021)

On the undecidability of quantum channel capacities
by: Bhattacharyya, Archishna, et al.
Published: (2026)

Communication protocols and QECCs from the perspective of TQFT, Part I: Constructing LOCC protocols and QECCs from TQFTs
by: Fields, Chris, et al.
Published: (2023)

Communication protocols and QECC from the perspective of TQFT, Part II: QECCs as spacetimes
by: Fields, Chris, et al.
Published: (2024)

Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)

Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete
by: Hutton, Kiera, et al.
Published: (2025)

Physical complexity and black hole quantum computers
by: Reilly, Michele, et al.
Published: (2025)

A full dichotomy for Holant$^c$, inspired by quantum computation
by: Backens, Miriam
Published: (2022)

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
by: Upreti, Varun, et al.
Published: (2025)

Improved separation between quantum and classical computers for sampling and functional tasks
by: Marshall, Simon C., et al.
Published: (2024)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
by: Sakamoto, Kazuki, et al.
Published: (2025)

Deep Neural Networks as the Semi-classical Limit of Topological Quantum Neural Networks: The problem of generalisation
by: Marciano, Antonino, et al.
Published: (2022)

Bounding the computational power of bosonic systems
by: Upreti, Varun, et al.
Published: (2025)

Quantum computational complexity of matrix functions
by: Cifuentes, Santiago, et al.
Published: (2024)

Quantum computation with indefinite causal structures
by: Araújo, Mateus, et al.
Published: (2017)

Robust and optimal loading of general classical data into quantum computers
by: Zhang, Xiao-Ming
Published: (2024)

Quasi-quantum states and the quasi-quantum PCP theorem
by: Arad, Itai, et al.
Published: (2024)

On the complexity of unique quantum witnesses and quantum approximate counting
by: Anshu, Anurag, et al.
Published: (2024)

Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
by: Anand, Kartik, et al.
Published: (2025)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
by: Liu, Zhenning, et al.
Published: (2024)

The NPA hierarchy does not always attain the commuting operator value
by: Fanizza, Marco, et al.
Published: (2025)

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States
by: Cade, Chris, et al.
Published: (2022)

Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture
by: Weggemans, Jordi, et al.
Published: (2023)

The computational two-way quantum capacity
by: Meyer, Johannes Jakob, et al.
Published: (2026)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
by: Iyer, Vishnu, et al.
Published: (2026)

The power of quantum circuits in sampling
by: Blanc, Guy, et al.
Published: (2025)

The 7 faces of quantum NP
by: Gharibian, Sevag
Published: (2023)

Improved quantum data analysis
by: Bădescu, Costin, et al.
Published: (2020)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Undecidability and incompleteness in quantum information theory and operator algebras
by: Goldbring, Isaac
Published: (2024)

Does there exist a quantum fingerprinting protocol without coherent measurements?
by: Hasegawa, Atsuya, et al.
Published: (2025)

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

Peaked quantum advantage using error correction
by: Deshpande, Abhinav, et al.
Published: (2025)

The status of the quantum PCP conjecture (games version)
by: Natarajan, Anand, et al.
Published: (2024)

Space-bounded quantum interactive proof systems
by: Gall, François Le, et al.
Published: (2024)

Even quantum advice is unlikely to solve PP
by: Yirka, Justin
Published: (2024)