Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
DOI10.1088/1751-8121/aaade5zbMath1390.81074arXiv1708.06298OpenAlexW2747039703WikidataQ62593363 ScholiaQ62593363MaRDI QIDQ4565041
Otfried Gühne, Jens Siewert, Felix Michael Huber, Christopher Eltschka
Publication date: 7 June 2018
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.06298
quantum error correcting codesmultipartite entanglementabsolutely maximally entangled statesquantum weight enumerators
Other types of codes (94B60) Quantum coherence, entanglement, quantum correlations (81P40) Quantum coding (general) (81P70)
Related Items (13)
Cites Work
- Unnamed Item
- Unnamed Item
- How entangled can two couples get?
- Bell inequality, Bell states and maximally entangled states for \(n\) qubits
- Graph-based classification of self-dual additive codes over finite fields
- Self-dual codes and invariant theory
- Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- On the Classification of Hermitian Self-Dual Additive Codes Over ${\rm GF}(9)$
- Multiparty entanglement in graph states
- Bloch vectors for qudits
- Evenly distributed unitaries: On the structure of unitary designs
- Nonbinary quantum codes
- Quantum shadow enumerators
- Polynomial invariants of quantum codes
- ON OPTIMAL QUANTUM CODES
- Quantum error correction via codes over GF(4)
- Quantum weight enumerators
- Invariant perfect tensors
This page was built for publication: Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity