Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
From MaRDI portal
Publication:4565041
Abstract: A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The existence of such states is in many cases unclear. With the help of the weight enumerator machinery known from quantum error correction and the generalized shadow inequalities, we obtain new bounds on the existence of AME states in dimensions larger than two. To complete the treatment on the weight enumerator machinery, the quantum MacWilliams identity is derived in the Bloch representation. Finally, we consider AME states whose subsystems have different local dimensions, and present an example for a system that shows maximal entanglement across every bipartition.
Recommendations
- Optimal quantum error correcting codes from absolutely maximally entangled states
- Absolutely maximally entangled states from phase states
- Absolutely maximally entangled states in tripartite heterogeneous systems
- Multipartite entanglement states of higher uniformity
- The criterion of maximally four- and five-qubit entangled states via monogamy linear entropy relations
Cites work
- scientific article; zbMATH DE number 5320282 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Bell inequality, Bell states and maximally entangled states for \(n\) qubits
- Bloch vectors for qudits
- Evenly distributed unitaries: On the structure of unitary designs
- Graph-based classification of self-dual additive codes over finite fields
- Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- How entangled can two couples get?
- Invariant perfect tensors
- Multiparty entanglement in graph states
- Nonbinary quantum codes
- ON OPTIMAL QUANTUM CODES
- On the Classification of Hermitian Self-Dual Additive Codes Over ${\rm GF}(9)$
- Polynomial invariants of quantum codes
- Quantum error correction via codes over GF(4)
- Quantum shadow enumerators
- Quantum weight enumerators
- Self-dual codes and invariant theory
Cited in
(19)- Shor–Laflamme distributions of graph states and noise robustness of entanglement
- The fastest generation of multipartite entanglement with natural interactions
- Multi-directional unitarity and maximal entanglement in spatially symmetric quantum states
- Holographic tensor networks from hyperbolic buildings
- Local indistinguishability and incompleteness of entangled orthogonal bases: method to generate two-element locally indistinguishable ensembles
- Quantum version of Euler's problem: a geometric perspective
- An algorithm to explore entanglement in small systems
- Absolutely maximally entangled states in tripartite heterogeneous systems
- Separability of heterogeneous quantum systems using multipartite concurrence and tangle
- No invariant perfect qubit codes
- Absolutely maximally entangled states from phase states
- Positive maps and trace polynomials from the symmetric group
- Planar \(k\)-uniform states: a generalization of planar maximally entangled states
- Optimal quantum error correcting codes from absolutely maximally entangled states
- New monogamy relations for multiqubit systems
- Multipartite entanglement states of higher uniformity
- Quantum error-correcting codes and their geometries
- Multiparticle singlet states cannot be maximally entangled for the bipartitions
- Some Ulam's reconstruction problems for quantum states
This page was built for publication: Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565041)
