Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture
Abstract
A central question for fault-tolerant quantum computing is which quantum error-correcting codes are best suited to a given hardware architecture. Here we compare the Raussendorf--Harrington--Goyal (RHG) code, the Foliated Floquet Color Code (FFCC), and the reduced FFCC in a compound photon--atom architecture that directly generates measurement-based quantum computation (MBQC) resources with near-deterministic photon--atom CZ gates. RHG serves as a natural benchmark, while the FFCC variants allow us to study whether reduced graph degree improves performance under an architecture-aware circuit-level loss model with delayed heralding and correlated bond-loss propagation. We construct two generation schemes compatible with the compound hardware and evaluate circuit-level thresholds under periodic boundary conditions. RHG achieves the highest circuit-level threshold, 2.75%, and its threshold falls below that of reduced FFCC only for large excess loss on intermodule CZ connections. RHG also achieves the lowest logical error rate in most resource-matched comparisons, but some low-loss windows favor reduced FFCC. Overall, we show that when the hardware supports the native gates and connectivity required for MBQC, the benefits of lower graph degree must be weighed against each code's intrinsic IID loss tolerance, generation-scheme details, and hardware-aware resource overhead.
Related
- Shaping of the finite-size chaos crossover in Floquet circuits by coherent-mismatch architecture
- Optimal performance in a chaotic Floquet quantum battery
- A Controlled Study of Memory Hierarchy Transitions in Quantum Circuit Simulation on Apple M4 Pro Unified Memory Architecture
- A no-go theorem for closed timelike curves in globally null-foliated spacetimes
- Performance of the spin qubit shuttling architecture for a surface code implementation
BibTeX
@misc{porath2026circuitlevel,
title = {{Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture}},
author = {Dana Ben Porath and Juval Bechar and Daniel Azses and Yaron Jarach},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.02428},
eprint = {2609.02428},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.02428},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture
AU - Dana Ben Porath
AU - Juval Bechar
AU - Daniel Azses
AU - Yaron Jarach
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2609.02428
UR - https://arxiv.org/abs/2609.02428
AB - A central question for fault-tolerant quantum computing is which quantum error-correcting codes are best suited to a given hardware architecture. Here we compare the Raussendorf--Harrington--Goyal (RHG) code, the Foliated Floquet Color Code (FFCC), and the reduced FFCC in a compound photon--atom architecture that directly generates measurement-based quantum computation (MBQC) resources with near-deterministic photon--atom CZ gates. RHG serves as a natural benchmark, while the FFCC variants allow us to study whether reduced graph degree improves performance under an architecture-aware circuit-level loss model with delayed heralding and correlated bond-loss propagation. We construct two generation schemes compatible with the compound hardware and evaluate circuit-level thresholds under periodic boundary conditions. RHG achieves the highest circuit-level threshold, 2.75%, and its threshold falls below that of reduced FFCC only for large excess loss on intermodule CZ connections. RHG also achieves the lowest logical error rate in most resource-matched comparisons, but some low-loss windows favor reduced FFCC. Overall, we show that when the hardware supports the native gates and connectivity required for MBQC, the benefits of lower graph degree must be weighed against each code's intrinsic IID loss tolerance, generation-scheme details, and hardware-aware resource overhead.
ER -