The transition to fault-tolerant quantum computation demands specialized compilation strategies to manage fault-tolerant gate execution. Lattice surgery has emerged as the de facto standard for implementing two-qubit gates; however, the relationships between circuit structures and lattice surgery optimizations remain largely unexplored. In this work, we highlight the connection between the mesoscopic community structure of quantum circuits and its impact on compilation performance. Drawing inspiration from classical chip design flows and graph-theoretic concepts, we develop a compiler that optimizes the lattice surgery schedule using a community-based hierarchical qubit layout. Experimental results demonstrate that our method achieves a substantial reduction of up to 84% in code-cycle depth compared to random-layout baselines on a set of standard quantum circuit benchmarks, while performing competitively with recent state-of-the-art lattice-surgery compilers. To further quantify the impact of circuit modularity on compilation efficiency, we generate synthetic circuits using the Stochastic Block Model, showing that our approach achieves, on average, a 32% reduction in code-cycle depth in the high-modularity regime.
Mesoscopic Aware Hierarchical Layouts for Lattice Surgery Quantum Compilation
Giacomo Lancellotti;Giovanni Agosta;Alessandro Barenghi;Gerardo Pelosi
2026-01-01
Abstract
The transition to fault-tolerant quantum computation demands specialized compilation strategies to manage fault-tolerant gate execution. Lattice surgery has emerged as the de facto standard for implementing two-qubit gates; however, the relationships between circuit structures and lattice surgery optimizations remain largely unexplored. In this work, we highlight the connection between the mesoscopic community structure of quantum circuits and its impact on compilation performance. Drawing inspiration from classical chip design flows and graph-theoretic concepts, we develop a compiler that optimizes the lattice surgery schedule using a community-based hierarchical qubit layout. Experimental results demonstrate that our method achieves a substantial reduction of up to 84% in code-cycle depth compared to random-layout baselines on a set of standard quantum circuit benchmarks, while performing competitively with recent state-of-the-art lattice-surgery compilers. To further quantify the impact of circuit modularity on compilation efficiency, we generate synthetic circuits using the Stochastic Block Model, showing that our approach achieves, on average, a 32% reduction in code-cycle depth in the high-modularity regime.| File | Dimensione | Formato | |
|---|---|---|---|
|
Euro-Par_2026_Workshops_paper_8.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
503.08 kB
Formato
Adobe PDF
|
503.08 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



