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.
In this chapter, we discuss several information measures that are important for quantifying the amount of information and correlations that are present in quantum systems. The first fundamental measure that we introduce is the von Neumann entropy (or simply quantum entropy ). It is the quantum generalization of the Shannon entropy, but it captures both classical and quantum uncertainty in a quantum state.1 The quantum entropy gives meaning to the notion of an information qubit . This notion is different from that of the physical qubit, which is the description of a quantum state of an electron or a photon. The information qubit is the fundamental quantum informational unit of measure, determining how much quantum information is present in a quantum system. The initial definitions here are analogous to the classical definitions of entropy, but we soon discover a radical departure from the intuitive classical notions from the previous chapter: the conditional quantum entropy can be negative for certain quantum states. In the classical world, this negativity simply does not occur, but it takes on a special meaning in quantum information theory. Pure quantum states that are entangled have stronger-than-classical correlations and are examples of states that have negative conditional entropy. The negative of the conditional quantum entropy is so important in quantum information theory that we even have a special name for it: the coherent information. We discover that the coherent information obeys a quantum data-processing inequality, placing it on a firm footing as a particular informational measure of quantum correlations. We then define several other quantum information measures, such as quantum mutual information, that bear similar definitions as in the classical world, but with Shannon entropies replaced with quantum entropies. This replacement may seem to make quantum entropy somewhat trivial on the surface, but a simple calculation reveals that a maximally entangled state on two qubits registers two bits of quantum mutual information (recall that the largest the mutual information can be in the classical world is one bit for the case of two maximally correlated bits). We then discuss several entropy inequalities that play an important role in quantum information processing: the monotonicity of quantum relative entropy, strong subadditivity, the quantum data-processing inequalities, and continuity of quantum entropy.
This chapter marks the beginning of our study of the asymptotic theory of quantum information, where we develop the technical tools underpinning this theory. The intuition for it is similar to the intuition we developed in the previous chapter on typical sequences, but we will find some important differences between the classical and quantum cases. So far, there is not a single known information-processing task in quantum Shannon theory where the tools from this chapter are not helpful in proving the achievability part of a coding theorem. For the most part, we can straight-forwardly import many of the ideas from the previous chapter about typical sequences for use in the asymptotic theory of quantum information. Though, one might initially think that there are some obstacles to doing so. For example, what is the analogy of a quantum information source? Once we have established this notion, how would we determine if a state emitted from a quantum information source is a typical state? In the classical case, a simple way of determining typicality is to inspect all of the bits in the sequence. But there is a problem with this approach in the quantum domain—“looking at quantum bits” is equivalent to performing a measurement and doing so destroys delicate superpositions that we would want to preserve in any subsequent quantum information-processing task. So how can we get around the aforementioned problem and construct a useful notion of quantum typicality? Well, we should not be so destructive in determining the answer to a question when it has only two possible answers.
Quantum information science addresses how the processing and transmission of information are affected by uniquely quantum mechanical phenomena. Combination of two-qubit gates has been used to realize quantum circuits, however, scalability is becoming a critical problem. The use of three-qubit gates may simplify the structure of quantum circuits dramatically. Among them, the controlled-SWAP (Fredkin) gates are essential since they can be directly applied to important protocols, e.g., error correction, fingerprinting, and optimal cloning. Here we report a realization of the Fredkin gate for photonic qubits. We achieve a fidelity of 0.85 in the computational basis and an output state fidelity of 0.81 for a 3-photon Greenberger-Horne-Zeilinger state. The estimated process fidelity of 0.77 indicates that our Fredkin gate can be applied to various quantum tasks.
The entanglement quantification and classification of multipartite quantum states are two important research fields in quantum information. In this work, we study the entanglement of arbitrary-dimensional multipartite pure states by looking at the averaged partial entropies of various bipartite partitions of the system, namely, the so-called Manhattan distance (
l1 norm) of averaged partial entropies (MAPE), and it is proved to be an entanglement measure for pure states. We connected the MAPE with the coefficient matrices, which are important tools in entanglement classification and reexpressed the MAPE for arbitrary-dimensional multipartite pure states by the nonzero singular values of the coefficient matrices. The entanglement properties of the
n-qubit Dicke states, arbitrary-dimensional Greenberger-Horne-Zeilinger states, and
D3n states are investigated in terms of the MAPE, and the relation between the rank of the coefficient matrix and the degree of entanglement is demonstrated for symmetric states by two examples.