Searcharxiv⌕ Search

arXiv subjects

Chi-Kwong Li

Publications and source records attributed to Chi-Kwong Li.

At least 37 records · Page 2Linked to original sources

A note on Majorana representation of quantum states

By the Majorana representation, for any $d > 1$ there is a one-one correspondence between a quantum state of dimension $d$ and $d-1$ qubits represented as $d-1$ points in the Bloch sphere. Using the theory of symmetry class of tensors, we present a simple scheme for constructing $d-1$ points on the Bloch sphere and the corresponding $d-1$ qubits representing a $d$-dimensional quantum state. Additionally, we demonstrate how the inner product of two $d$-dimensional quantum states can be expressed as a permanent of a matrix related to their $(d-1)$-qubit state representations. Extension of the result to mixed states is also considered.

quant-ph↗

On semidefinite programming characterizations of the numerical radius and its dual norm

We state and give self contained proofs of semidefinite programming characterizations of the numerical radius and its dual norm for matrices. We show that the computation of the numerical radius and its dual norm within $\varepsilon$ precision are polynomially time computable in the data and $|\log \varepsilon |$ using either the ellipsoid method or the short step, primal interior point method. We apply our results to give a simple formula for the spectral and nuclear norm of $2\times n\times m$ real tensor in terms of the numerical radius and its dual norm.

math.NA↗

Linear maps preserving parallel matrix pairs with respect to the Ky-Fan $k$-norm

Two bounded linear operators $A$ and $B$ are parallel with respect to a norm $\|\cdot\|$ if $\|A+μB\| = \|A\| + \|B\|$ for some scalar $μ$ with $|μ| = 1$. Characterization is obtained for bijective linear maps sending parallel bounded linear operators to parallel bounded linear operators with respect to the Ky-Fan $k$-norms.

math.FA↗

Numerical ranges of cyclic shift matrices

We study the numerical range of an $n\times n$ cyclic shift matrix, which can be viewed as the adjacency matrix of a directed cycle with $n$ weighted arcs. In particular, we consider the change in the numerical range if the weights are rearranged or perturbed. In addition to obtaining some general results on the problem, a permutation of the given weights is identified such that the corresponding matrix yields the largest numerical range (in terms of set inclusion), for $n \le 6$. We conjecture that the maximizing pattern extends to general $n\times n$ cylic shift matrices. For $n \le 5$, we also determine permutations such that the corresponding cyclic shift matrix yields the smallest numerical range.

math.CO↗

On unital qubit channels

A canonical form for unital qubit channels under local unitary transforms is obtained. In particular, it is shown that the eigenvalues of the Choi matrix of a unital quantum channel form a complete set of invariants of the canonical form. It follows immediately that every unital qubit channel is the average of four unitary channels. More generally, a unital qubit channel can be expressed as the convex combination of unitary channels with convex coefficients $p_1, \dots, p_m$ as long as $2(p_1, \dots, p_m)$ is majorized by the vector of eigenvalues of the Choi matrix of the channel. A unital qubit channel in the canonical form will transform the Bloch sphere onto an ellipsoid. We look into the detailed structure of the natural linear maps sending the Bloch sphere onto a corresponding ellipsoid.

quant-ph↗

Nonsurjective zero product preservers between matrix spaces over an arbitrary field

A map $Φ$ between matrices is said to be zero product preserving if $$ Φ(A)Φ(B) = 0 \quad \text{whenever}\quad AB = 0. $$ In this paper, we give concrete descriptions of an additive/linear zero product preserver $Φ: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ between matrix algebras of different dimensions over an arbitrary field $\mathbb{F}$. In particular, we show that if $Φ$ is linear and preserves zero products then $$ Φ(A)= S\begin{pmatrix} R_1 \otimes A & 0 \cr 0 & Φ_0(A)\end{pmatrix} S^{-1}, $$ for some invertible matrices $R_1$ in ${\bf M}_k(\mathbb{F})$, $S$ in ${\bf M}_r(\mathbb{F})$ and a zero product preserving linear map $Φ_0: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_{r-nk}(\mathbb{F})$ into nilpotent matrices. If $Φ(I_n)$ is invertible, then $Φ_0$ is vacuous. In general, the structure of $Φ_0$ could be quite arbitrary, especially when $Φ_0({\bf M}_n(\mathbb{F}))$ has trivial multiplication, i.e., $Φ_0(X)Φ_0(Y) = 0$ for all $X, Y$ in ${\bf M}_n(\mathbb{F})$. We show that if $Φ_0(I_n) = 0$ or $r-nk \le n+1$, then $Φ_0({\bf M}_n(\mathbb{F}))$ indeed has trivial multiplication. More generally, we characterize subspaces ${\bf V}$ of square matrices satisfying $XY = 0$ for any $X, Y \in {\bf V}$. Similar results for double zero product preserving maps are obtained.

