arXiv Analytics

Sign in

arXiv:1010.1018 [quant-ph]AbstractReferencesReviewsResources

Deciding Unitary Equivalence Between Matrix Polynomials and Sets of Bipartite Quantum States

Eric Chitambar, Carl A. Miller, Yaoyun Shi

Published 2010-10-05Version 1

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. $UA_iV^\dagger=B_i$ for $0\leq i\leq m$ where $U$ and $V$ are unitary and $(A_i, B_i)$ 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$.

Related articles: Most relevant | Search more
arXiv:1103.0766 [quant-ph] (Published 2011-03-03)
Symmetric extension of bipartite quantum states and its use in quantum key distribution with two-way postprocessing
arXiv:0808.3298 [quant-ph] (Published 2008-08-25, updated 2008-10-04)
On classes of local unitary transformations
arXiv:quant-ph/0304196 (Published 2003-04-29, updated 2004-04-13)
Distilling common randomness from bipartite quantum states