PreprintCC BY 4.0arXiv
Entanglement cost in non-local quantum computation
Abstract
This is a book-length treatment of the subject of non-local quantum computation (NLQC). NLQC is a method for implementing quantum operations that interact two systems without directly bringing the systems together. Instead, a single round of communication and shared entanglement is used. NLQC has appeared in the context of quantum cryptography, computational complexity, communication complexity, quantum gravity, and other applications. The understanding of entanglement cost in NLQC is closely tied to questions in all of these areas. We review upper and lower bounds on entanglement cost, as well as some of the applications of NLQC and its connections to other subjects.
Related
- Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
- Quantum Networking at the Speed of Quantum Computation: Kilohertz Entanglement in a Heterogeneous Quantum System
- The Classical Boundary of Quantum Computation: History-Resolved Causal Stochastic Machines and the Cost of Classicalization
- Reducing the cost of ancilla purification for Majorana quantum computation
- Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes
BibTeX
@misc{may2026entanglement,
title = {{Entanglement cost in non-local quantum computation}},
author = {Alex May},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2605.02840},
eprint = {2605.02840},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.02840},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Entanglement cost in non-local quantum computation
AU - Alex May
PY - 2026
DA - 2026/09/15
PB - arXiv
DO - 10.48550/arxiv.2605.02840
UR - https://arxiv.org/abs/2605.02840
AB - This is a book-length treatment of the subject of non-local quantum computation (NLQC). NLQC is a method for implementing quantum operations that interact two systems without directly bringing the systems together. Instead, a single round of communication and shared entanglement is used. NLQC has appeared in the context of quantum cryptography, computational complexity, communication complexity, quantum gravity, and other applications. The understanding of entanglement cost in NLQC is closely tied to questions in all of these areas. We review upper and lower bounds on entanglement cost, as well as some of the applications of NLQC and its connections to other subjects.
ER -