Correlated decoding of logical algorithms with transversal gates
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_ | 1866912312059756544 |
|---|---|
| author | Cain, Madelyn Zhao, Chen Zhou, Hengyun Meister, Nadine Ataides, J. Pablo Bonilla Jaffe, Arthur Bluvstein, Dolev Lukin, Mikhail D. |
| author_facet | Cain, Madelyn Zhao, Chen Zhou, Hengyun Meister, Nadine Ataides, J. Pablo Bonilla Jaffe, Arthur Bluvstein, Dolev Lukin, Mikhail D. |
| contents | Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates (Bluvstein et al., Nature 626, 58-65 (2024)), we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Clifford transversal entangling gates, and explore two decoders offering different computational runtimes and accuracies. In particular, by leveraging the deterministic propagation of stabilizer measurement errors through transversal Clifford gates, we find that correlated decoding enables the number of noisy syndrome extraction rounds between these gates to be reduced from $O(d)$ to $O(1)$ in Clifford circuits, where $d$ is the code distance. We verify numerically that this approach substantially reduces the space-time cost of deep logical Clifford circuits. These results demonstrate that correlated decoding provides a major advantage in early fault-tolerant computation, as realized in recent experiments, and further indicate it has considerable potential to reduce the space-time cost in large-scale logical algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_03272 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Correlated decoding of logical algorithms with transversal gates Cain, Madelyn Zhao, Chen Zhou, Hengyun Meister, Nadine Ataides, J. Pablo Bonilla Jaffe, Arthur Bluvstein, Dolev Lukin, Mikhail D. Quantum Physics Disordered Systems and Neural Networks Statistical Mechanics Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates (Bluvstein et al., Nature 626, 58-65 (2024)), we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Clifford transversal entangling gates, and explore two decoders offering different computational runtimes and accuracies. In particular, by leveraging the deterministic propagation of stabilizer measurement errors through transversal Clifford gates, we find that correlated decoding enables the number of noisy syndrome extraction rounds between these gates to be reduced from $O(d)$ to $O(1)$ in Clifford circuits, where $d$ is the code distance. We verify numerically that this approach substantially reduces the space-time cost of deep logical Clifford circuits. These results demonstrate that correlated decoding provides a major advantage in early fault-tolerant computation, as realized in recent experiments, and further indicate it has considerable potential to reduce the space-time cost in large-scale logical algorithms. |
| title | Correlated decoding of logical algorithms with transversal gates |
| topic | Quantum Physics Disordered Systems and Neural Networks Statistical Mechanics |
| url | https://arxiv.org/abs/2403.03272 |