Back to News
quantum-computing

The computational two-way quantum capacity

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
A team of six researchers introduced a new framework called computational two-way quantum capacity, which quantifies how much quantum information can be reliably transmitted when encoding and decoding are constrained to computationally efficient algorithms. The study reveals a direct link between this capacity and the computational distillable entanglement of a channel’s Choi state, providing a theoretical foundation to assess real-world quantum communication limits under practical computational constraints. Under standard cryptographic assumptions, the authors prove that some polynomial-complexity quantum channels can have vanishing computational capacity despite nearly maximal unbounded capacity, exposing a stark divide between theoretical and practical performance. The research identifies a sharp threshold: when channel complexity exceeds polynomial bounds, computational quantum capacity collapses from near-maximal to zero, demonstrating how efficiency constraints reshape communication possibilities. These findings challenge traditional quantum information theory by showing that computational limits—not just physical laws—can fundamentally restrict quantum communication, with implications for cryptography, complexity theory, and future quantum networks.
The computational two-way quantum capacity

Summarize this article with:

Quantum Physics arXiv:2601.15393 (quant-ph) [Submitted on 21 Jan 2026] Title:The computational two-way quantum capacity Authors:Johannes Jakob Meyer, Jacopo Rizzo, Asad Raza, Lorenzo Leone, Sofiene Jerbi, Jens Eisert View a PDF of the paper titled The computational two-way quantum capacity, by Johannes Jakob Meyer and 5 other authors View PDF HTML (experimental) Abstract:Quantum channel capacities are fundamental to quantum information theory. Their definition, however, does not limit the computational resources of sender and receiver. In this work, we initiate the study of computational quantum capacities. These quantify how much information can be reliably transmitted when imposing the natural requirement that en- and decoding have to be computationally efficient. We focus on the computational two-way quantum capacity and showcase that it is closely related to the computational distillable entanglement of the Choi state of the channel. This connection allows us to show a stark computational capacity separation. Under standard cryptographic assumptions, there exists a quantum channel of polynomial complexity whose computational two-way quantum capacity vanishes while its unbounded counterpart is nearly maximal. More so, we show that there exists a sharp transition in computational quantum capacity from nearly maximal to zero when the channel complexity leaves the polynomial realm. Our results demonstrate that the natural requirement of computational efficiency can radically alter the limits of quantum communication. Comments: Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Cryptography and Security (cs.CR); Information Theory (cs.IT) Cite as: arXiv:2601.15393 [quant-ph] (or arXiv:2601.15393v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.15393 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Johannes Jakob Meyer [view email] [v1] Wed, 21 Jan 2026 19:04:07 UTC (99 KB) Full-text links: Access Paper: View a PDF of the paper titled The computational two-way quantum capacity, by Johannes Jakob Meyer and 5 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-01 Change to browse by: cs cs.CC cs.CR cs.IT math math.IT References & Citations INSPIRE HEP NASA ADSGoogle 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?) Links to Code Toggle Papers with Code (What is Papers with Code?) 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?)

Read Original

Tags

government-funding
quantum-communication
quantum-networking

Source Information

Source: arXiv Quantum Physics