Towards Local Testability for Quantum Coding
| hal.structure.identifier | Cryptologie symétrique, cryptologie fondée sur les codes et information quantique [COSMIQ] | |
| dc.contributor.author | LEVERRIER, Anthony | |
| hal.structure.identifier | Cryptologie symétrique, cryptologie fondée sur les codes et information quantique [COSMIQ] | |
| dc.contributor.author | LONDE, Vivien | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | ZÉMOR, Gilles | |
| dc.date.accessioned | 2024-04-04T02:47:22Z | |
| dc.date.available | 2024-04-04T02:47:22Z | |
| dc.date.conference | 2021-01-06 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191636 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.publisher | Schloss Dagstuhl | |
| dc.subject.en | Quantum error correcting code | |
| dc.title.en | Towards Local Testability for Quantum Coding | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.4230/LIPIcs.ITCS.2021.65 | |
| dc.subject.hal | Physique [physics]/Physique Quantique [quant-ph] | |
| bordeaux.page | 65:1--65:11 | |
| bordeaux.volume | 185 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | ITCS 2021 - 12th Conference on Innovations in Theoretical Computer Science | |
| bordeaux.country | US | |
| bordeaux.conference.city | Washington / Virtual | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-03135738 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2021-01-08 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-03135738v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.volume=185&rft.spage=65:1--65:11&rft.epage=65:1--65:11&rft.au=LEVERRIER,%20Anthony&LONDE,%20Vivien&Z%C3%89MOR,%20Gilles&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||