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 paperPaper 2
Entanglement in XYZ model on a spin-star system: Anisotropy vs. field-induced dynamics
Jithin G. Krishnan, Harikrishnan K. J., Amit Kumar Pal
- Year
- 2023
- Journal
- arXiv preprint
- DOI
- arXiv:2307.15949
- arXiv
- 2307.15949
We consider a star-network of $n=n_0+n_p$ spin-$\frac{1}{2}$ particles, where interaction between $n_0$ central spins and $n_p$ peripheral spins are of the XYZ-type. In the limit $n_0/n_p\ll 1$, we show that for odd $n$, the ground state is doubly degenerate, while for even $n$, the energy gap becomes negligible when $n$ is large, inducing an \emph{effective} double degeneracy. In the same limit, we show that for vanishing $xy$-anisotropy $γ$, bipartite entanglement on the peripheral spins computed using either a partial trace-based, or a measurement-based approach exhibits a logarithmic growth with $n_p$, where the sizes of the partitions are typically $\sim n_p/2$. This feature disappears for $γ\neq 0$, which we refer to as the \emph{anisotropy effect}. Interestingly, when the system is taken out of equilibrium by the introduction of a magnetic field of constant strength on all spins, the time-averaged bipartite entanglement on the periphery at the long-time limit exhibits a logarithmic growth with $n_p$ irrespective of the value of $γ$. We further study the $n_0/n_p\gg 1$ and $n_0/n_p\rightarrow 1$ limits of the model, and show that the behaviour of bipartite peripheral entanglement is qualitatively different from that of the $n_0/n_p\ll 1$ limit.
Open paper