arXiv subjects

Nung-Sing Sze

Publications and source records attributed to Nung-Sing Sze.

At least 19 recordsLinked to original sources

arXiv2026

The dimension and Bose distance of some BCH codes of length $\frac{q^{m}-1}λ$

BCH codes are important error correction codes, widely utilized due to their robust algebraic structure, multi-error correcting capability, and efficient decoding algorithms. Despite their practical importance and extensive study, their parameters, including dimension, minimum distance and Bose distance, remain largely unknown in general. This paper addresses this challenge by investigating the dimension and Bose distance of BCH codes of length $(q^m - 1)/λ$ over the finite field $\mathbb{F}_q$, where $λ$ is a positive divisor of $q - 1$. Specifically, for narrow-sense BCH codes of this length with $m \geq 4$, we derive explicit formulas for their dimension for designed distance $2 \leq δ\leq (q^{\lfloor (2m - 1)/3 \rfloor + 1} - 1)/λ + 1$. We also provide explicit formulas for their Bose distance in the range $2 \leq δ\leq (q^{\lfloor (2m - 1)/3 \rfloor + 1} - 1)/λ$. These ranges for $δ$ are notably larger than the previously known results for this class of BCH codes. Furthermore, we extend these findings to determine the dimension and Bose distance for certain non-narrow-sense BCH codes of the same length. Several optimal linear codes can be obtained from these BCH codes.

cs.IT↗

arXiv2026

Cliques and independent subgroups of the Birkhoff polytope graph

The Birkhoff polytope $Ω_n$ is the polytope of doubly stochastic matrices of order $n$. The Birkhoff polytope graph $G(Ω_n)$ is the skeleton of $Ω_n$; it is the Cayley graph whose vertex set consists of the elements of the symmetric group ${\rm Sym}(n)$ of degree $n$, where two permutations are adjacent if one equals the product of the other with a cycle. We study the combinatorial structure of this graph, focusing on its maximal and maximum cliques and on its independent subgroups (subgroups of ${\rm Sym}(n)$ whose elements are pairwise nonadjacent in the graph). We obtain maximal subgroups of $G(Ω_n)$ and establish both a lower bound and an upper bound for its clique number. Especially, we prove that if $K$ is a subset of ${\rm Sym}(n)$ consisting of 3-cycle permutations such that $δ_1^{-1}δ_2$ is a single cycle for all $δ_1,δ_2\in K$, then the maximum size of $K$ is $\lfloor (n-1)^2/4\rfloor$, which can be viewed as an Erdős-Ko-Rado-type theorem for ${\rm Sym}(n)$.

math.CO↗

arXiv2025

The dimension and Bose distance of certain primitive BCH codes

BCH codes are a significant class of cyclic codes that play an important role in both theoretical research and practical applications. Their strong error-correcting abilities and efficient encoding and decoding methods make BCH codes widely applicable in various areas, including communication systems, data storage devices, and consumer electronics. Although BCH codes have been extensively studied, the parameters of BCH codes are not known in general. Let $q$ be a prime power and $m$ be a positive integer. Denote by $\mathcal{C}_{\left(q,m,δ)\right)}$ the narrow-sense primitive BCH code with length $q^m-1$ and designed distance $δ$. As of now, the dimensions of $\mathcal{C}_{(q,m,δ)}$ are fully understood only for $m \leq 2$. For $m \geq 4$, the dimensions of $\mathcal{C}_{(q,m,δ)}$ are known only for the range $2 \leq δ\leq q^{\lfloor (m+1)/2 \rfloor +1}$ and for a limited number of special cases. In this paper, we determined the dimension and Bose distance of $\mathcal{C}_{(q,m,δ)}$ for $m\geq 4$ and $δ\in [2, q^{\lfloor ( 2m-1)/{3}\rfloor+1}]. $ Additionally, we have also extended our results to some primitive BCH codes that are not necessarily narrow-sense.

cs.IT↗

arXiv2024

Characterizations of Strongly Entanglement Breaking channels for infinite-dimensional quantum systems

