Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
arXiv:1910.12789 · doi:10.1103/PhysRevResearch.2.033411
Abstract
Pure multipartite quantum states of n parties and local dimension q are called k-uniform if all reductions to k parties are maximally mixed. These states are relevant for our understanding of multipartite entanglement, quantum information protocols, and the construction of quantum error correction codes. To our knowledge, the only known systematic construction of these quantum states is based on classical error correction codes. We present a systematic method to construct other examples of k-uniform states and show that the states derived through our construction are not equivalent to any k-uniform state constructed from the so-called maximum distance separable error correction codes. Furthermore, we use our method to construct several examples of absolutely maximally entangled states whose existence was open so far.
5 pages, 2 figures, Comments are very welcome!
References in corpus (3)
Cited by in corpus (23)
- Strong quantum nonlocality with entanglement
- A complete hierarchy for the pure state marginal problem in quantum mechanics
- Construction and local equivalence of dual-unitary operators: from dynamical maps to quantum combinatorial designs
- Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
- Holographic Codes from Hyperinvariant Tensor Networks
- Deterministic generation of qudit photonic graph states from quantum emitters
- Modifying method of constructing quantum codes from highly entangled states
- Simple sufficient condition for subspace to be completely or genuinely entangled
- Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
- Multipartite entanglement and quantum error identification in -dimensional cluster states
- Symmetries & Correlations in Continous Time Crystals
- Quantum -uniform states from quantum orthogonal arrays
- Finding maximal quantum resources
- Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
- The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
- Finite-Function-Encoding Quantum States
- Multipartite entanglement structures in quantum stabilizer states
- Covering a Graph with Minimal Local Sets
- Absolutely maximally entangled pure states of multipartite quantum systems
- Trade-off between Information Gain and Disturbance in Local Discrimination of Entangled Quantum States
- -Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
- Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding
- Scalable and fault-tolerant preparation of encoded k-uniform states