Abstract
The surface code is one of the preferred quantum error correction codes for implementing fault-tolerant quantum computations and lattice surgery is considered being the most resource-efficient method to implement surface code computations. We discuss how to apply queuing theory models for the efficient compilation of lattice surgery quantum circuits. We use queuing theory to optimize the footprint of quantum addition circuits and the depths of quantum multiplication circuits.
| Original language | English |
|---|---|
| Title of host publication | Quantum Computing |
| Subtitle of host publication | Circuits, Systems, Automation and Applications |
| Editors | Himanshu Thapliyal, Travis Humble |
| Publisher | Springer |
| Pages | 141-155 |
| Edition | 1 |
| ISBN (Electronic) | 978-3-031-37966-6 |
| ISBN (Print) | 978-3-031-37965-9 |
| DOIs | |
| Publication status | Published - 2024 |
| MoE publication type | A3 Book section, Chapters in research books |
Keywords
- Quantum computing
- Queuing theory
- Fault-tolerance
- Surface code