Towards fault-tolerant quantum computation with universal continuous-variable gates
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908409077432320 |
|---|---|
| author | Blair, Sheron Arzani, Francesco Ferrini, Giulia Ferraro, Alessandro |
| author_facet | Blair, Sheron Arzani, Francesco Ferrini, Giulia Ferraro, Alessandro |
| contents | Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational universality was introduced in [Phys. Rev. Lett. 82, 1784 (1999)], and has proven especially successful since it allows for the identification of finite sets of universal CV gates independent of the encoding scheme. However, achieving the critical objective of fault-tolerant computation requires some form of encoding, and to date there has been no proof that these universal CV gates can lead to encoded fault tolerance. We present compelling evidence in this direction by utilizing the Gottesman-Kitaev-Preskill (GKP) encoding. Specifically, we numerically optimize the generation of GKP states from vacua using circuits comprised solely of universal CV gates. We demonstrate that these states can be attained with sufficient quality to exhibit error probabilities lower than the threshold needed to achieve a fault-tolerant memory via concatenated GKP-stabilizer codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13643 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Towards fault-tolerant quantum computation with universal continuous-variable gates Blair, Sheron Arzani, Francesco Ferrini, Giulia Ferraro, Alessandro Quantum Physics Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational universality was introduced in [Phys. Rev. Lett. 82, 1784 (1999)], and has proven especially successful since it allows for the identification of finite sets of universal CV gates independent of the encoding scheme. However, achieving the critical objective of fault-tolerant computation requires some form of encoding, and to date there has been no proof that these universal CV gates can lead to encoded fault tolerance. We present compelling evidence in this direction by utilizing the Gottesman-Kitaev-Preskill (GKP) encoding. Specifically, we numerically optimize the generation of GKP states from vacua using circuits comprised solely of universal CV gates. We demonstrate that these states can be attained with sufficient quality to exhibit error probabilities lower than the threshold needed to achieve a fault-tolerant memory via concatenated GKP-stabilizer codes. |
| title | Towards fault-tolerant quantum computation with universal continuous-variable gates |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2506.13643 |