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

Applications of matrix spaces in quantum information and computational complexity

Yinan Li

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

This thesis explores the applications of matrix spaces in quantum information and computational complexity, specifically in the areas of quantum state/channel discrimination, entanglement transformation and isomorphism testing. We achieve the following contributions: \n•\tWe derive a necessary condition which determines whether a set of orthogonal bipartite states can be distinguished by positive-partial-transpose (PPT) operations, in the many-copy scenario. We reduce the discrimination task to the following problem: Decide whether there exist a nonzero bipartite matrix with positive partial-transpose, such that all its eigenvectors with nonzero eigenvalues is orthogonal to a given bipartite vector space. As applications, we reprove and extend a variety of existing results, including the local indistinguishability of the bipartite maximally entangled state and its orthogonal complement [Yu, Duan and Ying, IEEE transaction on Information Theory, 2014] and the maximum dimension of non-positive-partial-transpose subspaces [Johnston, Physical Review A, 2013]. \n•\tWe show that determining the parallel distinguishability of quantum channels is equivalent to determining whether the orthogonal complement of a given matrix space contains nonzero positive semidefinite matrices. Our characterization immediately implies a necessary condition to decide the parallel distinguishability. We further prove that our condition is also sufficient for two large families of quantum channels, which leads to an alternating proof for the parallel distinguishability of unitary operations [Acín, Physical Review Letters, 2001]. We also present an illustrative example showing our necessary condition cannot determine the parallel distinguishability. \n•\tWe systematically study the tripartite-to-bipartite entanglement transformations by stochastic local operations and classical communication (SLOCC). Such a problem is equivalent to computing the maximal rank of a matrix space [Chitambar, Duan and Shi, Physical Review A, 2010]. We analyze the SLOCC convertibility in both the finite-copy and asymptotic regimes. In particular, we derive explicit formulas which compute asymptotic entanglement transformation rates for two families of tripartite states by resorting to certain results of the structure of matrix spaces, including the study of matrix semi-invariants. Significantly, we show that the problem of deciding the asymptotic SLOCC convertibility of tripartite pure states to the bipartite maximally entangled states and the non-commutative symbolic determinant identity testing problem is algorithmically equivalent, which builds a new connection between problems in algebraic complexity and problems in asymptotic SLOCC entanglement transformations. \n•\tWe devise algorithms which test isometry between alternating matrix spaces over finite field. Algorithms for such a problem in time polynomial in the underlying vector space size resolves the believed bottleneck case of the group isomorphism problem, i.e. testing isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. Our approach is to view it as a linear algebraic analog of the graph isomorphism problem. We devise an average-case efficient algorithm for the alternating matrix space isometry problem over a key range of parameters. in a random model of alternating matrix spaces in vein of the Erdős-Rényi model of random graphs. To devise our algorithm, we developed linear algebraic individualization and refinement techniques, which are crucial in the first average-case efficient algorithm for graph isomorphism, devised by Babai, Erdős, and Selkow in the 1970s [Babai, Erdős and Selkow, SIAM Journal on Computing, 1980]. We also adapt Luks' dynamic programming technique for graph isomorphism [Luks, STOC, 1999] to slightly improve the worst-case time complexity of the alternating matrix space isometry problem.

Related papers

Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose

Nengkun Yu, Runyao Duan, Mingsheng Ying

We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no matter how many copies are supplied, cannot be distinguished by the PPT POVMs, even unambiguously. This result is much stronger than the previous known ones; and 3) we study the entanglement cost of distinguishing quantum states. It is proved that √{2/3}|00〉+√{1/3}|11〉 is sufficient and necessary for distinguishing three Bell states by the PPT POVMs. An upper bound of entanglement cost of distinguishing a d ⊗ d pure state and its orthogonal complement is obtained for separable operations. Based on this bound, we are able to construct two orthogonal quantum states, which cannot be distinguished unambiguously by separable POVMs, but finite copies would make them perfectly distinguishable by local operations and classical communication. We further observe that a two-qubit maximally entangled state is always enough for distinguishing a d ⊗ d pure state and its orthogonal complement by the PPT POVMs, no matter the value of d. In sharp contrast, an entangled state with Schmidt number at least d is always needed for distinguishing such two states by separable POVMs. As an application, we show that the entanglement cost of distinguishing a d ⊗ d maximally entangled state and its orthogonal complement must be a maximally entangled state for d=2, which implies that teleportation is optimal, and in general, it could be chosen as O(logd/d).