Entanglement breaking (EB) channels, as completely positive and trace-preserving linear operators, sever the entanglement between the input system and other systems. In the realm of infinite-dimensional systems, a related concept known as strongly entanglement breaking (SEB) channels emerges. This paper delves into characterizations of SEB channels, delineating necessary and sufficient conditions for a channel to be classified as SEB, especially with respect to the commutativity of its range. Moreover, we demonstrate that every closed self-adjoint subspace of trace-zero operators, with the trace norm, is the null space of a SEB channel.

math.FA↗

arXiv2024

Criteria of absolutely separability from spectrum for qudit-qudits states

Separability from the spectrum is a significant and ongoing research topic in quantum entanglement. In this study, we investigate properties related to absolute separability from the spectrum in qudits-qudits states in the bipartite states space $\mathcal{H}_{mn}=\mathcal{H}_m \otimes \mathcal{H}_n$. Firstly, we propose the necessary and sufficient conditions for absolute separable states in the Hilbert space $\mathcal{H}_{4n}$. These conditions are equivalent to the positive semidefiniteness of twelve matrices resulting from the symmetric matricizations of eigenvalues. Furthermore, we demonstrate that this sufficient condition can be extended to the general $\mathcal{H}_{mn}$ case, improving existing conclusions in the literature. These sufficient conditions depend only on the first few leading and last few leading eigenvalues, significantly reducing the complexity of determining absolute separable states. On the other hand, we also introduce additional sufficient conditions for determining that states in $\mathcal{H}_{mn}$ are not absolutely separable. These conditions only depend on $2m-1$ eigenvalues of the mixed states. Our sufficient conditions are not only simple and easy to implement. As applications, we derive distance bounds for eigenvalues and purity bounds for general absolutely separable states.

quant-ph↗

arXiv2023

Linear maps preserving (p,k) norms of tensor products of matrices

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $ϕ:M_{mn}\rightarrow M_{mn}$ satisfies $$\|ϕ(A\otimes B)\|_{(p,k)}=\|A\otimes B\|_{(p,k)} {\rm\quad for~ all\quad}A\in M_m {\rm ~and ~}B\in M_n$$ if and only if there exist unitary matrices $U,V\in M_{mn}$ such that $$ϕ(A\otimes B)=U(φ_1(A)\otimes φ_2(B))V {\rm\quad for~ all\quad}A\in M_m {\rm~ and~ }B\in M_n,$$ where $φ_s$ is the identity map or the transposition map $X\to X^T$ for $s=1,2$. The result is also extended to multipartite systems.

math.FA↗

arXiv2021

Observing geometry of quantum states in a three-level system

In quantum mechanics, geometry has been demonstrated as a useful tool for inferring non-classical behaviors and exotic properties of quantum systems. One standard approach to illustrate the geometry of quantum systems is to project the quantum state space to the Euclidean space via measurements of observables on the system. Despite the great success of this method in studying two-level quantum systems (qubits) with the celebrated Bloch sphere representation, there is always the difficulty to reveal the geometry of multi-dimensional quantum systems. Here we report the first experiment measuring the geometry of such projections beyond the qubit. Specifically, we observe the joint numerical ranges (JNRs) of a triple of observables in a three-level photonic system, providing complete classification of the JNRs. We further show that the geometry of different classes reveal ground-state degeneracies of a Hamiltonian as a linear combination of the observables, which is related to quantum phases in the thermodynamic limit. Our results offer a versatile geometric approach for exploring the properties of higher-dimensional quantum systems.

quant-ph↗

arXiv2018

The generalized numerical range of a set of matrices

For a given set of $n\times n$ matrices $\mathcal F$, we study the union of the $C$-numerical ranges of the matrices in the set $\mathcal F$, denoted by $W_C({\mathcal F})$. We obtain basic algebraic and topological properties of $W_C({\mathcal F})$, and show that there are connections between the geometric properties of $W_C({\mathcal F})$ and the algebraic properties of $C$ and the matrices in ${\mathcal F}$. Furthermore, we consider the starshapedness and convexity of the set $W_C({\mathcal F})$. In particular, we show that if ${\mathcal F}$ is the convex hull of two matrices such that $W_C(A)$ and $W_C(B)$ are convex, then the set $W_C({\mathcal F})$ is star-shaped. We also investigate the extensions of the results to the joint $C$-numerical range of an $m$-tuple of matrices.

