Compare Papers

Paper 1

Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture

Kun Liu, Ben Foxman, Gian-Luca R. Anselmetti, Yongshan Ding

Year

2026

Journal

arXiv preprint

DOI

arXiv:2604.20013

arXiv

2604.20013

Early modular fault tolerant quantum computers remain constrained by costly inter-module communication and limited magic state factory service. Understanding such bottlenecks and investigating compiler optimizations most close the gap between algorithm requirements and hardware capabilities is a concrete and practically urgent systems problem. We study the modular architectures based on Bivariate Bicycle codes and identify the dominant bottleneck: inter-module communication induced by non-Clifford operations. We build a compilation pipeline to fill the missing parts of prior works and propose compiler optimizations: synthesizing arbitrary-angle rotations at the factory (syn@fac), transvection based Clifford deferral, and Clifford insertion for critical path duration reduction. We extend the evaluation scope of the prior work to 40+ benchmark categories drawn from PennyLane and MQTBench, including quantum algorithms and Hamiltonian simulations with varying sizes. Under the present instruction cost, syn@fac reduces estimated circuit failure probability by a factor of 9.0 on average across non-Clifford benchmarks. The robustness persists across sweeps of instruction cost ratios, LPU count, and factory count. Besides, transvection reduces Clifford deferral compile time by 77.04\%, while Clifford insertion reduces end-to-end circuit duration by 11.54\% on average on MQTBench, with smaller gains on Hamiltonian simulations. We hope this work inspires the studies on compiler optimizations for early modular FTQC systems.

Open paper

Paper 2

Critical properties of the Anderson transition in random graphs: two-parameter scaling theory, Kosterlitz-Thouless type flow and many-body localization

Ignacio García-Mata, John Martin, Olivier Giraud, Bertrand Georgeot, Rémy Dubertrand, Gabriel Lemarié

Year

2022

Journal

arXiv preprint

DOI

arXiv:2209.04337

arXiv

2209.04337

The Anderson transition in random graphs has raised great interest, partly because of its analogy with the many-body localization (MBL) transition. Unlike the latter, many results for random graphs are now well established, in particular the existence and precise value of a critical disorder separating a localized from an ergodic delocalized phase. However, the renormalization group flow and the nature of the transition are not well understood. In turn, recent works on the MBL transition have made the remarkable prediction that the flow is of Kosterlitz-Thouless type. Here we show that the Anderson transition on graphs displays the same type of flow. Our work attests to the importance of rare branches along which wave functions have a much larger localization length $ξ_\parallel$ than the one in the transverse direction, $ξ_\perp$. Importantly, these two lengths have different critical behaviors: $ξ_\parallel$ diverges with a critical exponent $ν_\parallel=1$, while $ξ_\perp$ reaches a finite universal value ${ξ_\perp^c}$ at the transition point $W_c$. Indeed, $ξ_\perp^{-1} \approx {ξ_\perp^c}^{-1} + ξ^{-1}$, with $ξ\sim (W-W_c)^{-ν_\perp}$ associated with a new critical exponent $ν_\perp = 1/2$, where $\exp( ξ)$ controls finite-size effects. The delocalized phase inherits the strongly non-ergodic properties of the critical regime at short scales, but is ergodic at large scales, with a unique critical exponent $ν=1/2$. This shows a very strong analogy with the MBL transition: the behavior of $ξ_\perp$ is identical to that recently predicted for the typical localization length of MBL in a phenomenological renormalization group flow. We demonstrate these important properties for a smallworld complex network model and show the universality of our results by considering different network parameters and different key observables of Anderson localization.

Open paper