Mostrar el registro sencillo del ítem
Quantum Tanner codes
| hal.structure.identifier | Cryptologie symétrique, cryptologie fondée sur les codes et information quantique [COSMIQ] | |
| dc.contributor.author | LEVERRIER, Anthony | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Cryptologie symétrique, cryptologie fondée sur les codes et information quantique [COSMIQ] | |
| dc.contributor.author | ZÉMOR, Gilles | |
| dc.date.accessioned | 2024-04-04T02:36:39Z | |
| dc.date.available | 2024-04-04T02:36:39Z | |
| dc.date.conference | 2022-10-31 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/190735 | |
| dc.description.abstractEn | Tanner codes are long error correcting codes obtained from short codes and a graph, with bits on the edges and parity-check constraints from the short codes enforced at the vertices of the graph. Combining good short codes together with a spectral expander graph yields the celebrated expander codes of Sipser and Spielman, which are asymptotically good classical LDPC codes. In this work we apply this prescription to the left-right Cayley complex that lies at the heart of the recent construction of a c3 locally testable code by Dinur et al. Specifically, we view this complex as two graphs that share the same set of edges. By defining a Tanner code on each of those graphs we obtain two classical codes that together define a quantum code. This construction can be seen as a simplified variant of the Panteleev and Kalachev asymptotically good quantum LDPC code, with improved estimates for its minimum distance. This quantum code is closely related to the Dinur et al. code in more than one sense: indeed, we prove a theoremthat simultaneously gives a linearly growing minimum distance for the quantum code and recovers the local testability of the Dinur et al. code. | |
| dc.description.sponsorship | From NISQ to LSQ: Bosonic and LDPC codes - ANR-22-PETQ-0006 | |
| dc.language.iso | en | |
| dc.publisher | IEEE | |
| dc.subject.en | Quantum error correcting code | |
| dc.subject.en | Computer science | |
| dc.subject.en | Codes | |
| dc.subject.en | Quantum computing | |
| dc.subject.en | Quantum mechanics | |
| dc.subject.en | Parity check codes | |
| dc.subject.en | Graph theory | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/FOCS54457.2022.00117 | |
| dc.subject.hal | Physique [physics]/Physique Quantique [quant-ph] | |
| dc.identifier.arxiv | 2202.13641v3 | |
| bordeaux.page | 872-883 | |
| 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 | FOCS 2022 - IEEE 63rd Annual Symposium on Foundations of Computer Science | |
| bordeaux.country | US | |
| bordeaux.conference.city | Denver | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-03926730 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2022-11-03 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| dc.title.pt | Quantum Tanner codes | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-03926730v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.spage=872-883&rft.epage=872-883&rft.au=LEVERRIER,%20Anthony&Z%C3%89MOR,%20Gilles&rft.genre=unknown |
Archivos en el ítem
| Archivos | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay archivos asociados a este ítem. |
|||