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 paper, we investigate the set of real symmetric matrices that are larger than a given Hermitian matrix in the semidefinite order, with particular attention to its minimal element. We explore the applications of this result in Gaussian quantum information processing. Furthermore, we propose potential research directions, especially the extension of this result to the set of real symmetric matrices that are larger than multiple given Hermitian matrices. These topics are of interest in both matrix theory and quantum information processing.
Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine learning kernels, and other advanced quantum algorithms. Existing state-of-the-art techniques, including Qubitization, Quantum Singular Value Transformation (QSVT), and Quantum Signal Processing (QSP), rely heavily on block-encoding the Hermitian matrix. These methods are often constrained by the complexity of preparing the block-encoded state, the overhead associated with the required ancillary qubits, or the challenging problem of angle synthesis for the polynomial's phase factors, which limits the achievable circuit depth and overall efficiency. In this work, we propose a novel and resource-efficient approach to implement arbitrary polynomials of a Hermitian matrix by leveraging the Generalized Quantum Signal Processing (GQSP) framework. Our method circumvents the need for block-encoding and avoids the compounding post-selection overheads characteristic of LCU-based constructions, achieving a stable, degree-independent success probability. We derive closed-form expressions for symmetric polynomial expansions and demonstrate how linear combinations of GQSP circuits can realize the desired transformation. This approach reduces resource overhead and opens new pathways for quantum algorithm design for functions of Hermitian matrices, particularly in settings where the Hermitian operator arises naturally from symmetric combinations of unitaries.
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U ( N ) (or O ( N )). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and orthostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.
We present further properties of a previously proposed recursive scheme for parametrization of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study the invariant phases of unitary matrices. The case of four-by-four unitary matrices is investigated in detail. We also address the question of how to construct symmetric unitary matrices (i.e., unitary matrices U that satisfy the condition Uij=Uji) using the recursive approach.