Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2506.11975

Comparison of schemes for highly loss tolerant photonic fusion based quantum computing

Sara Bartolucci, Bell, Tom, Héctor Bombín, Patrick M. Birchall, Jacob F. F. Bulmer, Christopher M. Dawson, Terry Farrelly, Samuel Gartenstein, Mercedes Gimeno-Segovia, Daniel Litinski, Ye-Hua Liu, Robert Knegjens, Naomi Nickerson, Andrea Olivo, Mihir Pant, Ashlesha Patil, Sam Roberts, Terry Rudolph, Chris Sparrow, David K. Tuckett, Andrzej Veitia

Published Jun 13, 2025• 0 citations
arXivHTMLPDF

Abstract

We summarize the performance of recently-proposed methods for achieving fault tolerant fusions-based quantum computation with high tolerance to qubit loss, specifically aimed at photonic implementations.
DOI
10.48550/arxiv.2506.11975

Related papers

Fault-tolerant quantum computing with photonics

Mercedes Gimeno-Segovia

General purpose quantum computers will utilize millions of physical qubits, thus requiring an underlying qubit technology that can be manufactured at scale. Integrated silicon photonics is an intrinsically scalable and manufacturable platform where all necessary gates are available to manipulate qubits, encoded in photons, with very high fidelity and low noise. In this talk, we will discuss architectures for fault-tolerant quantum computing with photonics in the newly-introduced fusion-based quantum computing paradigm. Fusion-based quantum computing presents a new framework for fault-tolerant quantum computation, focused on the efficient integration of quantum error correction and physical-level hardware operations. Its primitives, small entangled resource states and projective entangling gates, make it particularly useful in an integrated photonics platform, offering significant architectural simplifications and reducing requirements on physical level operations.

SPIE Quantum West•Mar 4, 2021•1 citation

Analysis of optical loss thresholds in the fusion-based quantum computing architecture

Aleksandr Melkozerov, Ashot S. Avanesov, I. V. Dyakonov +1 more

Bell state measurements (BSMs) play a significant role in quantum information and quantum computing, in particular in fusion-based quantum computing (FBQC). The FBQC model is a framework for universal quantum computing, provided that we are able to perform entangling measurements, called fusions, on qubits within small entangled resource states. Here, we analyze the usage of different linear-optical BSM circuits as fusions in the FBQC schemes and numerically evaluate hardware requirements for fault-tolerance in this framework. We examine and compare the performance of several BSM circuits with varying additional resources and estimate the requirements on losses for every component of the linear-optical realization of fusions under which errors in fusion networks caused by these losses can be corrected. Our results show that fault-tolerant quantum computing in the FBQC model is possible with currently achievable levels of optical losses in an integrated photonic implementation, provided that we can create and detect single photons of the resource states with a total marginal efficiency higher than 0.973.

arXiv:2403.14811•APL Quantum•Sep 1, 2024•8 citations

Fault-Tolerant Quantum Computation

Daniel Gottesman

I give a brief overview of fault-tolerant quantum computation, with an emphasis on recent work and open questions.

arXiv:quant-ph/0701112•Jan 16, 2007•6 citations

Macromux: scalable postselection for high-threshold fault-tolerant quantum computation

Patrick Birchall, Jacob Bridgeman, Christopher Dawson +7 more

We introduce a new resource-efficient scheme for fault-tolerant quantum computation known as `macroscale multiplexing' (or simply `Macromux'), that utilizes scalable postselection to significantly improve the threshold of a given fault-tolerant protocol against both Pauli and erasure errors. Macromux is a hierarchical method for postselecting on constant-size space-time windows of a fault tolerant protocol, requiring only constant additional overheads. The method can be straightforwardly implemented for any fault-tolerant protocol and in any architecture that has access to routing and memory, such as linear-optical fusion-based architectures. We construct fault-tolerant protocols that, to our knowledge, have the highest thresholds in the literature; we perform simulations of fusion-based schemes based on the surface code, showing a maximum possible increase in Pauli thresholds of up to a factor of $\sim6$ (from $1.0\%$ to $5.9\%$). Our schemes are highly-resource efficient, and can for example, double the loss thresholds of some photonic fusion-based protocols using as little as $3 \times$ overhead.

quant-pharXiv:2603.04875•Mar 6, 2026•0 citations

