aiqbench analysis
This preprint offers a comprehensive book-length analysis of non-local quantum computation (NLQC), focusing on the entanglement costs required to perform operations between distant systems without direct interaction. By reviewing rigorous upper and lower bounds, the work connects fundamental NLQC principles to critical fields such as quantum cryptography, computational complexity, and communication complexity. This resource is essential for researchers investigating the theoretical limits of distributed quantum networks and their applications in gravity research.
Entanglement cost in non-local quantum computation
arXiv:2605.02840v2 Announce Type: replace 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.
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.
arXiv:2605.02840 [quant-ph]
(or arXiv:2605.02840v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2605.02840 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 190 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026

Cnrs Team Identifies Reductions Between Non-Local Computation Tasks for Complexity Analysis
Quantum Zeitgeist · Jul 21, 2026

Cisco’s Compiler now plans for quantum network limits
Quantum Zeitgeist · Oct 7, 2026

Reinforcement learning cuts gate count for 4-qubit states
Quantum Zeitgeist · Oct 17, 2026