aiqbench analysis
This research presents $\text{R}^2$-PQF, a runtime routing protocol that dynamically manages probabilistic quantum circuits to reduce $T$-gate counts without incurring latency penalties. By implementing Wavefront Breadth-First Search on high-speed FPGAs and ASICs, the method achieves up to 1.76x speedup over stalling-based baselines for large-scale Ising Hamiltonian simulations. The work directly addresses critical bottlenecks in fault-tolerant quantum computing by resolving dynamic lattice surgery constraints in real-time.
Runtime Compilation for Quantum Circuits with PQF-Enabled $R_z$ Synthesis
arXiv:2611.04075v1 Announce Type: new Abstract: In Fault-Tolerant Quantum Computing (FTQC) using surface codes, reducing $T$-count is critical for efficient computation due to the high cost of $T$-state distillation. Probabilistic Quantum Circuit with Fallback (PQF) synthesis significantly lowers $T$-counts compared to standard protocols like Gridsynth, but introduces high circuit dynamism through extra gates inserted at runtime. This dynamism invalidates static compile-time routing, as these new $T$ gates require dynamic lattice surgery routing to establish non-intersecting ancilla paths to $T$-state factories while minimizing total execution time. To address this, we introduce $\text{R}^2$-PQF, a Runtime Routing protocol for PQF-synthesized quantum circuits. $\text{R}^2$-PQF dynamically routes gates layer-by-layer, computing paths during the execution of the previous logical timestep. To satisfy the strict computational window of $\sim t_{lattice\_surgery} + t_{reaction}$ and non-intersectionality constraints, we implement a Wavefront Breadth-First Search (W-BFS) and synthesise it on a 500MHz FPGA and 2 GHz ASIC. For a clock cycle of 2GHz, we achieve a median logical time-step of $1.51 \mu s$ for a 300 qubit Ising Hamiltonian circuit, demonstrating that $\text{R}^2$-PQF successfully resolves the vast majority of paths (with rare exceptions) within the execution window and enables the $T$-count benefits of PQF without latency penalties. Compared to a baseline stalling-based solution (the only no-runtime-recomputation solution), $\text{R}^2$-PQF speeds up circuit execution by $1.34\times$ on average and up to $1.76 \times$.
Abstract:In Fault-Tolerant Quantum Computing (FTQC) using surface codes, reducing $T$-count is critical for efficient computation due to the high cost of $T$-state distillation. Probabilistic Quantum Circuit with Fallback (PQF) synthesis significantly lowers $T$-counts compared to standard protocols like Gridsynth, but introduces high circuit dynamism through extra gates inserted at runtime. This dynamism invalidates static compile-time routing, as these new $T$ gates require dynamic lattice surgery routing to establish non-intersecting ancilla paths to $T$-state factories while minimizing total execution time. To address this, we introduce $\text{R}^2$-PQF, a Runtime Routing protocol for PQF-synthesized quantum circuits. $\text{R}^2$-PQF dynamically routes gates layer-by-layer, computing paths during the execution of the previous logical timestep. To satisfy the strict computational window of $\sim t_{lattice\_surgery} + t_{reaction}$ and non-intersectionality constraints, we implement a Wavefront Breadth-First Search (W-BFS) and synthesise it on a 500MHz FPGA and 2 GHz ASIC. For a clock cycle of 2GHz, we achieve a median logical time-step of $1.51 \mu s$ for a 300 qubit Ising Hamiltonian circuit, demonstrating that $\text{R}^2$-PQF successfully resolves the vast majority of paths (with rare exceptions) within the execution window and enables the $T$-count benefits of PQF without latency penalties. Compared to a baseline stalling-based solution (the only no-runtime-recomputation solution), $\text{R}^2$-PQF speeds up circuit execution by $1.34\times$ on average and up to $1.76 \times$.
arXiv:2611.04075 [quant-ph]
(or arXiv:2611.04075v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2611.04075 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 305 words