Quantum information theory is the study of the achievable limits of information processing within quantum mechanics. Many different types of information can be accommodated within quantum mechanics, including classical information, coherent quantum information, and entanglement. Exploring the rich variety of capabilities allowed by these types of information is the subject of quantum information theory, and of this Dissertation. In particular, I demonstrate several novel limits to the information processing ability of quantum mechanics. Results of especial interest include: the demonstration of limitations to the class of measurements which may be performed in quantum mechanics; a capacity theorem giving achievable limits to the transmission of classical information through a two-way noiseless quantum channel; resource bounds on distributed quantum computation; a new proof of the quantum noiseless channel coding theorem; an information-theoretic characterization of the conditions under which quantum error-correction may be achieved; an analysis of the thermodynamic limits to quantum error-correction, and new bounds on channel capacity for noisy quantum channels.
Quantum information theory is the study of the achievable limits of information processing within quantum mechanics. Many different types of information can be accommodated within quantum mechanics, including classical information, coherent quantum information, and entanglement. Exploring the rich variety of capabilities allowed by these types of information is the subject of quantum information theory, and of this Dissertation. In particular, I demonstrate several novel limits to the information processing ability of quantum mechanics. Results of especial interest include: the demonstration of limitations to the class of measurements which may be performed in quantum mechanics; a capacity theorem giving achievable limits to the transmission of classical information through a two-way noiseless quantum channel; resource bounds on distributed quantum computation; a new proof of the quantum noiseless channel coding theorem; an information-theoretic characterization of the conditions under which quantum error-correction may be achieved; an analysis of the thermodynamic limits to quantum error-correction, and new bounds on channel capacity for noisy quantum channels.
Abstract This book deals with the basic concept of information, its importance, and the similarities and differences between classical and quantum information. First, classical information theory and its application to communication are discussed. Quantum mechanics and communication based on the laws of quantum mechanics are then considered. Quantum entanglement, a key resource in quantum communication, is analysed both from the fundamental perspective and from the perspective of its information-processing capability. This book also introduces quantum computation (in the context of the search and factorisation algorithms) and the basics of quantum error correction. Throughout this book, the connections between information theory, thermodynamics, and (quantum) physics are emphasised and discussed. Other topics covered in the book are data compression, related measures of information such as relative entropy, joint entropy, conditional entropy, and mutual information, along with the capacity of a noisy channel.
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.
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.
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.
In this thesis I present a short review of ideas in quantum information theory. The first chapter contains introductory material, sketching the central ideas of probability and information theory. Quantum mechanics is presented at the level of advanced undergraduate knowledge, together with some useful tools for quantum mechanics of open systems. In the second chapter I outline how classical information is represented in quantum systems and what this means for agents trying to extract information from these systems. The final chapter presents a new resource: quantum information. This resource has some bewildering applications which have been discovered in the last ten years, and continually presents us with unexpected insights into quantum theory and the universe. The treatment is pedagogical and suitable for beginning graduates in the field.
This dissertation investigates how structural properties of information-processing systems govern their performance in communication and learning tasks. In the first part, we develop new tools in coding and information theory. We study channel comparison problems and introduce a quantitative refinement of the classical notion of \emph{more capable} channels, termed \emph{more capable with advantage}. We prove tensorization properties, characterize the comparison between the binary symmetric channel (BSC) and binary erasure channel (BEC), and apply the framework to obtain new list-decoding guarantees and improved lower bounds on the entropy rate of binary hidden Markov processes. Then, we investigate the relationship between worst-case and random-noise properties of error-correcting codes. In particular, we establish new connections between minimum distance, list-decoding radius, weight distributions, and performance on symmetric channels. Our results extend recent characterizations of the interplay between list decoding capacity and channel capacity from linear codes to arbitrary codes, and provide improved bounds for linear codes through the analysis of erasure-channel behavior and Samorodnitsky's inequalities. The second part of the dissertation examines analogous questions in learning theory through the lens of neural networks. We study the learnability of high-degree parity functions, a classical benchmark for understanding the computational limits of learning algorithms. We show that for gradient descent on regular neural networks, learnability depends critically on the initial distribution of the parameters. While discrete Rademacher initialization enables efficient learning of almost-full parities, sufficiently large Gaussian perturbations prevent learning. These results reveal a sharp dependence of optimization dynamics on initialization. The analysis introduces gradient-alignment (GAL), a loss-dependent measure, that quantifies how the choice of initialization could affects the learnability of a target function. Taken together, the results of this dissertation demonstrate that quantitative structural information—whether encoded in channel orderings, code weight distributions, or neural-network initializations—can fundamentally determine the boundary between success and failure in information processing tasks.