math.FA↗

arXiv2018

Convexity and Star-shapedness of Matricial Range

Let ${\bf A} = (A_1, \dots, A_m)$ be an $m$-tuple of bounded linear operators acting on a Hilbert space ${\cal H}$. Their joint $(p,q)$-matricial range $Λ_{p,q}({\bf A})$ is the collection of $(B_1, \dots, B_m) \in {\bf M}_q^m$, where $I_p\otimes B_j$ is a compression of $A_j$ on a $pq$-dimensional subspace. This definition covers various kinds of generalized numerical ranges for different values of $p,q,m$. In this paper, it is shown that $Λ_{p,q}({\bf A})$ is star-shaped if the dimension of $\cal H$ is sufficiently large. If $\dim {\cal H}$ is infinite, we extend the definition of $Λ_{p,q}({\bf A})$ to $Λ_{\infty,q}({\bf A})$ consisting of $(B_1, \dots, B_m) \in {\bf M}_q^m$ such that $I_\infty \otimes B_j$ is a compression of $A_j$ on a closed subspace of ${\cal H}$, and consider the joint essential $(p,q)$-matricial range $$Λ^{ess}_{p,q}({\bf A}) = \bigcap \{ {\bf cl}(Λ_{p,q}(A_1+F_1, \dots, A_m+F_m)): F_1, \dots, F_m \hbox{ are compact operators}\}.$$ Both sets are shown to be convex, and the latter one is always non-empty and compact.

math.FA↗

arXiv2017

Unitary similarity invariant function preservers of skew products of operators

Let ${\mathcal B}(H)$ denote the Banach algebra of all bounded linear operators on a complex Hilbert space $H$ with $\dim H\geq 3$, and let $\mathcal A$ and $\mathcal B$ be subsets of ${\mathcal B}(H)$ which contain all rank one operators. Suppose $F(\cdot )$ is a unitary invariant norm, the pseudo spectra, the pseudo spectral radius, the $C$-numerical range, or the $C$-numerical radius for some finite rank operator $C$. The structure is determined for surjective maps $Φ:{\mathcal A}\rightarrow \mathcal B$ satisfying $F(A^*B)=F(Φ(A)^*Φ(B))$ for all $A, B \in {\mathcal A}$. To establish the proofs, some general results are obtained for functions $F:{\mathcal F}_1(H) \cup \{0\} \rightarrow [0, +\infty)$, where ${\mathcal F}_1(H)$ is the set of rank one operators in ${\mathcal B}(H)$, satisfying (a) $F(μUAU^*)=F(A)$ for a complex unit $μ$, $A\in {\mathcal F}_1(H)$ and unitary $U \in {\mathcal B}(H)$ (b) for any rank one operator $X\in {\mathcal F}_1(H)$ the map $t\mapsto F(tX)$ on $[0, \infty)$ is strictly increasing, and (c) the set $\{F(X): X \in {\mathcal F}_1(H) \hbox{ and } \|X\| = 1\}$ attains its maximum and minimum.

math.FA↗

arXiv2017

Linear rank preservers of tensor products of rank one matrices

Let $n_1,\ldots,n_k $ be integers larger than or equal to 2. We characterize linear maps $ϕ: M_{n_1\cdots n_k}\rightarrow M_{n_1\cdots n_k}$ such that $${\mathrm rank}\,(ϕ(A_1\otimes \cdots \otimes A_k))=1\quad\hbox{whenever}\quad{\mathrm rank}\, (A_1\otimes \cdots \otimes A_k)=1 \quad \hbox{for all}\quad A_i \in M_{n_i},\, i = 1,\dots,k.$$ Applying this result, we extend two recent results on linear maps that preserving the rank of special classes of matrices.

math.FA↗

arXiv2015

Product of positive semi-definite matrices

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product. However, the characterizations of matrices that require three or four positive semi-definite matrices in the product are lacking. In this paper, we give a complete characterization of these two types of matrices. With these results, we give an algorithm to determine whether a square matrix can be expressed as the product of $k$ positive semi-definite matrices but not fewer, for $k = 1,2,3,4,5$.

