Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions
arXiv:1705.00006 · doi:10.1103/PhysRevA.96.032330
Abstract
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis.
arXiv comment19 pages, 7 figures, published version
References in corpus (26)
- Quantum entanglement
- Mixed State Entanglement and Quantum Error Correction
- Quantum secret sharing
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Classical simulation of quantum many-body systems with a tree tensor network
- A Schmidt number for density matrices
- Sequential generation of entangled multi-qubit states
- The asymptotic entanglement cost of preparing a quantum state
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- The maximally entangled set of multipartite quantum states
- Sequential Generation of Matrix-Product States in Cavity QED
- Rapid adiabatic preparation of injective PEPS and Gibbs states
- Binary search trees for generalized measurement
- Entangled pure state transformations via local operations assisted by finitely many rounds of classical communication
- Entanglement cost in practical scenarios
- Entanglement manipulation of multipartite pure states with finite rounds of classical communication
- Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
- Preparing projected entangled pair states on a quantum computer
- Quantum union bounds for sequential projective measurements
- Multipartite secret key distillation and bound entanglement
- Multi-copy and stochastic transformation of multipartite pure states
- Preparing topological PEPS on a quantum computer
- Network coding for distributed quantum computation over cluster and butterfly networks
- Quantum communication cost of preparing multipartite entanglement
- Building multiparticle states with teleportation
- Relation between the Greenberger-Horne-Zeilinger--entanglement cost of preparing a multipartite pure state and its quantum discord
Cited by in corpus (11)
- Tools for quantum network design
- Multipartite entanglement outperforming bipartite entanglement under limited quantum system sizes
- Linear programs for entanglement and key distribution in the quantum internet
- Union bound for quantum information processing
- Asymptotic survival of genuine multipartite entanglement in noisy quantum networks depends on the topology
- Hierarchy of quantum operations in manipulating coherence and entanglement
- Entanglement cost for infinite-dimensional physical systems
- Distributed Encoding and Decoding of Quantum Information over Networks
- Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication
- Identifying families of multipartite states with non-trivial local entanglement transformations
- Distillation of multipartite entangled states for arbitrary subsets of parties in noisy quantum networks of increasing size