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:2412.08611 · PRX Quantum

Minimizing Resource Overhead in Fusion-Based Quantum Computation Using Hybrid Spin-Photon Devices

Stephen C. Wein, Timothée Goubault de Brugière, Luka Music, P. Senellart, Boris Bourdoncle, Shane Mansfield

Published Nov 17, 2025• 13 citations
arXivHTMLPDF

Abstract

We present three schemes for constructing a (2,2)-Shor-encoded 6-ring photonic resource state for fusion-based quantum computing, each relying on a different type of photon source. We benchmark these architectures by analyzing their ability to achieve the loss tolerance threshold for fusion-based quantum computation using the target resource state. More precisely, we estimate their minimum hardware requirements for fault-tolerant quantum computation in terms of the number of photon sources to achieve on-demand generation of resource states with a desired generation period. Notably, we find that a group of 12 deterministic single-photon sources containing a single matter qubit degree of freedom can produce the target resource state near-deterministically by exploiting entangling gates that are repeated until success. The approach is fully modular, eliminates the need for lossy large-scale multiplexing, and reduces the overhead for resource-state generation by several orders of magnitude compared to architectures using heralded single-photon sources and probabilistic linear-optical entangling gates. Our work shows that the use of deterministic single-photon sources embedding a qubit substantially shortens the path toward fault-tolerant photonic quantum computation.

DOI
10.1103/8l5g-x3b7

Related papers

Practical blueprint for low-depth photonic quantum computing with quantum dots

Ming Lai Chan, Aliki A. Capatos, Peter Lodahl +2 more

Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics requiring only finite-sized entangled resource states followed by linear-optics operations and photon measurements. Large-scale implementations have so far been limited due to the access only to probabilistic photon sources, vulnerability to photon loss, and the need for massive multiplexing. Deterministic photon sources offer an alternative and resource-efficient route. By synergistically integrating deterministic photon emission, adaptive repeat-until-success fusions, and an optimised architectural design, we propose a complete blueprint for a photonic quantum computer using quantum dots and linear optics. It features time-bin qubit encoding, reconfigurable entangled-photon sources, and a fusion-based architecture with low optical connectivity, significantly reducing the required optical depth per photon and resource overheads. We present in detail the hardware required for resource-state generation and fusion networking, experimental pulse sequences, and exact resource estimates for preparing a logical qubit. We estimate that one logical clock cycle of error correction can be executed within microseconds, which scales linearly with the code distance. We also simulate error thresholds for fault-tolerance considering a full catalogue of intrinsic error sources found in real-world quantum dot devices. Our work establishes a practical blueprint for a low-optical-depth, emitter-based fault-tolerant photonic quantum computer.

arXiv:2507.16152•npj Quantum Information•May 14, 2026•4 citations

Tailoring Fusion-Based Photonic Quantum Computing Schemes to Quantum Emitters

Ming Lai Chan, Thomas J. Bell, Love A. Pettersson +4 more

Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. Such operations can be readily implemented with scalable photonic hardware: resource states can be deterministically generated by quantum emitters and fusions require only shallow linear-optical circuits. Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters. We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well above memory-induced errors for typical spin-photon interfaces. Our construction and analysis provide guidelines for the development of photonic quantum hardware targeting fault-tolerant applications with quantum emitters.

arXiv:2410.06784•PRX Quantum•Apr 4, 2025•25 citations

High-Threshold Fusion-Based Quantum Computation with Optical Hybrid Qubits

Seong-Yeop Lim, Jaehak Lee, Nuri Kang +1 more

Hybrid discrete- and continuous-variable (DV-CV) encodings have been developed to overcome operational drawbacks of each individual encoding, while fusion-based quantum computation (FBQC) has emerged to address the practical challenges of scalability toward fault-tolerant photonic quantum computation. Here we introduce hybrid FBQC using small optical DV-CV hybrid resource states connected through hybrid fusions, to combine the advantages of both approaches. We develop protocols for directly generating these resource states without requiring local hybrid logic such as the Hadamard gate, together with a tailored decoding strategy that exploits the error information contained in individual hybrid-fusion outcomes. We demonstrate that hybrid FBQC achieves a photon loss threshold of 2.231% while requiring only 12 hybrid fusions per surface-code unit cell, substantially improving upon the 0.89% threshold and 60-fusion requirement of previous hybrid measurement-based scheme. These results establish optical hybrid FBQC as a high-threshold resource-efficient route to scalable fault-tolerant photonic quantum computation.

