Predictive Window Decoding for Fault-Tolerant Quantum Programs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915051365990400 |
|---|---|
| author | Viszlai, Joshua Chadwick, Jason D. Joshi, Sarang Ravi, Gokul Subramanian Li, Yanjing Chong, Frederic T. |
| author_facet | Viszlai, Joshua Chadwick, Jason D. Joshi, Sarang Ravi, Gokul Subramanian Li, Yanjing Chong, Frederic T. |
| contents | Real-time decoding is a key ingredient in future fault-tolerant quantum systems, yet many decoders are too slow to run in real time. Prior work has shown that parallel window decoding schemes can scalably meet throughput requirements in the presence of increasing decoding times, given enough classical resources. However, windowed decoding schemes require that some decoding tasks be delayed until others have completed, which can be problematic during time-sensitive operations such as T gate teleportation, leading to suboptimal program runtimes. To alleviate this, we introduce a speculative window decoding scheme. Taking inspiration from branch prediction in classical computer architecture our decoder utilizes a light-weight speculation step to predict data dependencies between adjacent decoding windows, allowing multiple layers of decoding tasks to be resolved simultaneously. Through a state-of-the-art compilation pipeline and a detailed simulator, we find that speculation reduces application runtimes by 40% on average compared to prior parallel window decoders. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_05115 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Predictive Window Decoding for Fault-Tolerant Quantum Programs Viszlai, Joshua Chadwick, Jason D. Joshi, Sarang Ravi, Gokul Subramanian Li, Yanjing Chong, Frederic T. Quantum Physics Real-time decoding is a key ingredient in future fault-tolerant quantum systems, yet many decoders are too slow to run in real time. Prior work has shown that parallel window decoding schemes can scalably meet throughput requirements in the presence of increasing decoding times, given enough classical resources. However, windowed decoding schemes require that some decoding tasks be delayed until others have completed, which can be problematic during time-sensitive operations such as T gate teleportation, leading to suboptimal program runtimes. To alleviate this, we introduce a speculative window decoding scheme. Taking inspiration from branch prediction in classical computer architecture our decoder utilizes a light-weight speculation step to predict data dependencies between adjacent decoding windows, allowing multiple layers of decoding tasks to be resolved simultaneously. Through a state-of-the-art compilation pipeline and a detailed simulator, we find that speculation reduces application runtimes by 40% on average compared to prior parallel window decoders. |
| title | Predictive Window Decoding for Fault-Tolerant Quantum Programs |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2412.05115 |