Several techniques of generating random quantum channels, which act on the set of d-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show that they are mathematically equivalent. We discuss under which conditions they give the uniform Lebesgue measure on the convex set of quantum operations and compare their advantages and computational complexity and demonstrate which of them is particularly suitable for numerical investigations. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states. We compute the mean values of several quantities characterizing a given quantum channel, including its unitarity, the average output purity, and the 2-norm coherence of a channel, averaged over the entire set of the quantum channels with respect to the uniform measure. An ensemble of classical stochastic matrices obtained due to super-decoherence of random quantum stochastic maps is analyzed, and their spectral properties are studied using the Bloch representation of a classical probability vector.
Several techniques of generating random quantum channels, which act on the set of d-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show that they are mathematically equivalent. We discuss under which conditions they give the uniform Lebesgue measure on the convex set of quantum operations and compare their advantages and computational complexity and demonstrate which of them is particularly suitable for numerical investigations. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states. We compute the mean values of several quantities characterizing a given quantum channel, including its unitarity, the average output purity, and the 2-norm coherence of a channel, averaged over the entire set of the quantum channels with respect to the uniform measure. An ensemble of classical stochastic matrices obtained due to super-decoherence of random quantum stochastic maps is analyzed, and their spectral properties are studied using the Bloch representation of a classical probability vector.
The simplest building blocks for quantum computations are the qubit-qubit quantum channels. In this paper, we analyze the structure of these channels via their Choi representation. The restriction of a quantum channel to the space of classical states (i.e. probability distributions) is called the underlying classical channel. The structure of quantum channels over a fixed classical channel is studied, the volume of the general and unital qubit channels with respect to the Lebesgue measure is computed and explicit formulas are presented for the distribution of the volume of quantum channels over given classical channels. We study the state transformation under uniformly random quantum channels. If one applies a uniformly random quantum channel (general or unital) to a given qubit state, the distribution of the resulted quantum states is presented.
The Bloch representation of an n-qubit channel provides a way to represent quantum channels as certain affine transformations on [special characters omitted]. In higher dimensions (n > 1), the correspondence between quantum channels and their Bloch representations is not well-understood. Partly motivated by the ability to simplify the calculation of information theoretic quantities of a qubit channel using the Bloch representation, in this thesis we investigate the correspondence between a channel and its Bloch representation with an emphasis on unital n-qubit channels, in which case the Bloch representation is linear. The thesis is divided into three main sections. First we focus our attention on qubit channels. For certain sets of quantum channels, we establish the surprising existence of a special isomorphism into the set of classical channels. We classify the sets of qubit channels with this property and show that information theoretic quantities are preserved by such classical representations. In a natural progression, we prove some well-known facts about SO(3), the proofs of which are either nonexistent or difficult to find in the literature. Some of this work is based on [12, 13]. In the next section, we consider the multi-qubit channels and show that every finite group can be realized as a subgroup of the quantum channels; this approach allows for the construction of a quantum representation for the free affine monoid over any finite group and gives a classical representation for it. We extend some fundamental results from [26, 28] to the multi-qubit case, including that the set of diagonal Bloch matrices is equal to the free affine monoid over the involution group [special characters omitted]. Some of this work appeared in [10]. Lastly, we study the extreme points for the set of n-qubit channels. There are two types of extreme points: invertible and non-invertible; invertible channels are non-singular maps for which the inverse is also a channel. We briefly study the non-invertible extreme points and then parameterize and analyze the invertiblen-qubit Bloch matrices, which form a compact connected Lie group. We calculate the Lie algebra and give an explicit generating set for the invertible Bloch matrices and a maximal torus.
Given a preferred orthonormal basis B in the Hilbert space of a quantum system, we define a measure of the coherence-generating power of a unitary operation with respect to B. This measure is the average coherence generated by the operation acting on a uniform ensemble of incoherent states. We give its explicit analytical form in any dimension and provide an operational protocol to directly detect it. We characterize the set of unitaries with maximal coherence-generating power and study the properties of our measure when the unitary is drawn at random from the Haar distribution. For a large state-space dimension a random unitary has, with overwhelming probability, nearly maximal coherence-generating power with respect to any basis. Finally, extensions to general unital quantum operations and the relation to the concept of asymmetry are discussed.
This dissertation is concerned with a variety of problems in quantum computing and the spectral theory of quantum-mechanical channels and Hamiltonians. We begin with the problem of quantum gate synthesis. The challenge is to find a fixed, finite set S of quantum gates such that, given a quantum circuit component U acting on n qubits and target precision ε, there is a short, efficiently computable composition of gates from S that approximates U to precision ε. This problem has already led to a rich literature in the case n=1 with deep connections to modern number theory. In this dissertation we present the state-of-the-art algorithm for a single qubit, achieving length 7 log (1/ε). The techniques used include the lattice structure of certain dense subgroups of PU(2) and Lenstra's algorithm for integer programming in convex domains. The next topic considered is scientific computing algorithms intended to run on a quantum computer. Specifically, we study a framework for computing functions of normal matrices using a quantum computer, with the objective of controlling the ancilla overhead, probability of success, and end precision. This arises as a special case of the multivariate quantum eigenvalue transform, for computing function of multiple commuting Hermitian matrices. The techniques applied include approximation of regular functions by low-degree polynomials and modern quantum primitives like quantum signal processing and linear combinations of unitaries. The third component is a spectral gap comparison result for Davies generators, a class of Lindbladians used for Gibbs state preparation and which are a well-studied example of quantum Markov dynamics, and which contain a canonical classical Markov chain. The main result shows that if the spectrum of the Hamiltonian driving the dynamics is free of long arithmetic progressions, then the spectral gaps of the quantum and classical Markov chains are comparable. Thus, classical techniques may be leveraged to control the behavior of the quantum dynamics. The proof is based on transferring any "off-diagonal" eigenvector of the Davies generator to an observable which commutes with the Hamiltonian and has a comparable Lindbladian Rayleigh quotient. Finally, we study the infimum of the spectrum, or ground state energy, of a discrete Schrödinger operator on the scaled integer grid in n dimensions, parameterized by a nonnegative potential V and a small frequency parameter θ. We relate this ground state energy to that of a corresponding continuous semiclassical Schrödinger operator on the full n-dimensional space with parameter θ, arising from the same choice of potential, and show that these quantities are equal up to vanishing factors depending on the regularity of V. The proofs are elementary and rely on sampling and interpolation to map low-energy functions for the discrete operator on the scaled grid to low-energy functions for the continuous operator on the full space, and vice versa. Coauthors on these works were J. Basso, T. R. Blackman, Y. Borns-Weil, I. Detherage, S. Ganguly, N. Srivastava, T. Saffat, A. Sinclair, and T.-D. Vuong.
The classical randomization criterion is an important result of statistical decision theory. Recently, a quantum analogue has been proposed, giving equivalent conditions for two sets of quantum states, ensuring existence of a quantum channel mapping one set close to the other, in L1-distance. In the present paper, we extend these concepts in several ways. First, sets of states are replaced by channels and randomization is performed by either post- or pre-composition with another channel. The L1-distance is replaced by the diamond norm. Secondly, the maps are not required to be completely positive, but positivity is given by an admissible family of convex cones. It is shown that the randomization theorems, generalizing both quantum and classical randomization criteria, can be proved in the framework of base section norms, including the diamond norm and its dual. The theory of such norms is developed in the Appendix.
A quantum ensemble ${({p}_{x},{\ensuremath{\rho}}_{x})}$ is a set of quantum states each occurring randomly with a given probability. Quantum ensembles are necessary to describe situations with incomplete a priori information, such as the output of a stochastic quantum channel (generalized measurement), and play a central role in quantum communication. In this paper, we propose measures of distance and fidelity between two quantum ensembles. We consider two approaches: the first one is based on the ability to mimic one ensemble given the other one as a resource and is closely related to the Monge-Kantorovich optimal transportation problem, while the second one uses the idea of extended-Hilbert-space (EHS) representations which introduce auxiliary pointer (or flag) states. Both types of measures enjoy a number of desirable properties. The Kantorovich measures, albeit monotonic under deterministic quantum operations, are not monotonic under generalized measurements. In contrast, the EHS measures are. This property can be regarded as a generalization of the monotonicity under deterministic maps of the trace distance and the fidelity between states. The EHS measures are equivalent to convex optimization problems and are bounded by the Kantorovich measures which are equivalent to linear programs. We present operational interpretations for both types of measures. We also show that the EHS fidelity between ensembles provides an interpretation of the fidelity between mixed states as the fidelity between all pure-state ensembles whose averages are equal to the mixed states being compared. We finally use the measures to define distance and fidelity for stochastic quantum channels and positive operator-valued measures. These quantities may be useful in the context of tomography of stochastic quantum channels and quantum detectors.