arXiv:1209.4222•IEEE Transactions on Information Theory•Feb 24, 2014•73 citations

Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario

Yinan Li, Xin Wang, Runyao Duan

A bipartite subspace $S$ is called strongly positive-partial-transpose (PPT) unextendible if for every positive integer $k$, there is no PPT operator supporting on the orthogonal complement of ${S}^{\ensuremath{\bigotimes}k}$. We show that a subspace is strongly PPT unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Based on these, we are able to propose a simple criterion for verifying whether a set of bipartite orthogonal quantum states is indistinguishable by PPT operations in the many-copy scenario. Utilizing this criterion, we further point out that any entangled pure state and its orthogonal complement cannot be distinguished by PPT operations in the many-copy scenario. On the other hand, we investigate that the minimum dimension of strongly PPT-unextendible subspaces in an $m\ensuremath{\bigotimes}n$ system is $m+n\ensuremath{-}1$, which involves a generalization of the result that non-positive-partial-transpose subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87, 064302 (2013)].

arXiv:1702.00231•Physical Review A•May 30, 2017•23 citations

Distinguishing Maximally Entangled States by PPT Operations and Entanglement Catalysis Discrimination

Nengkun Yu, Runyao Duan, Mingsheng Ying

In order to better understand the class of quantum operations that preserve the positivity of partial transpose (PPT operations) and its relation to the widely used class of local operations and classical communication (LOCC), we study the problem of distinguishing orthogonal maximally entangled states (MES) by PPT operations. Firstly, we outline a rather simple proof to show that the number of $d\otimes d$ PPT distinguishable MES is at most $d$, which slightly generalizes existing results on this problem. Secondly, we construct 4 MES in $4\otimes 4$ state space that cannot be distinguished by PPT operations. Before our work, it was unknown whether there exists $d$ MES in $d\otimes d$ state space that are locally indistinguishable. This example leads us to a novel phenomenon of Entanglement Catalysis Discrimination. Moreover, we find there exists a set of locally indistinguishable states $K$ such that $K^{\otimes m}$ is locally distinguishable for some finite $m$. As an interesting application, we exhibit a quantum channel with one sender and two receivers, whose one-shot zero-error local capacity is not optimal, but multi-use would enhance the capacity to achieve the full output dimension even without entangled input. Finally, we consider the entanglement cost of distinguishing three Bell states and a $2\otimes 2$ entangled basis. In the former case a bipartite pure entangled state with the largest Schmidt coefficient at most 2/3 is necessary and sufficient, while in the latter case an additional Bell state, or one ebit, should be supplied.

•Jul 16, 2011•1 citation

Symmetry and Randomness in Quantum Information Theory: Several Applications

Wei Dong Xie

This thesis studies four topics in quantum information theory using tools from representation theory and (high-dimensional) probability theory. \nFirst, we study the nonadditivity of minimum output von Neumann and Rényi entropy of quantum channels. A sketch of the proof by Aubrun, Szarek and Werner for nonadditivity of minimum output entropy is presented, and a slight simplification is given. We show that asymptotically the minimum output entropy of the random channel Ɛ ⊗ Ɛ ⊗ Ɛ* is achieved not by a tripartite genuinely entangled state, but by a tensor product of two states. We also study another model of random channel, and our estimation of the minimum output Rényi entropies fails to show the usefulness of genuine multipartite entanglement for the multiple nonadditivity. \nSecond, we study the generic entanglement in the random near-invariant tensors under the action of 𝔰𝔲(2), and random symmetric invariant tensors under the action of 𝔰𝔲(𝘥) for any 𝘥, serving as an extension of the random invariant tensors under 𝔰𝔲(2). We show that both the random tensors are asymptotically close to a maximally entangled state with respect to any bipartite cut. \nThird, we study efficient quantum certification for states and unitaries. We present an algorithm that uses 𝑂(ε⁻⁴ ln |𝒫|) copies of an unknown state to distinguish whether the unknown state is contained in or ε-far from a finite set 𝒫 of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. The previous study showed that one can distinguish whether an unknown unitary 𝑈 is equal to or ε-far from a known or unknown unitary 𝘝 in fixed dimension with 𝑂(ε⁻²) uses of the unitary, in which an ancilla system should be used. We give an algorithm that distinguishes the two cases with 𝑂(ε⁻¹) uses of the unitary, without using ancilla system or using ancilla system of much smaller dimension. \nFinally, we study the parallel repetition of extended nonlocal game motivated by its connection with multipartite steering and entanglement detection. We show that the probability of winning an 𝑛-fold parallel repetition of commuting nonsignaling extended nonlocal game 𝐺 decreases exponentially in 𝑛, provided that the game value of 𝐺 is strictly less than 1, following the approach used by Lancien and Winter based on de Finetti reduction.

