A Constant Rate Quantum Computer on a Line
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917934052409344 |
|---|---|
| author | Gidney, Craig Bergamaschi, Thiago |
| author_facet | Gidney, Craig Bergamaschi, Thiago |
| contents | We prove by construction that the Bravyi-Poulin-Terhal bound on the spatial density of stabilizer codes does not generalize to stabilizer circuits. To do so, we construct a fault tolerant quantum computer with a coding rate above 5% and quasi-polylog time overhead, out of a line of qubits with nearest-neighbor connectivity, and prove it has a threshold. The construction is based on modifications to the tower of Hamming codes of Yamasaki and Koashi (Nature Physics, 2024), with operators measured using a variant of Shor's measurement gadget. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_16132 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Constant Rate Quantum Computer on a Line Gidney, Craig Bergamaschi, Thiago Quantum Physics We prove by construction that the Bravyi-Poulin-Terhal bound on the spatial density of stabilizer codes does not generalize to stabilizer circuits. To do so, we construct a fault tolerant quantum computer with a coding rate above 5% and quasi-polylog time overhead, out of a line of qubits with nearest-neighbor connectivity, and prove it has a threshold. The construction is based on modifications to the tower of Hamming codes of Yamasaki and Koashi (Nature Physics, 2024), with operators measured using a variant of Shor's measurement gadget. |
| title | A Constant Rate Quantum Computer on a Line |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.16132 |