Abstract Quantum information science is a new and rapidly developing discipline that studies the general laws governing the transmission, storage, and processing of information in systems that obey the laws of quantum mechanics. It makes extensive use of matrix theory and operator theory on Hilbert spaces to investigate the capabilities of such systems and to develop principles for their rational design. An important consequence of the development of quantum information science is a substantial clarification of the logical structure and foundations of quantum mechanics and of its relation to reality. These lectures are devoted to the foundations of the mathematical theory of quantum systems: states, observables, communication channels, their entropic and information characteristics, and quantum information-processing protocols. The lectures provide a detailed introduction to the statistical structure of quantum theory and the necessary background from classical information theory; hence, knowledge of the basic mathematical subjects—analysis, linear algebra, and probability theory—is sufficient for understanding the material. In the first part of the course, we use the “standard” statistical model of a quantum system, but consider it in comparison with the classical statistical description. A consistent development of this approach leads to a generalized statistical model of quantum mechanics, in which observables (in general, “unsharp”) are described by probability operator-valued measures, while evolutions (in general, irreversible) are described by completely positive maps. Introductory material on these concepts, which underlie mathematical models of quantum information systems in the presence of noise and errors and have numerous applications in quantum information science, is presented in the second part of the course.
In this dissertation, we present several matrix-related problems and results motivated by quantum information theory. Some background material of quantum information science will be discussed in chapter 1, while chapter 7 gives a summary of results and concluding remarks. In chapter 2, we look at
2n×2n unitary matrices, which describe operations on a closed
n-qubit system. We define a set of simple quantum gates, called controlled single qubit gates, and their associated operational cost. We then present a recurrence scheme to decompose a general
2n×2n unitary matrix to the product of no more than
2n−1(2n−1) single qubit gates with small number of controls. In chapter 3, we address the problem of finding a specific element
Φ among a given set of quantum channels
S that will produce the optimal value of a scalar function
D(ρ1,Φ(ρ2)), on two fixed quantum states
ρ1 and
ρ2. Some of the functions we considered for
D(⋅,⋅) are the trace distance, quantum fidelity and quantum relative entropy. We discuss the optimal solution when
S is the set of unitary quantum channels, the set of mixed unitary channels, the set of unital quantum channels, and the set of all quantum channels. In chapter 4, we focus on the spectral properties of qubit-qudit bipartite states with a maximally mixed qudit subsystem. More specifically, given positive numbers
a1≥…≥a2n≥0, we want to determine if there exist a
2n×2n density matrix
ρ having eigenvalues
a1,…,a2n and satisfying $\tr_1(\rho)=\frac{1}{n}I_n$. This problem is a special case of the more general quantum marginal problem. We give the minimal necessary and sufficient conditions on
a1,…,a2n for
n≤6 and state some observations on general values of
n. In chapter 5, we discuss the numerical method of alternating projections and illustrate its usefulness in: (a) constructing a quantum channel, if it exists, such that
Φ(ρ(1))=σ(1),…,Φ(ρ(k))=σ(k) for given
ρ(1),…,ρ(k)∈Dn and
σ(1),…,σ(k)∈Dm, (b) constructing a multipartite state
ρ having a prescribed set of reduced states
ρ1,…,ρr on
r of its subsystems, (c) constructing a multipartite state
ρ having prescribed reduced states and additional properties such as having prescribed eigenvalues, prescribed rank or low von Neuman entropy; and (d) determining if a square matrix
A can be written as a product of two positive semidefinite contractions. In chapter 6, we examine the shape of the Minkowski product of convex subsets
K1 and
K2 of $\IC$ given by
K1K2={ab:a∈K1,b∈K2}, which has applications in the study of the product numerical range and quantum error-correction. In \citep{Karol}, it was conjectured that
K1K2 is star-shaped when
K1 and
K2 are convex. We give counterexamples to show that this conjecture does not hold in general but we show that the set
K1K2 is star-shaped if
K1 is a line segment or a circular disk.
This largely self-contained book on the theory of quantum information focuses on precise mathematical formulations and proofs of fundamental facts that form the foundation of the subject. It is intended for graduate students and researchers in mathematics, computer science, and theoretical physics seeking to develop a thorough understanding of key results, proof techniques, and methodologies that are relevant to a wide range of research topics within the theory of quantum information and computation. The book is accessible to readers with an understanding of basic mathematics, including linear algebra, mathematical analysis, and probability theory. An introductory chapter summarizes these necessary mathematical prerequisites, and starting from this foundation, the book includes clear and complete proofs of all results it presents. Each subsequent chapter includes challenging exercises intended to help readers to develop their own skills for discovering proofs concerning the theory of quantum information.
Quantum computation and information is one of the most exciting developments in science and technology of the last twenty years. To achieve large scale quantum computers and communication networks it is essential not only to overcome noise in stored quantum information, but also in general faulty quantum operations. Scalable quantum computers require a far-reaching theory of fault-tolerant quantum computation. This comprehensive text, written by leading experts in the field, focuses on quantum error correction and thoroughly covers the theory as well as experimental and practical issues. The book is not limited to a single approach, but reviews many different methods to control quantum errors, including topological codes, dynamical decoupling and decoherence-free subspaces. Basic subjects as well as advanced theory and a survey of topics from cutting-edge research make this book invaluable both as a pedagogical introduction at the graduate level and as a reference for experts in quantum information science.
Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.