Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information and Computation

A resource-based view of quantum information

C. H. Bennett

Published Dec 1, 2004• 3 citations
Publisher

Abstract

We survey progress in understanding quantum information in terms of equivalences, reducibilities, and asymptotically achievable rates for transformations among nonlocal resources such as classical communication, entanglement, and particular quantum states or channels. In some areas, eg source coding, there are straightforward parallels to classical information theory; in others eg entanglement-assisted communication, new effects and tradeoffs appear that are beginning to be fairly well understood, or the remaining uncertainty has become focussed on a few simple open questions, such as conjectured additivity of the Holevo capacity. In still other areas, e.g. the role of the back communication and the classification of tripartite entanglement, much remains unknown, and it appears unlikely that an adequate description exists in terms of a finite number of resources.

DOI
10.26421/qic4.6-7-5

Related papers

Outlook

Vlatko Vedral

Abstract This book has discussed the foundations of quantum information science as well as the relationship between physics and information theory in general. It has considered the quantum equivalents of the Shannon coding and channel capacity theorems. The von Neumann entropy plays a role analogous to the Shannon entropy, and the Holevo bound is the analogue of Shannon's mutual information used to quantify the capacity of a classical channel. Quantum systems can process information more efficiently than classical systems in a number of different ways. Quantum teleportation and quantum dense coding can be performed using quantum entanglement. Entanglement is an excess of correlations that can exist in quantum physics and is impossible to reproduce classically (with what is termed “separable” states). The book has also demonstrated how to discriminate entangled from separable states using entanglement witnesses, as well as how to quantify entanglement, and looked at quantum computation and quantum algorithms.

Oxford University Press eBooks•Sep 28, 2006•0 citations

Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory

Chengkai Zhu, Ziao Tang, Guocheng Zhen +6 more

Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction. Formalizing its coding theorems requires connecting finite-block protocols, analytic inequalities, and asymptotic limits within a unified machine-checked framework. Existing developments, however, lack a reusable operational layer that defines codes, error criteria, achievable rates, and capacities independently of their information-theoretic characterizations. In this work, we present LeanQIT, a Lean 4 library for finite-dimensional QIT. It provides composable, kernel-checked interfaces for quantum states and channels, source and channel codes, finite-block performance criteria, hypothesis testing, one-shot quantities, and asymptotic rate constructions. Using this infrastructure, we formalize Schumacher's quantum source-coding theorem, the Holevo--Schumacher--Westmoreland classical-capacity theorem, and the entanglement-assisted classical-capacity theorem together with its strong converse. By separating operational definitions from analytic characterizations and exposing reusable achievability, converse, and asymptotic components, Lean-QIT provides a machine-readable foundation for formal QIT and a compositional knowledge substrate for emerging AI-assisted formalization, automated proof search, and agentic reasoning in quantum information and computation.

quant-pharXiv:2607.09632•Jul 13, 2026•10 citations

FUTURE DIRECTIONS FOR QUANTUM INFORMATION THEORY

Charles H. Bennett

Classical information and computation theory are now naturally viewed as a subset of a more comprehensive theory concerned with the transmission and processing of intact quantum states. The new theory is broadly concerned with the possible transformations of quantum states into one another, often in a multiparty setting, where part of a possibly entangled quantum system is held by each of several observers. Many open questions remain concerning the kind and quantity of resources—including classical messages, shared entanglement, noiseless or noisy quantum communications channels, and (perhaps most fundamentally) direct physical interaction between the parties—that can be used to perform these transformations, and the extent to which various combinations of resources can be substituted for one another.

WORLD SCIENTIFIC eBooks•Oct 1, 1998•1 citation

Entanglement in prepare-and-measure scenarios: many questions, a few answers

Jef Pauwels, Armin Tavakoli, Erik Woodhead +1 more

Abstract Entanglement and quantum communication are paradigmatic resources in quantum information science leading to correlations between systems that have no classical analogue. Correlations due to entanglement when communication is absent have for long been studied in Bell scenarios. Correlations due to quantum communication when entanglement is absent have been studied extensively in prepare-and-measure (PM) scenarios in the last decade. Here, we set out to understand and investigate correlations in scenarios that involve both entanglement and communication, focussing on entanglement-assisted (EA) PM scenarios. In a recent companion paper (arXiv: 2103.10748 ), we investigated correlations based on unrestricted entanglement. Here, our focus is on scenarios with restricted entanglement. We establish several elementary relations between standard classical and quantum communication and their EA counterparts. In particular, while it was already known that bits or qubits assisted by two-qubit entanglement between the sender and receiver constitute a stronger resource than bare bits or qubits, we show that higher-dimensional entanglement further enhance the power of bits or qubits. We also provide a characterisation of generalised dense coding protocols, a natural subset of EA quantum communication protocols, finding that they can be understood as standard quantum communication protocols in real-valued Hilbert space. Though such dense coding protocols can convey up to two bits of information, we provide evidence, perhaps counter-intuitively, that resources with a small information capacity, such as a bare qutrits, can sometimes produce stronger correlations. Along the way we leave several conjectures and conclude with a list of interesting open problems.