•Jan 1, 2020•0 citations

Matrix pencils and entanglement classification

Eric Chitambar, Carl A. Miller, Yaoyun Shi

Quantum entanglement plays a central role in quantum information processing. A main objective of the theory is to classify different types of entanglement according to their interconvertibility through manipulations that do not require additional entanglement to perform. While bipartite entanglement is well understood in this framework, the classification of entanglements among three or more subsystems is inherently much more difficult. In this paper, we study pure state entanglement in systems of dimension 2⊗m⊗n. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local quantum resources and classical communication (SLOCC). We introduce a connection between entanglement manipulations in these systems and the well-studied theory of matrix pencils. All previous attempts to study general SLOCC equivalence in such systems have relied on somewhat contrived techniques which fail to reveal the elegant structure of the problem that can be seen from the matrix pencil approach. Based on this method, we report the first polynomial-time algorithm for deciding when two 2⊗m⊗n states are SLOCC equivalent. We then proceed to present a canonical form for all 2⊗m⊗n states based on the matrix pencil construction such that two states are equivalent if and only if they have the same canonical form. Besides recovering the previously known 26 distinct SLOCC equivalence classes in 2⊗3⊗n systems, we also determine the hierarchy between these classes.

arXiv:0911.1803•Journal of Mathematical Physics•Jul 1, 2010•23 citations

Distinguishability of Quantum States by Separable Operations

Runyao Duan, Yuan Feng, Yu Xin +1 more

In this paper, we study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An analytical version of this condition is derived for the case of(D-1) pure states, whereDis the total dimension of the state space under consideration. A number of interesting consequences of this result are then carefully investigated. Remarkably, we show there exists a large class of 2 otimes 2 separable operations not being realizable by local operations and classical communication. Before our work, only a class of 3 otimes 3 nonlocal separable operations was known [Bennett , Phys. Rev. A 59, 1070 (1999)]. We also show that any basis of the orthogonal complement of a multipartite pure state is indistinguishable by separable operations if and only if this state cannot be a superposition of one or two orthogonal product states, i.e., has an orthogonal Schmidt number not less than three, thus generalize the recent work about indistinguishable bipartite subspaces [Watrous, Phys. Rev. Lett. 95, 080505 (2005)]. Notably, we obtain an explicit construction of indistinguishable subspaces of dimension 7 (or 6) by considering a composite quantum system consisting of two qutrits (resp., three qubits), which is slightly better than the previously known indistinguishable bipartite subspace with dimension 8.

