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

arXiv:1306.0083 · Linear and Multilinear Algebra

Generalized Shemesh criterion, common invariant subspaces and irreducible completely positive superoperators

Andrzej Jamiołkowski, Grzegorz Pastuszak

Published Feb 5, 2014• 24 citations
arXivHTMLPDF

Abstract

Assume that are complex matrices. We give a computable criterion for existence of a common eigenvector of which generalize the result of D. Shemesh established for two matrices. We use this criterion to prove some necessary and sufficient condition for to have a common invariant subspace of dimension , , if every has pairwise different eigenvalues. Since the set of all matrices having multiple eigevalues has Lebesgue measure , the condition is sufficient in practical applications. Being motivated by quantum information theory, we give a flavour of such applications for irreducible completely positive superoperators.

DOI
10.1080/03081087.2013.865734

Related papers

Common reducing unitary subspaces and decoherence in quantum systems

Grzegorz Pastuszak, Andrzej Jamiołkowski

Maps of the form Phi(X) =sum_{i=1}^s A_iXA^*, where A_1, . . . ,A_s are fixed complex n by n matrices and X is any complex n by n matrix are used in quantum information theory as representations of quantum channels. This article deals with computable conditions for the existence of decoherence--free subspaces for Phi. Since the definition of decoherence-free subspace for quantum channels relies only on the matrices A1, . . . ,As, the term of common reducing unitary subspace is used instead of the original one. Among the main results of the paper, there are computable conditions for the existence of common eigenvectors. These are related to common reducing unitary subspaces of dimension one. The new results on common eigenvectors provide new effective condition for the existence of common invariant subspaces of arbitrary dimensions.

Electronic Journal of Linear Algebra•Feb 8, 2015•10 citations

Pairwise completely positive matrices with applications in Quantum Information Theory

Olivia R. MacLean

This thesis introduces a generalization of the set of completely positive matrices that we call “pairwise completely positive” (PCP) matrices. PCP matrix pairs are defined so that one matrix in the pair is necessarily positive semidefinite while the other is necessarily entrywise non-negative. After PCP matrices are defined we explore their basic properties and establish numerous necessary and sufficient conditions that can help test whether or not a pair meets our definition of PCP. We then relate these matrix pairs to the separability of conjugate local diagonal unitary invariant (CLDUI) quantum states. In particular, we show that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a corresponding CLDUI state is separable.

•Apr 8, 2019•0 citations

Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States

Nathaniel Johnston, Olivia R. MacLean

A generalization of the set of completely positive matrices called pairwise completely positive (PCP) matrices is introduced. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive semidefinite while the other one is necessarily entrywise non-negative. Basic properties of these matrix pairs are explored and several testable necessary and sufficient conditions are developed to help determine whether or not a pair is PCP. A connection with quantum entanglement is established by showing that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a certain type of quantum state, called a conjugate local diagonal unitary invariant state, is separable. Many of the most important quantum states in entanglement theory are of this type, including isotropic states, mixed Dicke states (up to partial transposition), and maximally correlated states. As a specific application of these results, a wide family of states that have absolutely positive partial transpose are shown to in fact be separable.

arXiv:1807.06897•Electronic Journal of Linear Algebra•Feb 1, 2019•15 citations

Shemesh Theorem and Its Relation With the Zero-Error Quantum Information Theory

Marciel Medeiros de Oliveira, Micael Andrade Dias, Andresso da Silva +1 more

In this paper, our objective is to establish results that connect Shemesh theorem with quantum zero-error information theory. To achieve this, we will first introduce definitions and properties related to the zero-error capacity of a quantum channel, with particular emphasis on demonstrating that the eigenstates common to the Kraus operators representing the quantum channel are fixed points. This result has previously been employed to develop a test for determining whether a quantum channel possesses positive zero-error capacity. In this work, we demonstrate that the eigenstates common to the Kraus operators representing the channel reside within the Shemesh subspace. Consequently, the fixed points of the quantum channel act as a bridge between Shemesh theorem and quantum zero-error information theory, thereby enabling the derivation of new results on the zero-error capacity of quantum channels.

IEEE Access•Jan 1, 2024•2 citations

Diagonal unitary and orthogonal symmetries in quantum theory

Satvik Singh, Ion Nechita

We analyze bipartite matrices and linear maps between matrix algebras, which are respectively, invariant and covariant, under the diagonal unitary and orthogonal groups' actions. By presenting an expansive list of examples from the literature, which includes notable entries like the Diagonal Symmetric states and the Choi-type maps, we show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. We examine their linear algebraic structure and investigate different notions of positivity through their convex conic manifestations. In particular, we generalize the well-known cone of completely positive matrices to that of triplewise completely positive matrices and connect it to the separability of the relevant invariant states (or the entanglement breaking property of the corresponding quantum channels). For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations, and systematically analyze the usual properties of positivity, decomposability, complete positivity, and the like. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.

arXiv:2010.07898•Quantum•Aug 9, 2021•34 citations

Geometry of density matrices. VI. Superoperators and unitary invariance

Mark E. Casida, John E. Harriman