arXiv:2108.00442•New Journal of Physics•May 23, 2022•32 citations

QUANTUM INFORMATION AND ITS PROPERTIES

Richard Jozsa

We provide a general introduction to the concept of quantum information, discussing its relation to quantum measurement theory and properties of entanglement. We give an account of some of its basic features, notably quantum dense coding, quantum teleportation and the compression of quantum information. We include an explanation of the formalism of density matrices and the concept of von Neumann entropy, which play a fundamental role in much of quantum information theory.

WORLD SCIENTIFIC eBooks•Oct 1, 1998•22 citations

Semidefinite optimization for quantum information

Xin Wang

This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.

•Jan 1, 2018•7 citations
We survey progress in understanding quantum information in terms of equivalences, reducibilities, and asymptotically achievable rates for transformations among nonlocal resources such as classical communication, entanglement, and particular quantum states or channels. In some areas, eg source coding, there are straightforward parallels to classical information theory; in others eg entanglement-assisted communication, new effects and tradeoffs appear that are beginning to be fairly well understood, or the remaining uncertainty has become focussed on a few simple open questions, such as conjectured additivity of the Holevo capacity. In still other areas, e.g. the role of the back communication and the classification of tripartite entanglement, much remains unknown, and it appears unlikely that an adequate description exists in terms of a finite number of resources.
Abstract This book has discussed the foundations of quantum information science as well as the relationship between physics and information theory in general. It has considered the quantum equivalents of the Shannon coding and channel capacity theorems. The von Neumann entropy plays a role analogous to the Shannon entropy, and the Holevo bound is the analogue of Shannon's mutual information used to quantify the capacity of a classical channel. Quantum systems can process information more efficiently than classical systems in a number of different ways. Quantum teleportation and quantum dense coding can be performed using quantum entanglement. Entanglement is an excess of correlations that can exist in quantum physics and is impossible to reproduce classically (with what is termed “separable” states). The book has also demonstrated how to discriminate entangled from separable states using entanglement witnesses, as well as how to quantify entanglement, and looked at quantum computation and quantum algorithms.
Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction. Formalizing its coding theorems requires connecting finite-block protocols, analytic inequalities, and asymptotic limits within a unified machine-checked framework. Existing developments, however, lack a reusable operational layer that defines codes, error criteria, achievable rates, and capacities independently of their information-theoretic characterizations. In this work, we present LeanQIT, a Lean 4 library for finite-dimensional QIT. It provides composable, kernel-checked interfaces for quantum states and channels, source and channel codes, finite-block performance criteria, hypothesis testing, one-shot quantities, and asymptotic rate constructions. Using this infrastructure, we formalize Schumacher's quantum source-coding theorem, the Holevo--Schumacher--Westmoreland classical-capacity theorem, and the entanglement-assisted classical-capacity theorem together with its strong converse. By separating operational definitions from analytic characterizations and exposing reusable achievability, converse, and asymptotic components, Lean-QIT provides a machine-readable foundation for formal QIT and a compositional knowledge substrate for emerging AI-assisted formalization, automated proof search, and agentic reasoning in quantum information and computation.
Classical information and computation theory are now naturally viewed as a subset of a more comprehensive theory concerned with the transmission and processing of intact quantum states. The new theory is broadly concerned with the possible transformations of quantum states into one another, often in a multiparty setting, where part of a possibly entangled quantum system is held by each of several observers. Many open questions remain concerning the kind and quantity of resources—including classical messages, shared entanglement, noiseless or noisy quantum communications channels, and (perhaps most fundamentally) direct physical interaction between the parties—that can be used to perform these transformations, and the extent to which various combinations of resources can be substituted for one another.
Abstract Entanglement and quantum communication are paradigmatic resources in quantum information science leading to correlations between systems that have no classical analogue. Correlations due to entanglement when communication is absent have for long been studied in Bell scenarios. Correlations due to quantum communication when entanglement is absent have been studied extensively in prepare-and-measure (PM) scenarios in the last decade. Here, we set out to understand and investigate correlations in scenarios that involve both entanglement and communication, focussing on entanglement-assisted (EA) PM scenarios. In a recent companion paper (arXiv: 2103.10748 ), we investigated correlations based on unrestricted entanglement. Here, our focus is on scenarios with restricted entanglement. We establish several elementary relations between standard classical and quantum communication and their EA counterparts. In particular, while it was already known that bits or qubits assisted by two-qubit entanglement between the sender and receiver constitute a stronger resource than bare bits or qubits, we show that higher-dimensional entanglement further enhance the power of bits or qubits. We also provide a characterisation of generalised dense coding protocols, a natural subset of EA quantum communication protocols, finding that they can be understood as standard quantum communication protocols in real-valued Hilbert space. Though such dense coding protocols can convey up to two bits of information, we provide evidence, perhaps counter-intuitively, that resources with a small information capacity, such as a bare qutrits, can sometimes produce stronger correlations. Along the way we leave several conjectures and conclude with a list of interesting open problems.
This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.