Guardado en:
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2410.16963 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929653353021440 |
|---|---|
| author | Zhang, Jiaxuan Chen, Zhao-Yun Li, Jia-Ning Wei, Tian-Hao Liu, Huan-Yu Zhuang, Xi-Ning Li, Qing-Song Wu, Yu-Chun Guo, Guo-Ping |
| author_facet | Zhang, Jiaxuan Chen, Zhao-Yun Li, Jia-Ning Wei, Tian-Hao Liu, Huan-Yu Zhuang, Xi-Ning Li, Qing-Song Wu, Yu-Chun Guo, Guo-Ping |
| contents | Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed correlated decoding and ``algorithmic fault tolerance" to achieve constant-time logical gates that enables universal quantum computation. However, for circuits involving mid-circuit measurements and feedback, the previous scheme for constant-time logical gates is incompatible with window-based decoding, which is a scalable approach for handling large-scale circuits. In this work, we propose an architecture that employs delayed fixup circuits and window-based correlated decoding, realizing scalable constant-time logical gates. This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates across a broad class of quantum codes. More importantly, by spatial parallelism of windows, this architecture well adapts to time-optimal FTQC, making it particularly useful for large-scale quantum computation. Using Shor's algorithm as an example, we explore the application of our architecture and reveals the promising potential of using constant-time logical gates to perform large-scale quantum computation with acceptable overhead on physical systems like ion traps. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_16963 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding Zhang, Jiaxuan Chen, Zhao-Yun Li, Jia-Ning Wei, Tian-Hao Liu, Huan-Yu Zhuang, Xi-Ning Li, Qing-Song Wu, Yu-Chun Guo, Guo-Ping Quantum Physics Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed correlated decoding and ``algorithmic fault tolerance" to achieve constant-time logical gates that enables universal quantum computation. However, for circuits involving mid-circuit measurements and feedback, the previous scheme for constant-time logical gates is incompatible with window-based decoding, which is a scalable approach for handling large-scale circuits. In this work, we propose an architecture that employs delayed fixup circuits and window-based correlated decoding, realizing scalable constant-time logical gates. This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates across a broad class of quantum codes. More importantly, by spatial parallelism of windows, this architecture well adapts to time-optimal FTQC, making it particularly useful for large-scale quantum computation. Using Shor's algorithm as an example, we explore the application of our architecture and reveals the promising potential of using constant-time logical gates to perform large-scale quantum computation with acceptable overhead on physical systems like ion traps. |
| title | Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2410.16963 |