Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909553015128064 |
|---|---|
| author | Shaw, Mackenzie H. Terhal, Barbara M. |
| author_facet | Shaw, Mackenzie H. Terhal, Barbara M. |
| contents | In Ref. [1], Bravyi et al. found examples of Bivariate Bicycle (BB) codes with similar logical performance to the surface code but with an improved encoding rate. In this work, we generalize a novel parity-check circuit design principle called morphing circuits and apply it to BB codes. We define a new family of BB codes whose parity check circuits require a qubit connectivity of degree five instead of six while maintaining their numerical performance. Logical input/output to an ancillary surface code is also possible in a biplanar layout. Finally, we develop a general framework for designing morphing circuits and present a sufficient condition for its applicability to two-block group algebra codes
[1] S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, Nature 627, 778 (2024). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_16336 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits Shaw, Mackenzie H. Terhal, Barbara M. Quantum Physics In Ref. [1], Bravyi et al. found examples of Bivariate Bicycle (BB) codes with similar logical performance to the surface code but with an improved encoding rate. In this work, we generalize a novel parity-check circuit design principle called morphing circuits and apply it to BB codes. We define a new family of BB codes whose parity check circuits require a qubit connectivity of degree five instead of six while maintaining their numerical performance. Logical input/output to an ancillary surface code is also possible in a biplanar layout. Finally, we develop a general framework for designing morphing circuits and present a sufficient condition for its applicability to two-block group algebra codes [1] S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, Nature 627, 778 (2024). |
| title | Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2407.16336 |