Abstract We examine and compare ways of dividing into subspaces the space whose elements are density matrices or other operators for the class of model problems defined by a finite one‐particle basis set. One method of decomposition makes the significance of the subspaces apparent. We show that this decomposition is also complete, in the group‐theoretic sense, for the group of unitary transformations of the set of one‐electron basis functions. The irreducible subspaces are labeled by particle number and by an additional integer we call the reduction index. For spaces of particle‐number‐conserving operators, all subspaces with the same reduction index are isomorphic, and an analogous isomorphism exists for non‐particle‐number‐conserving cases. The general linear group also plays a key role, and we introduce the term “canonical superoperators” to characterize those superoperators which commute with this group. When an appropriate basis set is chosen for the matrix spaces, the supermatrices corresponding to these superoperators have a particularly simple form: a block structure with the only nonzero blocks being multiples of unit matrices. The superoperators of interest can be constructed in terms of two operators, , and these two have been expressed simply in terms of creation and annihilation operators. When only real orthogonal transformations of the basis are considered, a further decomposition is possible. We have introduced superoperators associated with this decomposition.

International Journal of Quantum Chemistry•Aug 1, 1986•19 citations
Assume that are complex matrices. We give a computable criterion for existence of a common eigenvector of which generalize the result of D. Shemesh established for two matrices. We use this criterion to prove some necessary and sufficient condition for to have a common invariant subspace of dimension , , if every has pairwise different eigenvalues. Since the set of all matrices having multiple eigevalues has Lebesgue measure , the condition is sufficient in practical applications. Being motivated by quantum information theory, we give a flavour of such applications for irreducible completely positive superoperators.
Maps of the form Phi(X) =sum_{i=1}^s A_iXA^*, where A_1, . . . ,A_s are fixed complex n by n matrices and X is any complex n by n matrix are used in quantum information theory as representations of quantum channels. This article deals with computable conditions for the existence of decoherence--free subspaces for Phi. Since the definition of decoherence-free subspace for quantum channels relies only on the matrices A1, . . . ,As, the term of common reducing unitary subspace is used instead of the original one. Among the main results of the paper, there are computable conditions for the existence of common eigenvectors. These are related to common reducing unitary subspaces of dimension one. The new results on common eigenvectors provide new effective condition for the existence of common invariant subspaces of arbitrary dimensions.
This thesis introduces a generalization of the set of completely positive matrices that we call “pairwise completely positive” (PCP) matrices. PCP matrix pairs are defined so that one matrix in the pair is necessarily positive semidefinite while the other is necessarily entrywise non-negative. After PCP matrices are defined we explore their basic properties and establish numerous necessary and sufficient conditions that can help test whether or not a pair meets our definition of PCP. We then relate these matrix pairs to the separability of conjugate local diagonal unitary invariant (CLDUI) quantum states. In particular, we show that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a corresponding CLDUI state is separable.
A generalization of the set of completely positive matrices called pairwise completely positive (PCP) matrices is introduced. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive semidefinite while the other one is necessarily entrywise non-negative. Basic properties of these matrix pairs are explored and several testable necessary and sufficient conditions are developed to help determine whether or not a pair is PCP. A connection with quantum entanglement is established by showing that determining whether or not a pair of matrices is pairwise completely positive is equivalent to determining whether or not a certain type of quantum state, called a conjugate local diagonal unitary invariant state, is separable. Many of the most important quantum states in entanglement theory are of this type, including isotropic states, mixed Dicke states (up to partial transposition), and maximally correlated states. As a specific application of these results, a wide family of states that have absolutely positive partial transpose are shown to in fact be separable.
In this paper, our objective is to establish results that connect Shemesh theorem with quantum zero-error information theory. To achieve this, we will first introduce definitions and properties related to the zero-error capacity of a quantum channel, with particular emphasis on demonstrating that the eigenstates common to the Kraus operators representing the quantum channel are fixed points. This result has previously been employed to develop a test for determining whether a quantum channel possesses positive zero-error capacity. In this work, we demonstrate that the eigenstates common to the Kraus operators representing the channel reside within the Shemesh subspace. Consequently, the fixed points of the quantum channel act as a bridge between Shemesh theorem and quantum zero-error information theory, thereby enabling the derivation of new results on the zero-error capacity of quantum channels.
We analyze bipartite matrices and linear maps between matrix algebras, which are respectively, invariant and covariant, under the diagonal unitary and orthogonal groups' actions. By presenting an expansive list of examples from the literature, which includes notable entries like the Diagonal Symmetric states and the Choi-type maps, we show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. We examine their linear algebraic structure and investigate different notions of positivity through their convex conic manifestations. In particular, we generalize the well-known cone of completely positive matrices to that of triplewise completely positive matrices and connect it to the separability of the relevant invariant states (or the entanglement breaking property of the corresponding quantum channels). For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations, and systematically analyze the usual properties of positivity, decomposability, complete positivity, and the like. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.
Abstract We examine and compare ways of dividing into subspaces the space whose elements are density matrices or other operators for the class of model problems defined by a finite one‐particle basis set. One method of decomposition makes the significance of the subspaces apparent. We show that this decomposition is also complete, in the group‐theoretic sense, for the group of unitary transformations of the set of one‐electron basis functions. The irreducible subspaces are labeled by particle number and by an additional integer we call the reduction index. For spaces of particle‐number‐conserving operators, all subspaces with the same reduction index are isomorphic, and an analogous isomorphism exists for non‐particle‐number‐conserving cases. The general linear group also plays a key role, and we introduce the term “canonical superoperators” to characterize those superoperators which commute with this group. When an appropriate basis set is chosen for the matrix spaces, the supermatrices corresponding to these superoperators have a particularly simple form: a block structure with the only nonzero blocks being multiples of unit matrices. The superoperators of interest can be constructed in terms of two operators, , and these two have been expressed simply in terms of creation and annihilation operators. When only real orthogonal transformations of the basis are considered, a further decomposition is possible. We have introduced superoperators associated with this decomposition.