math.FA↗

arXiv2015

Maximal noiseless code rates for collective rotation channels on qudits

We study noiseless subsystems on collective rotation channels of qudits, i.e., quantum channels with operators in the set ${\mathcal E}(d,n) = \{ U^{\otimes n}: U \in {\mathrm{SU}}(d)\}.$ This is done by analyzing the decomposition of the algebra ${\mathcal A}(d,n)$ generated by ${\mathcal E}(d,n)$. We summarize the results for the channels on qubits ($d=2$), and obtain the maximum dimension of the noiseless subsystem that can be used as the quantum error correction code for the channel. Then we extend our results to general $d$. In particular, it is shown that the code rate, i.e., the number of protected qudits over the number of physical qudits, always approaches 1 for a suitable noiseless subsystem. Moreover, one can determine the maximum dimension of the noiseless subsystem by solving a non-trivial discrete optimization problem. The maximum dimension of the noiseless subsystem for $d = 3$ (qutrits) is explicitly determined by a combination of mathematical analysis and the symbolic software Mathematica.

quant-ph↗

arXiv2015

Factorization of permutations

We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $δ$, such that every permutation can be factored into no more than $δ$ special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics.

math.CO↗

arXiv2014

Solution to time-energy costs of quantum channels

We derive a formula for the time-energy costs of general quantum channels proposed in [Phys. Rev. A 88, 012307 (2013)]. This formula allows us to numerically find the time-energy cost of any quantum channel using positive semidefinite programming. We also derive a lower bound to the time-energy cost for any channels and the exact the time-energy cost for a class of channels which includes the qudit depolarizing channels and projector channels as special cases.

quant-ph↗

arXiv2014

Recursive encoding and decoding of the noiseless subsystem for qudits

We give a full explanation of the noiseless subsystem that protects a single-qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et. al. [Phys. Rev. A 84, 044301 (2011)] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU($d$) errors. We find that under this recursive scheme, the asymptotic encoding rate is $1/d$.

quant-ph↗

arXiv2014

Conditions for degradability of tripartite quantum states

Alice, Bob, and Eve share a pure quantum state. We introduce the notion of state degradability by asking whether the joint density of Alice and Eve can be transformed to the joint density of Alice and Bob by processing Eve's part through a quantum channel, in order words, degrading Eve. We prove necessary and sufficient conditions for state degradability and provide an efficient method to quickly rule out degradability for a given state. The problem of determining degradability of states is different from that of quantum channels, although the notion is similar. One application of state degradability is that it can be used to test channel degradability. In particular, the degradability of the output state of a channel obtained from the maximally entangled input state gives information about the degradability of the channel.

quant-ph↗

arXiv2013

Determinantal and eigenvalue inequalities for matrices with numerical ranges in a sector

Let $A = \pmatrix A_{11} & A_{12} \cr A_{21} & A_{22}\cr\pmatrix \in M_n$, where $A_{11} \in M_m$ with $m \le n/2$, be such that the numerical range of $A$ lies in the set $\{e^{iφ} z \in \IC: |\Im z| \le (\Re z) \tan α\}$, for some $φ\in [0, 2π)$ and $α\in [0, π/2)$. We obtain the optimal containment region for the generalized eigenvalue $λ$ satisfying $$λ\pmatrix A_{11} & 0 \cr 0 & A_{22}\cr\pmatrix x = \pmatrix 0 & A_{12} \cr A_{21} & 0\cr\pmatrix x \quad \hbox{for some nonzero} x \in \IC^n,$$ and the optimal eigenvalue containment region of the matrix $I_m - A_{11}^{-1}A_{12} A_{22}^{-1}A_{21}$ in case $A_{11}$ and $A_{22}$ are invertible. From this result, one can show $|\det(A)| \le \sec^{2m}(α) |\det(A_{11})\det(A_{22})|$. In particular, if $A$ is a accretive-dissipative matrix, then $|\det(A)| \le 2^m |\det(A_{11})\det(A_{22})|$. These affirm some conjectures of Drury and Lin.

math.NA↗