Popov A, Meyer N, Scherer DD, Dietl G (2026)
Publication Type: Conference contribution
Publication year: 2026
Publisher: Institute of Electrical and Electronics Engineers Inc.
Conference Proceedings Title: 2026 International Conference on Quantum Control, Computing and Learning, qCCL 2026
Event location: Aalborg, DNK
ISBN: 9798319518651
DOI: 10.1109/qCCL70331.2026.11668561
Fault-tolerant quantum computing hinges on efficient logical compilation, in particular, translating high-level circuits into code-compatible implementations. Gate-by-gate compilation often yields deep circuits, requiring significant overhead to ensure fault-tolerance. As an alternative, we investigate the compilation of primitives from quantum simulation as single blocks. We focus our study on the [[n,n-2,2]] code family, which allows for the exhaustive comparison of potential compilation primitives on small circuit instances. Based upon that, we then introduce a methodology that lifts these primitives into size-invariant, depth-efficient compilation strategies. This recovers known methods for circuits with moderate Hadamard counts and yields improved realizations for sparse and dense placements. Simulations show significant error-rate reductions in the compiled circuits. We envision the approach as a core component of peephole-based compilers. Its flexibility and low hand-crafting burden potentially enable extension to other circuit structures and code families.
APA:
Popov, A., Meyer, N., Scherer, D.D., & Dietl, G. (2026). Optimized Compilation of Logical Clifford Circuits. In 2026 International Conference on Quantum Control, Computing and Learning, qCCL 2026. Aalborg, DNK: Institute of Electrical and Electronics Engineers Inc..
MLA:
Popov, Alexander, et al. "Optimized Compilation of Logical Clifford Circuits." Proceedings of the 2026 International Conference on Quantum Control, Computing and Learning, qCCL 2026, Aalborg, DNK Institute of Electrical and Electronics Engineers Inc., 2026.
BibTeX: Download