math.RA↗

Quantum Error Correction Scheme for Fully Correlated Noise

This paper investigates quantum error correction schemes for fully-correlated noise channels on an $n$-qubit system, where error operators take the form $W^{\otimes n}$, with $W$ being an arbitrary $2\times 2$ unitary operator. In previous literature, a recursive quantum error correction scheme can be used to protect $k$ qubits using $(k+1)$-qubit ancilla. We implement this scheme on 3-qubit and 5-qubit channels using the IBM quantum computers, where we uncover an error in the previous paper related to the decomposition of the encoding/decoding operator into elementary quantum gates. Here, we present a modified encoding/decoding operator that can be efficiently decomposed into (a) standard gates available in the \texttt{qiskit} library and (b) basic gates comprised of single-qubit gates and CNOT gates. Since IBM quantum computers perform relatively better with fewer basic gates, a more efficient decomposition gives more accurate results. Our experiments highlight the importance of an efficient decomposition for the encoding/decoding operators and demonstrate the effectiveness of our proposed schemes in correcting quantum errors. Furthermore, we explore a special type of channel with error operators of the form $σ_x^{\otimes n}, σ_y^{\otimes n}$ and $σ_z^{\otimes n}$, where $σ_x, σ_y, σ_z$ are the Pauli matrices. For these channels, we implement a hybrid quantum error correction scheme that protects both quantum and classical information using IBM's quantum computers. We conduct experiments for $n = 3, 4, 5$ and show significant improvements compared to recent work.

quant-ph↗

Linear maps preserving matrices annihilated by a fixed polynomial

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $Φ: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed polynomial $f(x) = (x-a_1)\cdots (x-a_m)$ with $m\ge 2$ distinct zeroes $a_1, a_2, \ldots, a_m \in \mathbb{F}$; namely, $$ f(Φ(A)) = 0\quad\text{whenever} \quad f(A) = 0. $$ Suppose that $f(0)=0$, and the zero set $Z(f) =\{a_1, \dots, a_m\}$ is not an additive group. Then $Φ$ assumes the form \begin{align}\label{eq:standard} A \mapsto S\begin{pmatrix} A \otimes D_1 &&\cr & A^{T} \otimes D_2& \cr && 0_s\cr\end{pmatrix}S^{-1}, \tag{$\dagger$} \end{align} for some invertible matrix $S\in {\bf M}_r(\mathbb{F})$, invertible diagonal matrices $D_1\in {\bf M}_p(\mathbb{F})$ and $D_2\in {\bf M}_q(\mathbb{F})$, where $s=r-np-nq\geq 0$. The diagonal entries $λ$ in $D_1$ and $D_2$, as well as $0$ in the zero matrix $0_s$, are zero multipliers of $f(x)$ in the sense that $λZ(f) \subseteq Z(f)$. In general, assume that $Z(f) - a_1$ is not an additive group. If $Φ(I_n)$ commutes with $Φ(A)$ for all $A\in {\bf M}_n(\mathbb{F})$, or if $f(x)$ has a unique zero multiplier $λ=1$, then $Φ$ assumes the form \eqref{eq:standard}. The above assertions follow from the special case when $f(x) = x(x-1)=x^2-x$, for which the problem reduces to the study of linear idempotent preservers. It is shown that a linear map $Φ: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ sending disjoint rank one idempotents to disjoint idempotents always assume the above form \eqref{eq:standard} with $D_1=I_p$ and $D_2=I_q$, unless ${\bf M}_n(\mathbb{F}) = {\bf M}_2(\mathbb{Z}_2)$.

math.FA↗

The $C$-numerical range and Unitary dilations

For an $n\times n$ complex matrix $C$, the $C$-numerical range of a bounded linear operator $T$ acting on a Hilbert space of dimension at least $n$ is the set of complex numbers ${\rm tr}(CX^*TX)$, where $X$ is a partial isometry satisfying $X^*X = I_n$. It is shown that $${\bf cl}(W_C(T)) = \cap \{{\bf cl}(W_C(U)): U \hbox{ is a unitary dilation of } T\}$$ for any contraction $T$ if and only if $C$ is a rank one normal matrix.

math.FA↗

The joint $k$-numerical range of operators

