LEVERRIER, Anthony; LONDE, Vivien; ZÉMOR, Gilles

doi:10.22331/q-2022-02-24-661

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

LEVERRIER, Anthony
Cryptologie symétrique, cryptologie fondée sur les codes et information quantique [COSMIQ]

LONDE, Vivien
Microsoft Research

ZÉMOR, Gilles
Institut de Mathématiques de Bordeaux [IMB]

Idioma

Article de revue

Este ítem está publicado en

Quantum. 2022-02-18, vol. 6, p. 661

Verein

Resumen en inglés

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the p-faces of the n-cube (for n > p) and stabilizer constraints with faces of dimension (p ± 1). The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into N = 2 n−p−1 n p physical qubits and displays local testability with a soundness of Ω(1/ log(N)) beating the current state-of-the-art of 1/ log 2 (N) due to Hastings. We exploit this local testability to devise an efficient decoding algorithm that corrects arbitrary errors of size less than the minimum distance, up to polylog factors. We then extend this code family by considering the quotient of the n-cube by arbitrary linear classical codes of length n. We establish the parameters of these generalized hemicubic codes. Interestingly, if the soundness of the hemicubic code could be shown to be constant, similarly to the ordinary n-cube, then the generalized hemicubic codes could yield quantum locally testable codes of length not exceeding an exponential or even polynomial function of the code dimension. 1< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

Towards local testability for quantum coding

Idioma

Este ítem está publicado en

Resumen en inglés

URI

DOI

Orígen

Centros de investigación