Fault-tolerant integrated photonic quantum computing

Jonathan Lavoie, Blair Morrison

Photonics for Quantum (PfQ)•Aug 2, 2024•0 citations

Deterministic Generation of Concatenated Graph Codes from Quantum Emitters

Love A. Pettersson, Anders Søndberg Sørensen, Stefano Paesani

Photon loss is the dominant noise mechanism in photonic quantum technologies. Designing fault-tolerant schemes with high tolerance to loss is thus a central challenge in scaling photonic quantum information processors. Concatenation of a fault-tolerant construction with a code able to efficiently correct loss is a promising approach to achieve this but practical ways to implement code concatenation with photons have been lacking. We propose schemes for generating concatenated graph codes using multiphoton emission from two quantum emitters or a single quantum emitter coupled to a memory—capabilities available in several photonic platforms. We show that these schemes enable fault-tolerant fusion-based quantum computation in practical regimes with high photon loss and standard fusion gates without the need for auxiliary photons.

arXiv:2406.16684•PRX Quantum•Jan 8, 2025•10 citations
General purpose quantum computers will utilize millions of physical qubits, thus requiring an underlying qubit technology that can be manufactured at scale. Integrated silicon photonics is an intrinsically scalable and manufacturable platform where all necessary gates are available to manipulate qubits, encoded in photons, with very high fidelity and low noise. In this talk, we will discuss architectures for fault-tolerant quantum computing with photonics in the newly-introduced fusion-based quantum computing paradigm. Fusion-based quantum computing presents a new framework for fault-tolerant quantum computation, focused on the efficient integration of quantum error correction and physical-level hardware operations. Its primitives, small entangled resource states and projective entangling gates, make it particularly useful in an integrated photonics platform, offering significant architectural simplifications and reducing requirements on physical level operations.
Bell state measurements (BSMs) play a significant role in quantum information and quantum computing, in particular in fusion-based quantum computing (FBQC). The FBQC model is a framework for universal quantum computing, provided that we are able to perform entangling measurements, called fusions, on qubits within small entangled resource states. Here, we analyze the usage of different linear-optical BSM circuits as fusions in the FBQC schemes and numerically evaluate hardware requirements for fault-tolerance in this framework. We examine and compare the performance of several BSM circuits with varying additional resources and estimate the requirements on losses for every component of the linear-optical realization of fusions under which errors in fusion networks caused by these losses can be corrected. Our results show that fault-tolerant quantum computing in the FBQC model is possible with currently achievable levels of optical losses in an integrated photonic implementation, provided that we can create and detect single photons of the resource states with a total marginal efficiency higher than 0.973.
We introduce a new resource-efficient scheme for fault-tolerant quantum computation known as `macroscale multiplexing' (or simply `Macromux'), that utilizes scalable postselection to significantly improve the threshold of a given fault-tolerant protocol against both Pauli and erasure errors. Macromux is a hierarchical method for postselecting on constant-size space-time windows of a fault tolerant protocol, requiring only constant additional overheads. The method can be straightforwardly implemented for any fault-tolerant protocol and in any architecture that has access to routing and memory, such as linear-optical fusion-based architectures. We construct fault-tolerant protocols that, to our knowledge, have the highest thresholds in the literature; we perform simulations of fusion-based schemes based on the surface code, showing a maximum possible increase in Pauli thresholds of up to a factor of ∼6\sim6∼6 (from 1.0%1.0\%1.0% to 5.9%5.9\%5.9%). Our schemes are highly-resource efficient, and can for example, double the loss thresholds of some photonic fusion-based protocols using as little as 3×3 \times3× overhead.
Photon loss is the dominant noise mechanism in photonic quantum technologies. Designing fault-tolerant schemes with high tolerance to loss is thus a central challenge in scaling photonic quantum information processors. Concatenation of a fault-tolerant construction with a code able to efficiently correct loss is a promising approach to achieve this but practical ways to implement code concatenation with photons have been lacking. We propose schemes for generating concatenated graph codes using multiphoton emission from two quantum emitters or a single quantum emitter coupled to a memory—capabilities available in several photonic platforms. We show that these schemes enable fault-tolerant fusion-based quantum computation in practical regimes with high photon loss and standard fusion gates without the need for auxiliary photons.