Let ${\mathcal B}({\mathcal H})$ be the algebra of all bounded linear operators on the Hilbert space ${\mathcal H}$. For a positive integer $k$ less than the dimension of ${\mathcal H}$ and ${\mathbf A} = (A_1, \dots, A_m)\in {\mathcal B}({\mathcal H})^m$, the joint $k$-numerical range $W_k({\mathbf A})$ is the set of vector $(α_1, \dots, α_m) \in{\mathbb C}^m$ such that $α_i = \sum_{j = 1}^k \langle A_ix_j, x_j\rangle$ for an orthonormal set $\{x_1, \ldots, x_k\}$ in ${\mathcal H}$. Geometrical properties of $W_k({\mathbf A})$ and their relations with the algebraic properties of $\{A_1, \dots, A_m\}$ are investigated in this paper. For example, conditions for $W_k({\mathbf A})$ to be convex are studied. Descriptions are given for the closure of $W_k({\mathbf A})$ and the closure of ${\rm conv}\, W_k({\mathbf A})$ in terms of the joint essential numerical range of ${\mathbf A}$ for infinite dimensional operators $A_1, \dots, A_m$. Characterizations are obtained for $W_k({\mathbf A})$ or ${\rm conv}\, W_k({\mathbf A})$ to be closed. It is shown that $W_k({\mathbf A})$ is a polyhedral set if and only if $A_1, \dots, A_k$ have a common reducing subspace ${\mathbf V}$ of finite dimension such that the compression of $A_1, \dots, A_m$ on the subspace ${\mathbf V}$ are diagonal operators $D_1, \dots, D_m$ and $W_k({\mathbf A}) = W_k(D_1, \dots, D_m)$. Similar results are obtained for ${\bf A}$ such that the closure of $W_k({\mathbf A})$ is polyhedral. Classifications are given for operators satisfying (1) $\{A_1, \dots, A_m\}$ is a commuting family of normal operators, or (2) $W_k(A_1, \dots, A_m)$ is polyhedral for every positive integer $k$ less than $\dim {\mathcal H}$.

math.FA↗

Commuting normal operators and joint numerical range

Let ${\mathcal H}$ be a complex Hilbert space and let ${\mathcal B}({\mathcal H})$ be the algebra of all bounded linear operators on ${\mathcal H}$. For a positive integer $k$ less than the dimension of ${\mathcal H}$ and ${\mathbf A} = (A_1, \dots, A_m)\in {\mathcal B}({\mathcal H})^m$, the joint $k$-numerical range $W_k({\mathbf A})$ is the set of $(α_1, \dots, α_m) \in{\mathbb C}^m$ such that $α_i = \sum_{j = 1}^k \langle A_ix_j, x_j\rangle$ for an orthonormal set $\{x_1, \ldots, x_k\}$ in ${\mathcal H}$. Relations between the geometric properties of $W_k({\mathbf A})$ and the algebraic and analytic properties of $A_1, \dots, A_m$ are studied. It is shown that there is $k\in {\mathbb N}$ such that $W_k({\mathbf A})$ is a polyhedral set, i.e., the convex hull of a finite set, if and only if $A_1, \dots, A_k$ have a common reducing subspace ${\mathbf V}$ of finite dimension such that the compression of $A_1, \dots, A_m$ on the subspace ${\mathbf V}$ are diagonal operators $D_1, \dots, D_m$ and $W_k({\mathbf A}) = W_k(D_1, \dots, D_m)$. Characterization is also given to ${\bf A}$ such that the closure of $W_k({\mathbf A})$ is polyhedral. The conditions are related to the joint essential numerical range of ${\mathbf A}$. These results are used to study ${\bf A}$ such that (a) $\{A_1, \dots, A_m\}$ is a commuting family of normal operators, or (b) $W_k(A_1, \dots, A_m)$ is polyhedral for every positive integer $k$. It is shown that conditions (a) and (b) are equivalent for finite rank operators but it is no longer true for compact operators. Characterizations are given for compact operators $A_1, \dots, A_m$ satisfying (a) and (b), respectively. Results are also obtained for general non-compact operators.

math.FA↗

Unitarily invariant Norms on Operators

Let $f$ be a symmetric norm on ${\mathbb R}^n$ and let ${\mathcal B}({\mathcal H})$ be the set of all bounded linear operators on a Hilbert space ${\mathcal H}$ of dimension at least $n$. Define a norm on ${\mathcal B}({\mathcal H})$ by $\|A\|_f = f(s_1(A), \dots, s_n(A))$, where $s_k(A) = \inf\{\|A-X\|: X\in {\mathcal B}({\mathcal H}) \hbox{ has rank less than } k\}$ is the $k$th singular value of $A$. Basic properties of the norm $\|\cdot\|_f$ are obtained including some norm inequalities and characterization of the equality case. Geometric properties of the unit ball of the norm are obtained; the results are used to determine the structure of maps $L$ satisfying $\|L(A)-L(B)\|_f=\|A - B\|_f$ for any $A, B \in {\mathcal B}({\mathcal H})$.

