Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Quantum Information

Equality condition for a matrix inequality with Kronecker product

Ziyue Tan

Published Jan 10, 2025• 1 citation
Publisher

Abstract

Quantum information theory has been greatly developed in the past decades, and many theoretical problems are related to matrix theory. We study the equality condition for a matrix inequality, [Formula: see text] rank([Formula: see text] ⊗[Formula: see text]) [Formula: see text] rank([Formula: see text] ⊗[Formula: see text] where [Formula: see text]’s are linearly independent matrices of the same size, and [Formula: see text]’s are linearly independent matrices of the same size. The inequality used to be a conjecture since 2013 and has recently been proven in the paper [Z. Song, L. Chen, Y. Sun and M. Hu, IEEE Trans. Inform. Theory 69 (2023) 2385]. We study several cases such as that [Formula: see text]’s are column vectors and [Formula: see text]’s are of various sizes. It turns out that some cases never satisfy the equality condition.

DOI
10.1142/s0219749925500017

Related papers

Equality Condition for a Matrix Inequality by Partial Transpose

Nalan Wang, Lin Chen

The partial transpose map is a linear map widely used in quantum information theory. We study the equality condition for a matrix inequality generated by partial transpose, namely [Formula: see text], where [Formula: see text]’s and [Formula: see text]’s are respectively the matrices of the same size, and [Formula: see text] is the Schmidt rank. We find explicit conditions that are equivalent to equality when the [Formula: see text]’s are column or row vectors, or [Formula: see text] matrices. For the case where the Schmidt rank equals the dimension of [Formula: see text], we extend the results from [Formula: see text] matrices to square matrices, and further to rectangular matrices. In detail, we show that [Formula: see text] is locally equivalent to an elegant block-diagonal form consisting solely of identity and zero matrices. We also study the general case for [Formula: see text], and it turns out that the key is to characterize the expression of matrices [Formula: see text]’s and [Formula: see text]’s.

arXiv:2508.18644•Open Systems & Information Dynamics•Jun 1, 2026•0 citations

Kronecker product and a related useful conjecture

Xiling Wang

Abstract This paper not only explores in detail the basic properties of the Kronecker product, such as the application of the union law, the distributive law, the transpose and the conjugate transpose, as well as the trace and the rank of the Kronecker product, but also rigorously proves these properties by means of mathematical induction or direct proofs. In addition, this paper extends these properties to Kronecker n-matrices and explores the applicability of inverse matrices and determinants to Kronecker products. More importantly, we introduce a conjecture related to the long-standing problem of distillability, which is partially solved when the number of nonzero elements is restricted. By showing the framework of the proof of the conjecture and a special case, we provide new perspectives for further research in this area.

Journal of Physics Conference Series•Feb 1, 2025•0 citations

Linear inequalities related to quantum entanglement theory

Everett Patterson

In this thesis, we will consider various linear inequalities relating the entries and eigenvalues of certain types of matrices. Our approach will consist of constructing inequalities which set bounds on the eigenvalues of entanglement witnesses, a type of matrix of interest to quantum information theory. We will then consider what these can tell us about the relation between the off-diagonal entries and eigenvalues of positive semidefinite matrices.

•Jan 1, 2020•0 citations

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra

Raphael A. Meyer, William Swartworth, David Paul Woodruff

We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove exponential lower bounds on the number of queries needed to estimate various properties, including the trace and the top eigenvalue of $\mathbf{A}$. Our proofs hold for all adaptive algorithms, modulo a mild conditioning assumption on the algorithm's queries. We further prove that algorithms whose queries come from a small alphabet (e.g., $\mathrm{x}_i \in \{\pm1\}^n$) cannot test if $\mathbf{A}$ is identically zero with polynomial complexity, despite the fact that a single query using Gaussian vectors solves the problem with probability 1. In steep contrast to the non-Kronecker case, this shows that sketching $\mathbf{A}$ with different distributions of the same subguassian norm can yield exponentially different query complexities. Our proofs follow from the observation that random vectors with Kronecker structure have exponentially smaller inner products than their non-Kronecker counterparts.

arXiv:2502.08029•Feb 12, 2025•3 citations

Quantum Query Complexity with Matrix-Vector Products

Andrew M. Childs, Shih-Han Hung, Tongyang Li

We study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.

arXiv:2102.11349•Leibniz international proceedings in informatics•Jan 1, 2021•10 citations

Quantum mutual information matrices

Feng Liu

For any [Formula: see text]-partite state [Formula: see text], we define its quantum mutual information matrix as an [Formula: see text][Formula: see text][Formula: see text][Formula: see text][Formula: see text] matrix whose [Formula: see text]-entry is given by quantum mutual information [Formula: see text]. Although each entry of quantum mutual information matrix, like its classical counterpart, is also used to measure bipartite correlations, the similarity ends here: quantum mutual information matrices are not always positive semidefinite even for collections of up to 3-partite states. In this work, we define the genuine n-partite mutual information which can be easily calculated. This definition is symmetric, nonnegative, bounded and more accurate for measuring multipartite states.

International Journal of Quantum Information•Dec 16, 2016•2 citations
Quantum information theory has been greatly developed in the past decades, and many theoretical problems are related to matrix theory. We study the equality condition for a matrix inequality, [Formula: see text] rank([Formula: see text] ⊗[Formula: see text]) [Formula: see text] rank([Formula: see text] ⊗[Formula: see text] where [Formula: see text]’s are linearly independent matrices of the same size, and [Formula: see text]’s are linearly independent matrices of the same size. The inequality used to be a conjecture since 2013 and has recently been proven in the paper [Z. Song, L. Chen, Y. Sun and M. Hu, IEEE Trans. Inform. Theory 69 (2023) 2385]. We study several cases such as that [Formula: see text]’s are column vectors and [Formula: see text]’s are of various sizes. It turns out that some cases never satisfy the equality condition.
The partial transpose map is a linear map widely used in quantum information theory. We study the equality condition for a matrix inequality generated by partial transpose, namely [Formula: see text], where [Formula: see text]’s and [Formula: see text]’s are respectively the matrices of the same size, and [Formula: see text] is the Schmidt rank. We find explicit conditions that are equivalent to equality when the [Formula: see text]’s are column or row vectors, or [Formula: see text] matrices. For the case where the Schmidt rank equals the dimension of [Formula: see text], we extend the results from [Formula: see text] matrices to square matrices, and further to rectangular matrices. In detail, we show that [Formula: see text] is locally equivalent to an elegant block-diagonal form consisting solely of identity and zero matrices. We also study the general case for [Formula: see text], and it turns out that the key is to characterize the expression of matrices [Formula: see text]’s and [Formula: see text]’s.
Abstract This paper not only explores in detail the basic properties of the Kronecker product, such as the application of the union law, the distributive law, the transpose and the conjugate transpose, as well as the trace and the rank of the Kronecker product, but also rigorously proves these properties by means of mathematical induction or direct proofs. In addition, this paper extends these properties to Kronecker n-matrices and explores the applicability of inverse matrices and determinants to Kronecker products. More importantly, we introduce a conjecture related to the long-standing problem of distillability, which is partially solved when the number of nonzero elements is restricted. By showing the framework of the proof of the conjecture and a special case, we provide new perspectives for further research in this area.
We study the computational model where we can access a matrix A\mathbf{A}A only by computing matrix-vector products Ax\mathbf{A}\mathrm{x}Ax for vectors of the form x=x1⊗⋯⊗xq\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_qx=x1​⊗⋯⊗xq​. We prove exponential lower bounds on the number of queries needed to estimate various properties, including the trace and the top eigenvalue of A\mathbf{A}A. Our proofs hold for all adaptive algorithms, modulo a mild conditioning assumption on the algorithm's queries. We further prove that algorithms whose queries come from a small alphabet (e.g., xi∈{±1}n\mathrm{x}_i \in \{\pm1\}^nxi​∈{±1}n) cannot test if A\mathbf{A}A is identically zero with polynomial complexity, despite the fact that a single query using Gaussian vectors solves the problem with probability 1. In steep contrast to the non-Kronecker case, this shows that sketching A\mathbf{A}A with different distributions of the same subguassian norm can yield exponentially different query complexities. Our proofs follow from the observation that random vectors with Kronecker structure have exponentially smaller inner products than their non-Kronecker counterparts.
We study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.
For any [Formula: see text]-partite state [Formula: see text], we define its quantum mutual information matrix as an [Formula: see text][Formula: see text][Formula: see text][Formula: see text][Formula: see text] matrix whose [Formula: see text]-entry is given by quantum mutual information [Formula: see text]. Although each entry of quantum mutual information matrix, like its classical counterpart, is also used to measure bipartite correlations, the similarity ends here: quantum mutual information matrices are not always positive semidefinite even for collections of up to 3-partite states. In this work, we define the genuine n-partite mutual information which can be easily calculated. This definition is symmetric, nonnegative, bounded and more accurate for measuring multipartite states.