ExplorerQuantum ComputingQuantum Physics
Research PaperResearchia:202605.05035

Entanglement cost in non-local quantum computation

Alex May

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 ti...

Submitted: May 5, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

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.


Source: arXiv:2605.02840v1 - http://arxiv.org/abs/2605.02840v1 PDF: https://arxiv.org/pdf/2605.02840v1 Original Link: http://arxiv.org/abs/2605.02840v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
May 5, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark