Asymptotic entanglement transformation between W and GHZ states
From MaRDI portal
Publication:5178183
DOI10.1063/1.4908106zbMath1345.81015arXiv1310.3244OpenAlexW3122919078MaRDI QIDQ5178183
Péter Vrana, Matthias Christandl
Publication date: 13 March 2015
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.3244
Quantum computation (81P68) Many-body theory; quantum Hall effect (81V70) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Descriptive complexity and finite models (68Q19) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items
Universal points in the asymptotic spectrum of tensors ⋮ Multipartite quantum correlations: symplectic and algebraic geometry approach ⋮ Generating multi-photon W-like states for perfect quantum teleportation and superdense coding ⋮ A note on the gap between rank and border rank ⋮ Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces ⋮ Tensor surgery and tensor rank ⋮ Asymptotic tensor rank of graph tensors: beyond matrix multiplication ⋮ A family of multipartite entanglement measures ⋮ A Genuine Multipartite Entanglement Measure Generated by the Parametrized Entanglement Measure ⋮ The Hackbusch conjecture on tensor formats ⋮ Entanglement distillation from Greenberger-Horne-Zeilinger shares ⋮ Unnamed Item ⋮ Barriers for fast matrix multiplication from irreversibility ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings ⋮ Entanglement classification with algebraic geometry
Cites Work
- Matrix multiplication via arithmetic progressions
- Comparability of multipartite entanglement
- Gaussian elimination is not optimal
- Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
- Tripartite Entanglement Transformations and Tensor Rank
- Relative bilinear complexity and matrix multiplication.
- Approximate Solutions for the Bilinear Form Computational Problem
- Partial and Total Matrix Multiplication
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression