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:1909.05086 · Linear Algebra and its Applications

On the preservers of maximally entangled states

Benjamin Großmann, Hugo J. Woerdeman

Published Sep 5, 2019• 0 citations
arXivHTMLPDF
DOI
10.1016/j.laa.2019.09.004

Related papers

Preservers of maximally entangled states

Edward Poon

Linear Algebra and its Applications•Mar 26, 2014•6 citations

Cloning the entanglement of a pair of quantum bits

L.-P. Lamoureux, Patrick Navez, Jaromír Fiurášek +1 more

It is shown that any quantum operation that perfectly clones the entanglement of all maximally entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning of entanglement is nevertheless allowed by quantum mechanics. We investigate a separability-preserving optimal cloning machine that duplicates all maximally entangled states of two qubits, resulting in 0.285 bits of entanglement per clone, while a local cloning machine only yields 0.060 bits of entanglement per clone.

arXiv:quant-ph/0302173•Physical Review A•Apr 5, 2004•29 citations

Necessary condition for local distinguishability of maximally entangled states: Beyond orthogonality preservation

Tanmay Singal, Ramij Rahaman, Sibasish Ghosh A +1 more

The (im)possibility of local distinguishability of orthogonal multipartite quantum states still remains an intriguing question. Beyond ${\mathbb{C}}^{3}\ensuremath{\bigotimes}{\mathbb{C}}^{3}$, the problem remains unsolved even for maximally entangled states (MESs). So far, the only known condition for the local distinguishability of states is the well-known orthogonality preservation (OP). Using an upper bound on the locally accessible information for bipartite states, we derive a very simple necessary condition for any set of pairwise orthogonal MESs in ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}$ to be perfectly locally distinguishable. It is seen that particularly when the number of pairwise orthogonal MES states in ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}$ is equal to $d$, then this necessary condition, along with the OP condition, imposes more constraints (for said states to be perfectly locally distinguishable) than the OP condition does. When testing this condition for the local distinguishability of all sets of four generalized Bell states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, we find that it is not only necessary but also sufficient to determine their local distinguishability. This demonstrates that the aforementioned upper bound may play a significant role in the general scenario of local distinguishability of bipartite states.

arXiv:1506.03667•Physical Review A•Oct 11, 2017•19 citations

Universal maximally entangled states

M. Revzen

Quantum Studies Mathematics and Foundations•Sep 23, 2014•2 citations

Maximally entangled states and the Bell inequality

Jose Luis Cereceda

arXiv:quant-ph/9812012•Physics Letters A•Mar 1, 1996•9 citations

Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose

William Matthews, Andreas Winter

Motivated by the desire to better understand the class of quantum operations on bipartite systems that completely preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure-state transformations by PPT operations. Restricting our attention to the case in which we start with a rank $\mathit{K}$ maximally entangled state, we give a necessary condition for transforming it into a given pure state, which we show is also sufficient when $\mathit{K}$ is 2 and the final state has Schmidt rank 3. We show that it is sufficient for all $\mathit{K}$ and all final states provided a conjecture about a certain family of semidefinite programs is true. We also demonstrate that the phenomenon of catalysis can occur under PPT operations and that, unlike LOCC catalysis, a maximally entangled state can be a catalyst. Finally, we give a necessary and sufficient condition for the possibility of transforming a rank $\mathit{K}$ maximally entangled state to an arbitrary pure state by PPT operations assisted by some maximally entangled catalyst.

arXiv:0801.4322•Physical Review A•Jul 10, 2008•21 citations
It is shown that any quantum operation that perfectly clones the entanglement of all maximally entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning of entanglement is nevertheless allowed by quantum mechanics. We investigate a separability-preserving optimal cloning machine that duplicates all maximally entangled states of two qubits, resulting in 0.285 bits of entanglement per clone, while a local cloning machine only yields 0.060 bits of entanglement per clone.
The (im)possibility of local distinguishability of orthogonal multipartite quantum states still remains an intriguing question. Beyond ${\mathbb{C}}^{3}\ensuremath{\bigotimes}{\mathbb{C}}^{3}$, the problem remains unsolved even for maximally entangled states (MESs). So far, the only known condition for the local distinguishability of states is the well-known orthogonality preservation (OP). Using an upper bound on the locally accessible information for bipartite states, we derive a very simple necessary condition for any set of pairwise orthogonal MESs in ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}$ to be perfectly locally distinguishable. It is seen that particularly when the number of pairwise orthogonal MES states in ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}$ is equal to ddd, then this necessary condition, along with the OP condition, imposes more constraints (for said states to be perfectly locally distinguishable) than the OP condition does. When testing this condition for the local distinguishability of all sets of four generalized Bell states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, we find that it is not only necessary but also sufficient to determine their local distinguishability. This demonstrates that the aforementioned upper bound may play a significant role in the general scenario of local distinguishability of bipartite states.
Motivated by the desire to better understand the class of quantum operations on bipartite systems that completely preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure-state transformations by PPT operations. Restricting our attention to the case in which we start with a rank K\mathit{K}K maximally entangled state, we give a necessary condition for transforming it into a given pure state, which we show is also sufficient when K\mathit{K}K is 2 and the final state has Schmidt rank 3. We show that it is sufficient for all K\mathit{K}K and all final states provided a conjecture about a certain family of semidefinite programs is true. We also demonstrate that the phenomenon of catalysis can occur under PPT operations and that, unlike LOCC catalysis, a maximally entangled state can be a catalyst. Finally, we give a necessary and sufficient condition for the possibility of transforming a rank K\mathit{K}K maximally entangled state to an arbitrary pure state by PPT operations assisted by some maximally entangled catalyst.