EUVIMEDEUVIMED entdecken
Crossref

Lowering Connectivity Requirements for Bivariate Bicycle Codes Using Morphing Circuits

Mackenzie H Shaw, Barbara M Terhal

Physical Review Letters · 04.03.2025 · 134 (9)

DOI: 10.1103/physrevlett.134.090602 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Physical Review Letters, online erschienen am 04.03.2025. Verfasst von Mackenzie H Shaw und 1 weiteren Autor:innen. Beteiligte Einrichtung: Delft University of Technology, QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands and Delft Institute of Applied M…. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 21 Literaturangaben. Gefördert von: Nederlandse Organisatie voor Wetenschappelijk Onderzoek, European Commission.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In reference Bravyi et al., [Nature (London) 627, 778 (2024)NATUAS0028-083610.1038/s41586-024-07107-7], 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 or 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.

Autor:innen und Institutionen

  • Delft University of Technology, QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands and Delft Institute of Applied Mathematics, Mekelweg 4, 2628 CD Delft, The Netherlands.

Förderung

  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek
  • European Commission

Zitieren

APA

Shaw, M. H., & Terhal, B. M. (2025). Lowering Connectivity Requirements for Bivariate Bicycle Codes Using Morphing Circuits. Physical Review Letters, 134(9). https://doi.org/10.1103/physrevlett.134.090602

Vancouver

Shaw MH, Terhal BM. Lowering Connectivity Requirements for Bivariate Bicycle Codes Using Morphing Circuits. Physical Review Letters. 2025;134(9). doi:10.1103/physrevlett.134.090602

BibTeX
@article{Shaw2025,
  author = {Shaw, Mackenzie H and Terhal, Barbara M},
  title = {Lowering Connectivity Requirements for Bivariate Bicycle Codes Using Morphing Circuits},
  journal = {Physical Review Letters},
  year = {2025},
  volume = {134},
  number = {9},
  doi = {10.1103/physrevlett.134.090602}
}
Kostenlos starten →