Litcius/Paper detail

Quantum Codes of Maximal Distance and Highly Entangled Subspaces

Huber, Felix, Grassl, Markus

2020Kölner Universitäts PublikationsServer (Universität zu Köln)41 citations

Abstract

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length n of all QMDS codes with local dimension D and distance d >= 3 is bounded by n <= D-2 + d - 2. We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform r-body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.

Topics & Concepts

AlgorithmDimension (graph theory)Linear subspaceSeparable spaceComputer scienceArtificial intelligenceMathematicsCombinatoricsGeometryMathematical analysisQuantum Computing Algorithms and ArchitectureQuantum-Dot Cellular AutomataQuantum Information and Cryptography