quant-pharXiv:2610.38914•Oct 30, 2026•0 citations

Fusion-based quantum computation

Sara Bartolucci, Patrick M. Birchall, Héctor Bombín +10 more

The standard primitives of quantum computing include deterministic unitary entangling gates, which are not natural operations in many systems including photonics. Here, we present fusion-based quantum computation, a model for fault tolerant quantum computing constructed from physical primitives readily accessible in photonic systems. These are entangling measurements, called fusions, which are performed on the qubits of small constant sized entangled resource states. Probabilistic photonic gates as well as errors are directly dealt with by the quantum error correction protocol. We show that this computational model can achieve a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion, which corresponds to a 2.7% probability of loss of each individual photon. The architecture is also highly modular and has reduced classical processing requirements compared to previous photonic quantum computing architectures.

arXiv:2101.09310•Nature Communications•Feb 17, 2023•379 citations

Deterministic Entanglement as a Prerequisite for Scalable Quantum Photonic Resource State Generation

Yorick Reum, Matteo Santandrea, Rohit Prasad +6 more

ABSTRACT As demonstrated experimentally by Prevedel et al., active feed‐forward can render one‐way quantum computation deterministic. An analogous principle applies to the scalable generation of photonic resource states: because each probabilistic photonic fusion operation branches the construction process, the overall success probability shrinks exponentially unless entanglement is generated deterministically. A simple comparative combinatorial resource estimate illustrates the practical consequences of this principle. State‐of‐the‐art fault‐tolerant optical quantum computing architectures incur an unreasonably high single‐photon overhead when relying solely on probabilistic fusion. In contrast, deterministic sources of entangled multi‐photon states, such as semiconductor quantum dots, can reduce the number of required attempts dramatically. Assuming realistic system efficiencies, on average only 15 attempts are needed to generate a 4‐qubit resource state (4‐star), and 89 attempts for a 6‐qubit state (6‐ring), bringing efficient resource state generation in reach with near‐term photonic systems.

Advanced Quantum Technologies•May 1, 2026•1 citation

Generating redundantly encoded resource states for photonic quantum computing

Samuel J. Sheldon, Pieter Kok

Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for constructing sufficiently large photonic cluster states propose fusing many smaller resource states generated by a series of quantum emitters. However, the fusion process is inherently probabilistic with a 50% success probability in standard guise. A recent proposal has shown that, in the limit of low loss, the probability of achieving successful fusion may be boosted to near unity by redundantly encoding the vertices of linear graph states using Greenberger-Horne-Zeilinger states [Quantum 7, 992 (2023)]. Here we present a protocol for deterministically generating redundantly encoded photonic resource states using single quantum emitters, and study the impact of protocol errors and photonic losses on the generated resource states and type-II photonic fusion. Our work provides a route for efficiently constructing complex entangled photonic qubit states for photonic quantum computing and quantum repeaters.