arXiv:0705.0795•IEEE Transactions on Information Theory•Feb 26, 2009•112 citations
This thesis explores the applications of matrix spaces in quantum information and computational complexity, specifically in the areas of quantum state/channel discrimination, entanglement transformation and isomorphism testing. We achieve the following contributions: \n•\tWe derive a necessary condition which determines whether a set of orthogonal bipartite states can be distinguished by positive-partial-transpose (PPT) operations, in the many-copy scenario. We reduce the discrimination task to the following problem: Decide whether there exist a nonzero bipartite matrix with positive partial-transpose, such that all its eigenvectors with nonzero eigenvalues is orthogonal to a given bipartite vector space. As applications, we reprove and extend a variety of existing results, including the local indistinguishability of the bipartite maximally entangled state and its orthogonal complement [Yu, Duan and Ying, IEEE transaction on Information Theory, 2014] and the maximum dimension of non-positive-partial-transpose subspaces [Johnston, Physical Review A, 2013]. \n•\tWe show that determining the parallel distinguishability of quantum channels is equivalent to determining whether the orthogonal complement of a given matrix space contains nonzero positive semidefinite matrices. Our characterization immediately implies a necessary condition to decide the parallel distinguishability. We further prove that our condition is also sufficient for two large families of quantum channels, which leads to an alternating proof for the parallel distinguishability of unitary operations [Acín, Physical Review Letters, 2001]. We also present an illustrative example showing our necessary condition cannot determine the parallel distinguishability. \n•\tWe systematically study the tripartite-to-bipartite entanglement transformations by stochastic local operations and classical communication (SLOCC). Such a problem is equivalent to computing the maximal rank of a matrix space [Chitambar, Duan and Shi, Physical Review A, 2010]. We analyze the SLOCC convertibility in both the finite-copy and asymptotic regimes. In particular, we derive explicit formulas which compute asymptotic entanglement transformation rates for two families of tripartite states by resorting to certain results of the structure of matrix spaces, including the study of matrix semi-invariants. Significantly, we show that the problem of deciding the asymptotic SLOCC convertibility of tripartite pure states to the bipartite maximally entangled states and the non-commutative symbolic determinant identity testing problem is algorithmically equivalent, which builds a new connection between problems in algebraic complexity and problems in asymptotic SLOCC entanglement transformations. \n•\tWe devise algorithms which test isometry between alternating matrix spaces over finite field. Algorithms for such a problem in time polynomial in the underlying vector space size resolves the believed bottleneck case of the group isomorphism problem, i.e. testing isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. Our approach is to view it as a linear algebraic analog of the graph isomorphism problem. We devise an average-case efficient algorithm for the alternating matrix space isometry problem over a key range of parameters. in a random model of alternating matrix spaces in vein of the Erdős-Rényi model of random graphs. To devise our algorithm, we developed linear algebraic individualization and refinement techniques, which are crucial in the first average-case efficient algorithm for graph isomorphism, devised by Babai, Erdős, and Selkow in the 1970s [Babai, Erdős and Selkow, SIAM Journal on Computing, 1980]. We also adapt Luks' dynamic programming technique for graph isomorphism [Luks, STOC, 1999] to slightly improve the worst-case time complexity of the alternating matrix space isometry problem.
We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no matter how many copies are supplied, cannot be distinguished by the PPT POVMs, even unambiguously. This result is much stronger than the previous known ones; and 3) we study the entanglement cost of distinguishing quantum states. It is proved that √{2/3}|00〉+√{1/3}|11〉 is sufficient and necessary for distinguishing three Bell states by the PPT POVMs. An upper bound of entanglement cost of distinguishing a d ⊗ d pure state and its orthogonal complement is obtained for separable operations. Based on this bound, we are able to construct two orthogonal quantum states, which cannot be distinguished unambiguously by separable POVMs, but finite copies would make them perfectly distinguishable by local operations and classical communication. We further observe that a two-qubit maximally entangled state is always enough for distinguishing a d ⊗ d pure state and its orthogonal complement by the PPT POVMs, no matter the value of d. In sharp contrast, an entangled state with Schmidt number at least d is always needed for distinguishing such two states by separable POVMs. As an application, we show that the entanglement cost of distinguishing a d ⊗ d maximally entangled state and its orthogonal complement must be a maximally entangled state for d=2, which implies that teleportation is optimal, and in general, it could be chosen as O(logd/d).
A bipartite subspace SSS is called strongly positive-partial-transpose (PPT) unextendible if for every positive integer kkk, there is no PPT operator supporting on the orthogonal complement of ${S}^{\ensuremath{\bigotimes}k}$. We show that a subspace is strongly PPT unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Based on these, we are able to propose a simple criterion for verifying whether a set of bipartite orthogonal quantum states is indistinguishable by PPT operations in the many-copy scenario. Utilizing this criterion, we further point out that any entangled pure state and its orthogonal complement cannot be distinguished by PPT operations in the many-copy scenario. On the other hand, we investigate that the minimum dimension of strongly PPT-unextendible subspaces in an $m\ensuremath{\bigotimes}n$ system is $m+n\ensuremath{-}1$, which involves a generalization of the result that non-positive-partial-transpose subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87, 064302 (2013)].
In order to better understand the class of quantum operations that preserve the positivity of partial transpose (PPT operations) and its relation to the widely used class of local operations and classical communication (LOCC), we study the problem of distinguishing orthogonal maximally entangled states (MES) by PPT operations. Firstly, we outline a rather simple proof to show that the number of d⊗dd\otimes dd⊗d PPT distinguishable MES is at most ddd, which slightly generalizes existing results on this problem. Secondly, we construct 4 MES in 4⊗44\otimes 44⊗4 state space that cannot be distinguished by PPT operations. Before our work, it was unknown whether there exists ddd MES in d⊗dd\otimes dd⊗d state space that are locally indistinguishable. This example leads us to a novel phenomenon of Entanglement Catalysis Discrimination. Moreover, we find there exists a set of locally indistinguishable states KKK such that K⊗mK^{\otimes m}K⊗m is locally distinguishable for some finite mmm. As an interesting application, we exhibit a quantum channel with one sender and two receivers, whose one-shot zero-error local capacity is not optimal, but multi-use would enhance the capacity to achieve the full output dimension even without entangled input. Finally, we consider the entanglement cost of distinguishing three Bell states and a 2⊗22\otimes 22⊗2 entangled basis. In the former case a bipartite pure entangled state with the largest Schmidt coefficient at most 2/3 is necessary and sufficient, while in the latter case an additional Bell state, or one ebit, should be supplied.
This thesis studies four topics in quantum information theory using tools from representation theory and (high-dimensional) probability theory. \nFirst, we study the nonadditivity of minimum output von Neumann and Rényi entropy of quantum channels. A sketch of the proof by Aubrun, Szarek and Werner for nonadditivity of minimum output entropy is presented, and a slight simplification is given. We show that asymptotically the minimum output entropy of the random channel Ɛ ⊗ Ɛ ⊗ Ɛ* is achieved not by a tripartite genuinely entangled state, but by a tensor product of two states. We also study another model of random channel, and our estimation of the minimum output Rényi entropies fails to show the usefulness of genuine multipartite entanglement for the multiple nonadditivity. \nSecond, we study the generic entanglement in the random near-invariant tensors under the action of 𝔰𝔲(2), and random symmetric invariant tensors under the action of 𝔰𝔲(𝘥) for any 𝘥, serving as an extension of the random invariant tensors under 𝔰𝔲(2). We show that both the random tensors are asymptotically close to a maximally entangled state with respect to any bipartite cut. \nThird, we study efficient quantum certification for states and unitaries. We present an algorithm that uses 𝑂(ε⁻⁴ ln |𝒫|) copies of an unknown state to distinguish whether the unknown state is contained in or ε-far from a finite set 𝒫 of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. The previous study showed that one can distinguish whether an unknown unitary 𝑈 is equal to or ε-far from a known or unknown unitary 𝘝 in fixed dimension with 𝑂(ε⁻²) uses of the unitary, in which an ancilla system should be used. We give an algorithm that distinguishes the two cases with 𝑂(ε⁻¹) uses of the unitary, without using ancilla system or using ancilla system of much smaller dimension. \nFinally, we study the parallel repetition of extended nonlocal game motivated by its connection with multipartite steering and entanglement detection. We show that the probability of winning an 𝑛-fold parallel repetition of commuting nonsignaling extended nonlocal game 𝐺 decreases exponentially in 𝑛, provided that the game value of 𝐺 is strictly less than 1, following the approach used by Lancien and Winter based on de Finetti reduction.
Quantum entanglement plays a central role in quantum information processing. A main objective of the theory is to classify different types of entanglement according to their interconvertibility through manipulations that do not require additional entanglement to perform. While bipartite entanglement is well understood in this framework, the classification of entanglements among three or more subsystems is inherently much more difficult. In this paper, we study pure state entanglement in systems of dimension 2⊗m⊗n. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local quantum resources and classical communication (SLOCC). We introduce a connection between entanglement manipulations in these systems and the well-studied theory of matrix pencils. All previous attempts to study general SLOCC equivalence in such systems have relied on somewhat contrived techniques which fail to reveal the elegant structure of the problem that can be seen from the matrix pencil approach. Based on this method, we report the first polynomial-time algorithm for deciding when two 2⊗m⊗n states are SLOCC equivalent. We then proceed to present a canonical form for all 2⊗m⊗n states based on the matrix pencil construction such that two states are equivalent if and only if they have the same canonical form. Besides recovering the previously known 26 distinct SLOCC equivalence classes in 2⊗3⊗n systems, we also determine the hierarchy between these classes.
In this paper, we study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An analytical version of this condition is derived for the case of(D-1) pure states, whereDis the total dimension of the state space under consideration. A number of interesting consequences of this result are then carefully investigated. Remarkably, we show there exists a large class of 2 otimes 2 separable operations not being realizable by local operations and classical communication. Before our work, only a class of 3 otimes 3 nonlocal separable operations was known [Bennett , Phys. Rev. A 59, 1070 (1999)]. We also show that any basis of the orthogonal complement of a multipartite pure state is indistinguishable by separable operations if and only if this state cannot be a superposition of one or two orthogonal product states, i.e., has an orthogonal Schmidt number not less than three, thus generalize the recent work about indistinguishable bipartite subspaces [Watrous, Phys. Rev. Lett. 95, 080505 (2005)]. Notably, we obtain an explicit construction of indistinguishable subspaces of dimension 7 (or 6) by considering a composite quantum system consisting of two qutrits (resp., three qubits), which is slightly better than the previously known indistinguishable bipartite subspace with dimension 8.