Scrambling leads to entanglement cost in NLQC

Understand this faster with AI
Quantum Physics arXiv:2611.23378 (quant-ph) [Submitted on 17 Nov 2026] Title:Scrambling leads to entanglement cost in NLQC Authors:Atsuya Hasegawa, Alex May View a PDF of the paper titled Scrambling leads to entanglement cost in NLQC, by Atsuya Hasegawa and 1 other authors View PDF HTML (experimental) Abstract:In a non-local quantum computation (NLQC), shared entanglement along with a single simultaneous round of quantum communication is used to implement a joint channel. NLQC has many applications, most of which benefit from an understanding of lower bounds on the entanglement needed to implement a given channel as an NLQC. However, the properties of a channel that lead to it having an entanglement cost in NLQC have remained unclear, with most lower bounds only applying to specially constructed examples. Here, we give a new lower bound technique for unitaries based on scrambling: we find that a unitary has zero entanglement cost if and only if it does not scramble. Further, we find that the tripartite mutual information, an entropic object that quantifies the degree of scrambling, provides a quantitative lower bound on entanglement cost in NLQC. This is the first known lower bound on entanglement cost for unitaries in NLQC which is faithful. Our results also relate scrambling and NLQC for the first time. Leveraging the faithful scrambling based bound, we then show that the controllable correlation, an earlier studied quantity, is also a faithful lower bound, resolving an earlier conjecture of Cleve and May. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2611.23378 [quant-ph] (or arXiv:2611.23378v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.23378 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Alex May [view email] [v1] Tue, 17 Nov 2026 19:00:02 UTC (40 KB) Full-text links: Access Paper: View a PDF of the paper titled Scrambling leads to entanglement cost in NLQC, by Atsuya Hasegawa and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-11 References & Citations INSPIRE HEP SciXGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
