Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture
summary
The gist
Measurement-based quantum computation (MBQC) proceeds by preparing an entangled resource state, typically a cluster state, and consuming it through single-qubit measurements, which is particularly
In short
This study compared three measurement-based quantum computation codes—RHG, FFCC, and reduced FFCC—using a photon-atom architecture with CZ gates. It found that while RHG has the highest threshold (2.75%), performance ordering reverses when intermodule loss is high. The optimal code depends on the specific operating loss probability and hardware details.
Key concepts
- Measurement-based quantum computation (MBQC)
- MBQC is a method of quantum computation that uses a highly entangled resource state, like a cluster state, and performs computations by making single-qubit measurements on this state. It is particularly well-suited for photonic systems because photons are easy to generate and manipulate.
- Circuit-level loss model
- This model calculates the probability of errors occurring at every step of the quantum circuit. It accounts for specific hardware losses, such as photon loss during CZ gates or errors caused by bond-loss propagation between gates, allowing researchers to predict how much noise a code can tolerate.
- Code Threshold
- The threshold is the maximum physical error rate (loss probability) at which a quantum computation can still succeed with high fidelity. A higher threshold means the code is more robust against noise during the computation.
Terminology used across episodes
This episode discusses
- Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture · Paper Radio
- Blueprint for a fault-tolerant compound photon-atom quantum architecture
- How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits · Paper Radio
- Nonlinear Coupling between Motional Modes in Trapped Ion Quantum Processors
- Fault-tolerant quantum computation with a neutral atom processor
- Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage
- Enhanced Fault-tolerance in Photonic Quantum Computing: Comparing the Honeycomb Floquet Code and the Surface Code in Tailored Architecture
- Low-distance Surface Codes under Realistic Quantum Noise
- Surface code off-the-hook: diagonal syndrome-extraction scheduling
- Switch networks for photonic fusion-based quantum computing
- Interleaving: Modular architectures for fault-tolerant photonic quantum computing
- Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation
The paper
Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture · Read on arXiv
Quantum Source Labs
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.
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: Today's paper: "Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture".
Mira: Measurement-based quantum computation (MBQC) proceeds by preparing an entangled resource state, typically a cluster state, and consuming it through single-qubit measurements, which is particularly well suited to photonic architectures.
Kai: First, who's behind it and why it matters.
Paper summary: Kai: So, looking at this paper again, we’ve seen how they compared RHG against FFCC and rFFCC specifically within this compound photon–atom architecture to figure out circuit-level loss performance.
Mira: It boils down to the fact that while RHG has the highest threshold of two point seven five percent under uniform loss, that advantage can be eroded if there's a lot of excess loss on those intermodule CZ connections, which then favors the reduced FFCC in certain scenarios.
Lev: I think what’s compelling here is that they didn't just test one scenario; they looked at different generation schemes too, which suggests this isn't just a theoretical exercise in code comparison.
Kai: And the authors are trying to map this onto real hardware constraints by detailing how photon loss during CZ gates and correlated Pauli errors from bond-loss propagation affect the logical error rate scaling.
Mira: That analysis of the logical error rate scaling, using that formula where LER scales as p/p th beta d, suggests that even though reduced FFCC has a lower intrinsic threshold of thirteen point five percent under an IID loss model, it can become favorable at specific low loss probabilities depending on the active-atom cost per unit distance.
Lev: That resource constraint discussion is crucial for us; if we're building these systems, knowing when the overhead difference between the codes starts paying off in terms of actual qubit count is what matters most for implementation.
Kai: So, in simple terms, this paper shows that you can't just pick a code based on its graph degree alone; you have to consider the hardware-aware resource overhead and the specific loss profile you're dealing with.
Mira: That’s right; the choice between RHG and rFFCC isn't fixed but depends entirely on whether your system suffers more from uniform loss or localized connectivity issues in those CZ connections.
Lev: It provides a solid framework for us to predict how these codes will behave when we start building these systems, especially regarding that scaling exponent beta they found.
Conclusion: Kai: So, we've been looking at how this paper compared three different Measurement-Based Quantum Computation codes—RHG, FFCC, and reduced FFCC—specifically focusing on their performance when running on a compound photon–atom architecture with realistic loss models. Mira, looking at the title of this paper now, "Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture," what do you think that tells us about where the current bottlenecks are in building these systems?
Mira: I think it immediately signals that we need to move past just looking at the theoretical error rates under ideal conditions; they’re explicitly tying circuit-level loss performance directly to the specific hardware setup, which is really important because those physical constraints dictate whether a code actually works or not. Kai, when you look at the authors and what they've done with these codes—RHG versus FFCC—it seems like they are really showing how graph structure isn't the only thing that matters here.
Kai: Exactly; I mean, looking at the actual experiment setup described in this paper, it sounds like they built a system where photons interact with atoms via near-deterministic CZ gates and then tracked all that loss during the process. Lev, from your perspective as someone who has to actually run this on real hardware, what does seeing those specific threshold numbers—like two point seven five percent for RHG compared to thirteen point five percent for the reduced FFCC—mean in terms of feasibility?
Lev: Those thresholds are critical because they give us a concrete metric for how much overhead we can tolerate before the computation breaks down, and it shows that even with a lower intrinsic tolerance like the reduced FFCC, if the hardware is structured right or if you keep your loss low enough, you can still achieve a reasonable threshold. Kai, when you talk about what was actually built and cooled and measured in this study—the generation schemes like bipartite versus STAP—does that physical reality change how we interpret those theoretical thresholds?
Kai: It does; the different generation schemes introduce different types of loss channels, like the bond-loss propagation they modeled, which means a code might look good on paper but fail practically because of how the photons and atoms are physically routed during the sequence. Mira, when you consider that correlation between Pauli errors caused by missing CZ gates—that E Sk = one/two rho + one/two Z Sk rho Z Sk channel—how does that affect your view on the underlying assumptions of those MBQC codes?
Mira: That specific model is what makes it so deep; it shows that the loss isn't just simple independent qubit errors, but a correlated dephasing channel that directly affects the logical integrity based on where in the graph you lose a connection, which pushes our understanding toward more realistic noise models. Lev, if we were to run this on real hardware now, what kind of practical advice would you give about which code is safer when dealing with those intermodule connections having high loss?
Lev: I'd say that for systems where the physical layout means certain CZ connections are inherently noisier than others, the reduced FFCC might be a better starting point because its lower overhead per unit distance could compensate for some of that intrinsic loss tolerance gap. Kai, what do you think is the biggest takeaway from this comparison regarding how we should design our next generation of photon–atom quantum processors?
More episodes
- 2610.01068-Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes
- 2610.01074-The stationarity test: a framework for learning quantum many-body systems from their thermal states
- 2610.01094-Quantum synchronization in atom-cavity coupled systems
- 2610.01402-Transport theory for a generic two-arm co-propagating Majorana interferometer with Majorana fermion and edge vortex tunneling
- 2610.01167-Vector chiral order and dynamical quantum phase transitions in an Ising chain with dimerized anisotropic Gamma interaction
- 2610.01163-Robustness hierarchy of bipartite quantum correlations under noisy dynamics
- 2610.01183-Additive solid immersion lenses for enhanced collection efficiency of shallow NV centers by pulsed laser deposition and structurization of high-k amorphous oxides
- 2610.01112-Dissipation-Sensitivity Trade-Off in Dissipative Bosonic Systems
- 2610.01099-Constant-Per-Layer-Depth MPS-Pretrained Ansatz for Noisy Distributed Quantum Processors
- 2610.01141-Classical Hardness of Learning Functions of Hamiltonians