quant-pharXiv:2512.03131•Dec 4, 2025•0 citations
We present three schemes for constructing a (2,2)-Shor-encoded 6-ring photonic resource state for fusion-based quantum computing, each relying on a different type of photon source. We benchmark these architectures by analyzing their ability to achieve the loss tolerance threshold for fusion-based quantum computation using the target resource state. More precisely, we estimate their minimum hardware requirements for fault-tolerant quantum computation in terms of the number of photon sources to achieve on-demand generation of resource states with a desired generation period. Notably, we find that a group of 12 deterministic single-photon sources containing a single matter qubit degree of freedom can produce the target resource state near-deterministically by exploiting entangling gates that are repeated until success. The approach is fully modular, eliminates the need for lossy large-scale multiplexing, and reduces the overhead for resource-state generation by several orders of magnitude compared to architectures using heralded single-photon sources and probabilistic linear-optical entangling gates. Our work shows that the use of deterministic single-photon sources embedding a qubit substantially shortens the path toward fault-tolerant photonic quantum computation.
Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics requiring only finite-sized entangled resource states followed by linear-optics operations and photon measurements. Large-scale implementations have so far been limited due to the access only to probabilistic photon sources, vulnerability to photon loss, and the need for massive multiplexing. Deterministic photon sources offer an alternative and resource-efficient route. By synergistically integrating deterministic photon emission, adaptive repeat-until-success fusions, and an optimised architectural design, we propose a complete blueprint for a photonic quantum computer using quantum dots and linear optics. It features time-bin qubit encoding, reconfigurable entangled-photon sources, and a fusion-based architecture with low optical connectivity, significantly reducing the required optical depth per photon and resource overheads. We present in detail the hardware required for resource-state generation and fusion networking, experimental pulse sequences, and exact resource estimates for preparing a logical qubit. We estimate that one logical clock cycle of error correction can be executed within microseconds, which scales linearly with the code distance. We also simulate error thresholds for fault-tolerance considering a full catalogue of intrinsic error sources found in real-world quantum dot devices. Our work establishes a practical blueprint for a low-optical-depth, emitter-based fault-tolerant photonic quantum computer.
Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. Such operations can be readily implemented with scalable photonic hardware: resource states can be deterministically generated by quantum emitters and fusions require only shallow linear-optical circuits. Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters. We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well above memory-induced errors for typical spin-photon interfaces. Our construction and analysis provide guidelines for the development of photonic quantum hardware targeting fault-tolerant applications with quantum emitters.
Hybrid discrete- and continuous-variable (DV-CV) encodings have been developed to overcome operational drawbacks of each individual encoding, while fusion-based quantum computation (FBQC) has emerged to address the practical challenges of scalability toward fault-tolerant photonic quantum computation. Here we introduce hybrid FBQC using small optical DV-CV hybrid resource states connected through hybrid fusions, to combine the advantages of both approaches. We develop protocols for directly generating these resource states without requiring local hybrid logic such as the Hadamard gate, together with a tailored decoding strategy that exploits the error information contained in individual hybrid-fusion outcomes. We demonstrate that hybrid FBQC achieves a photon loss threshold of 2.231% while requiring only 12 hybrid fusions per surface-code unit cell, substantially improving upon the 0.89% threshold and 60-fusion requirement of previous hybrid measurement-based scheme. These results establish optical hybrid FBQC as a high-threshold resource-efficient route to scalable fault-tolerant photonic quantum computation.
The standard primitives of quantum computing include deterministic unitary entangling gates, which are not natural operations in many systems including photonics. Here, we present fusion-based quantum computation, a model for fault tolerant quantum computing constructed from physical primitives readily accessible in photonic systems. These are entangling measurements, called fusions, which are performed on the qubits of small constant sized entangled resource states. Probabilistic photonic gates as well as errors are directly dealt with by the quantum error correction protocol. We show that this computational model can achieve a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion, which corresponds to a 2.7% probability of loss of each individual photon. The architecture is also highly modular and has reduced classical processing requirements compared to previous photonic quantum computing architectures.
ABSTRACT As demonstrated experimentally by Prevedel et al., active feed‐forward can render one‐way quantum computation deterministic. An analogous principle applies to the scalable generation of photonic resource states: because each probabilistic photonic fusion operation branches the construction process, the overall success probability shrinks exponentially unless entanglement is generated deterministically. A simple comparative combinatorial resource estimate illustrates the practical consequences of this principle. State‐of‐the‐art fault‐tolerant optical quantum computing architectures incur an unreasonably high single‐photon overhead when relying solely on probabilistic fusion. In contrast, deterministic sources of entangled multi‐photon states, such as semiconductor quantum dots, can reduce the number of required attempts dramatically. Assuming realistic system efficiencies, on average only 15 attempts are needed to generate a 4‐qubit resource state (4‐star), and 89 attempts for a 6‐qubit state (6‐ring), bringing efficient resource state generation in reach with near‐term photonic systems.
Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for constructing sufficiently large photonic cluster states propose fusing many smaller resource states generated by a series of quantum emitters. However, the fusion process is inherently probabilistic with a 50% success probability in standard guise. A recent proposal has shown that, in the limit of low loss, the probability of achieving successful fusion may be boosted to near unity by redundantly encoding the vertices of linear graph states using Greenberger-Horne-Zeilinger states [Quantum 7, 992 (2023)]. Here we present a protocol for deterministically generating redundantly encoded photonic resource states using single quantum emitters, and study the impact of protocol errors and photonic losses on the generated resource states and type-II photonic fusion. Our work provides a route for efficiently constructing complex entangled photonic qubit states for photonic quantum computing and quantum repeaters.