Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces

DOI10.1007/s00220-017-3077-5zbMath1386.81030arXiv1612.06491MaRDI QIDQ2413447

Youming Qiao, Runyao Duan, Yinan Li, Xin Wang

Publication date: 10 April 2018

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.06491

zbMATH Keywords

maximal Schmidt rank; SCLOCC; tripartite pure state

Mathematics Subject Classification ID

81P15: Quantum measurement theory, state operations, state preparations

94A17: Measures of information, entropy

46A32: Spaces of linear operators; topological tensor products; approximation properties

94A05: Communication theory

81P40: Quantum coherence, entanglement, quantum correlations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial degree bounds for matrix semi-invariants
• Matching theory
• Vector spaces of matrices of low rank
• Hardness vs randomness
• Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
• Classical complexity and quantum entanglement
• Unital quantum channels - convex structure and revivals of Birkhoff's theorem
• Non-commutative Edmonds' problem and matrix semi-invariants
• The Hilbert null-cone on tuples of matrices and bilinear forms
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• Quantum Communication with Zero-Capacity Channels
• Localizable entanglement
• Tripartite Entanglement Transformations and Tensor Rank
• Random Bipartite Entanglement from<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>W</mml:mi></mml:math>and<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>W</mml:mi></mml:math>-Like States
• Tensor rank is NP-complete
• Primality and identity testing via Chinese remaindering
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Singular spaces of matrices and their application in combinatorics
• Designing programs that check their work
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Semidefinite Programming Strong Converse Bounds for Classical Capacity
• On Representatives of Subsets
• Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
• Asymptotic entanglement transformation between W and GHZ states
• Deterministic Polynomial Time Algorithms for Matrix Completion Problems
• Systems of distinct representatives and linear algebra
• The Embedding of Firs in Skew Fields
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Semi-invariants of quivers as determinants
• Semi-invariants of quivers for arbitrary dimension vectors