@article {1866, title = {Deciding Unitary Equivalence Between Matrix Polynomials and Sets of Bipartite Quantum States}, journal = {Quantum Information and Computation}, volume = {11}, year = {2011}, month = {2001/09/01}, pages = {813{\textendash}819}, abstract = {

In this brief report, we consider the equivalence between two sets of\ m\ + 1 bipartite quantum states under local unitary transformations. For pure states, this problem corresponds to the matrix algebra question of whether two degree m matrix polynomials are unitarily equivalent; i.e.\ UAiV\† =\ Bi\ for 0 \≤\ i\ \≤\ m\ where\ U\ and\ V\ are unitary and (Ai, Bi) are arbitrary pairs of rectangular matrices. We present a randomized polynomial-time algorithm that solves this problem with an arbitrarily high success probability and outputs transforming matrices\ U\ and\ V.

}, keywords = {matrix polynomials, Schwartz-Zippel lemma, unitary transformations}, issn = {1533-7146}, url = {http://dl.acm.org/citation.cfm?id=2230936.2230942}, author = {Chitambar, Eric and Carl Miller and Shi, Yaoyun} } @article {1868, title = {Matrix pencils and entanglement classification}, journal = {Journal of Mathematical Physics}, volume = {51}, year = {2010}, month = {2010/01/01}, pages = {072205}, abstract = {

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 two2\⊗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.

}, issn = {00222488}, doi = {10.1063/1.3459069}, url = {http://scitation.aip.org/content/aip/journal/jmp/51/7/10.1063/1.3459069}, author = {Chitambar, Eric and Carl Miller and Shi, Yaoyun} }