Asymptotic entanglement transformation between W and GHZ states
From MaRDI portal
Publication:5178183
DOI10.1063/1.4908106zbMath1345.81015arXiv1310.3244MaRDI 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
81P68: Quantum computation
81V70: Many-body theory; quantum Hall effect
81P15: Quantum measurement theory, state operations, state preparations
81P40: Quantum coherence, entanglement, quantum correlations
68Q19: Descriptive complexity and finite models
81P45: Quantum information, communication, networks (quantum-theoretic aspects)
Related Items
Unnamed Item, Universal points in the asymptotic spectrum of tensors, Barriers for fast matrix multiplication from irreversibility, Entanglement classification with algebraic geometry, A family of multipartite entanglement measures, A Genuine Multipartite Entanglement Measure Generated by the Parametrized Entanglement Measure, Generating multi-photon W-like states for perfect quantum teleportation and superdense coding, The Hackbusch conjecture on tensor formats, Entanglement distillation from Greenberger-Horne-Zeilinger shares, The asymptotic induced matching number of hypergraphs: balanced binary strings, Multipartite quantum correlations: symplectic and algebraic geometry approach, 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
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