math.FA↗

Coherence measures induced by norm functions

Which matrix norms induce proper measures for quantifying quantum coherence? We study this problem for two important classes of norms and show that (i) coherence measures cannot be induced by any unitary similarity invariant norm, and (ii) the $\ell_{q,p}$-norm induces a coherence measure if and only if $q=1$ and $1 \leq p \leq 2$, thus giving a new class of coherence measures with simple closed forms that are easy to compute. These results extend and unify previously known facts about norm-induced coherence measures, and lead to a broader framework for understanding what functionals can be coherence measures.

quant-ph↗

Construction of quantum states with special properties by projection methods

We use projection methods to construct (global) quantum states with prescribed reduced (marginal) states, and possibly with some special properties such as having specific eigenvalues, having specific rank and extreme von Neumann or Renyi entropy. Using convex analysis, optimization techniques on matrix manifolds, we obtain algorithms to solve the problem. Matlab programs are written based on these algorithms and numerical examples are illustrated. The numerical results reveal new patterns leading to new insights and research problems on the topic.

quant-ph↗

On the mixed-unitary rank of quantum channels

In the theory of quantum information, the mixed-unitary quantum channels, for any positive integer dimension $n$, are those linear maps that can be expressed as a convex combination of conjugations by $n\times n$ complex unitary matrices. We consider the mixed-unitary rank of any such channel, which is the minimum number of distinct unitary conjugations required for an expression of this form. We identify several new relationships between the mixed-unitary rank~$N$ and the Choi rank~$r$ of mixed-unitary channels, the Choi rank being equal to the minimum number of nonzero terms required for a Kraus representation of that channel. Most notably, we prove that the inequality $N\leq r^2-r+1$ is satisfied for every mixed-unitary channel (as is the equality $N=2$ when $r=2$), and we exhibit the first known examples of mixed-unitary channels for which $N>r$. Specifically, we prove that there exist mixed-unitary channels having Choi rank $d+1$ and mixed-unitary rank $2d$ for infinitely many positive integers $d$, including every prime power $d$. We also examine the mixed-unitary ranks of the mixed-unitary Werner--Holevo channels.

quant-ph↗

Error correction schemes for fully correlated quantum channels protecting both quantum and classical information

We study efficient quantum error correction schemes for the fully correlated channel on an $n$-qubit system with error operators that assume the form $σ_x^{\otimes n}$, $σ_y^{\otimes n}$, $σ_z^{\otimes n}$. Previous schemes are improved to facilitate implementation. In particular, when $n$ is odd and equals $2k+1$, we describe a quantum error correction scheme using one arbitrary qubit $σ$ to protect the data state $ρ$ in a $2k$-qubit system. The encoding operation $σ\otimes ρ\mapsto Φ(σ\otimes ρ)$ only requires $3k$ CNOT gates (each with one control bit and one target bit). After the encoded state $Φ(σ\otimes ρ)$ goes through the channel, we can apply the inverse operation $Φ^{-1}$ to produce $\tilde σ\otimes ρ$ so that a partial trace operation can recover $ρ$. When $n$ is even and equals $2k+2$, we describe a hybrid quantum error correction scheme using any one of the two classical bits $σ\in \{|ij\rangle \langle ij|: i, j \in \{0,1\}\}$ to protect a $2k$-qubit state $ρ$ and 2 classical bits. The encoding operation $σ\otimes ρ\mapsto Φ(σ\otimes ρ)$ can be done by $3k+2$ CNOT gates and a single quibt Hadamard gate. After the encoded state $Φ(σ\otimes ρ)$ goes through the channel, we can apply the inverse operation $Φ^{-1}$ to produce $σ\otimes ρ$ so that a perfect protection of the two classical bits $σ$ and the $2k$-qubit state is achieved. If one uses an arbitrary $2$-qubit state $σ$, the same scheme will protect $2k$-qubit states. The scheme was implemented using Matlab, Mathematica, Python, and the IBM's quantum computing framework qiskit.

quant-ph↗

A Note on Parallel Distinguishability of two Quantum Operations

We consider a homogeneous system of linear equations of the form $A_α^{\otimes N} {\bf x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_α$ depends on a real parameter $α$. It was conjectured by Duan et al. that the system has a non-trivial nonnegative solution if and only if $α$ lies in a certain interval $R_N$ depending on $N$. We affirm the necessity part of the conjecture and establish the sufficiency of the conjecture for $N\leq 10$ by presenting explicit non-trivial nonnegative solutions for the linear system.

quant-ph↗