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

Physics and High Technology

Hybrid and Fusion Approach for Fault-tolerant Quantum Computing

Jaehak LEE, Wooyeong SONG

Published Oct 31, 2024• 0 citations
Publisher

Abstract

Quantum error correction is an essential tool for performing reliable quantum information processing tasks under noisy circumstances, and is attracting growing attention today as a crucial element for realizing the fault-tolerant quantum computer. In this article, we introduce two cutting-edge quantum error correction techniques for implementing fault-tolerant quantum computation: the hybrid approach and the fusion-based quantum computation. The hybrid quantum computing utilizes hybrid qubits which combine the advantages of continuous-variable and discrete-variable qubits. The fusion-based quantum error correction offers a way, specialized for photonic quantum information processing, toward fault tolerance based on two-qubit measurement, known as fusion. We demonstrate by numerical simulations that our methods achieve the increased loss threshold and the improved resource efficiency compared to previous photonic proposals.

DOI
10.3938/phit.33.027

Related papers

Fault-Tolerant Quantum Computation by Hybrid Qubits with Bosonic Cat Code and Single Photons

Jaehak Lee, Nuri Kang, Seok-Hyung Lee +3 more

Hybridizing different degrees of freedom or physical platforms potentially offers various advantages in building scalable quantum architectures. Here, we introduce a fault-tolerant hybrid quantum computation by building on the advantages of both discrete-variable (DV) and continuous-variable (CV) systems. In particular, we define a CV-DV hybrid qubit with a bosonic cat code and a single photon, which is implementable in current photonic platforms. Due to the cat code encoded in the CV part, the predominant loss errors are readily correctable without multiqubit encoding, while the logical basis is inherently orthogonal due to the DV part. We design fault-tolerant architectures by concatenating hybrid qubits and an outer DV quantum error-correction code such as a topological code, exploring their potential merit in developing scalable quantum computation. We demonstrate by numerical simulations that our scheme is at least an order of magnitude more resource efficient compared to all previous proposals in photonic platforms, allowing us to achieve a record-high loss threshold among existing CV and hybrid approaches. We discuss the realization of our approach not only in all-photonic platforms but also in other hybrid platforms including superconducting and trapped-ion systems, which allows us to find various efficient routes toward fault-tolerant quantum computing. Published by the American Physical Society 2024

arXiv:2401.00450•PRX Quantum•Aug 2, 2024•29 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•519 citations

Highly fault-tolerant quantum computing using both discrete and continuous variables of light

Hyunseok Jeong, Seok-Hyung Lee, S. Omkar +1 more

Fault-tolerant photonic quantum computing schemes have suffered low photon-loss thresholds and heavy resource requirements particularly when using single-photon qubits. Recently, several approaches utilizing both discrete and continuous variables of light have been proposed to reach high photon-loss thresholds with relatively low resource requirements. Here we present two schemes that outperform known previous schemes in terms of photon-loss thresholds and resource overheads. The first one is a hybrid scheme that combines discrete-variable (DV) and continuous-variable (CV) states of light. This scheme is nearly ballistic in the sense that passive measurements with hybrid entangled states are sufficient with little feedforwards. The second scheme is based on the parity-based encoding and Bayesian error tracking that enables one to reach a significantly high photon-loss threshold of ~8.5% with moderate resource requirements compared to previous known schemes.

Quantum 2.0 Conference and Exhibition•Jan 1, 2023•0 citations

Fault-tolerant Technology for Quantum Information Processing and Its Implementation Methods

Yuuki Tokunaga, Yasunari Suzuki, Suguru Endo +1 more

To use quantum information processing in a wide range of applications, fault-tolerant processing is essential to cope with noise.Fault-tolerant quantum computing using quantum error-correcting codes is scalable, but the overhead of number of qubits or processes is large, so improving efficiency is an important research theme.Quantum error mitigation incurs computational cost, but it does not require the overhead of number of qubits, so it is expected to be used for near-future applications.In this article, we introduce our research activities on these topics as well as our studies toward the implementation of quantum information processing.

NTT technical review•May 1, 2021•2 citations

Fault-tolerant quantum computation

Christophe Vuillot

Quantumcomputation is the modern version of Schrödinger’s cat experiment. It is backed up in principle by the theory and thinking about it can make people equally uncomfortable and excited. Besides, its practical realization seems so extremely challenging that some people even doubt it is possible. On the other hand, we are nowadays much closer to realizing quantum computation and in addition, it has much more implications than Schrödinger’s original cat experiment. One of the major difficulties in realizing quantum computation is the inevitable presence of noise in realistic quantum devices which makes the direct realization of quantum computers impossible. In order to protect quantum information and quantum processes against noise, quantum error correction and fault-tolerance have been devised. Although the gap between experiments and the requirements of fault-tolerance is still daunting, the field of quantum error correction and fault-tolerance extends and influences architectural decisions from the hardware to the ideal quantum programs that we want to run. That is why it has the potential to make or break the practicality of quantum computation and a lot of research effort goes into this field. In this thesis we investigate and improve several aspects of fault-tolerant schemes and quantum error correction. We implement an experiment which validates on a small device the usefulness of fault-tolerance for quantum computation. We investigate the advantages of harnessing quantum continuous degrees of freedom present in the lab to protect discrete quantum information in a scalable way. We establish a framework to analyze the fault-tolerant properties of code deformation techniques which are versatile techniques to process quantum information protected by an error correcting code. We also present some novel code deformation techniques with the potential to increase reliability. Finally we define a new class of quantum error correcting codes, quantum pin codes, with built in capabilities for fault-tolerant quantum gates. We give some practical constructions and show some protocols with interesting parameters. The roads towards universal and fault-tolerant quantum computation are still steep but research efforts are pushing in the right directions.

•Dec 16, 2019•2 citations
Quantum error correction is an essential tool for performing reliable quantum information processing tasks under noisy circumstances, and is attracting growing attention today as a crucial element for realizing the fault-tolerant quantum computer. In this article, we introduce two cutting-edge quantum error correction techniques for implementing fault-tolerant quantum computation: the hybrid approach and the fusion-based quantum computation. The hybrid quantum computing utilizes hybrid qubits which combine the advantages of continuous-variable and discrete-variable qubits. The fusion-based quantum error correction offers a way, specialized for photonic quantum information processing, toward fault tolerance based on two-qubit measurement, known as fusion. We demonstrate by numerical simulations that our methods achieve the increased loss threshold and the improved resource efficiency compared to previous photonic proposals.
Hybridizing different degrees of freedom or physical platforms potentially offers various advantages in building scalable quantum architectures. Here, we introduce a fault-tolerant hybrid quantum computation by building on the advantages of both discrete-variable (DV) and continuous-variable (CV) systems. In particular, we define a CV-DV hybrid qubit with a bosonic cat code and a single photon, which is implementable in current photonic platforms. Due to the cat code encoded in the CV part, the predominant loss errors are readily correctable without multiqubit encoding, while the logical basis is inherently orthogonal due to the DV part. We design fault-tolerant architectures by concatenating hybrid qubits and an outer DV quantum error-correction code such as a topological code, exploring their potential merit in developing scalable quantum computation. We demonstrate by numerical simulations that our scheme is at least an order of magnitude more resource efficient compared to all previous proposals in photonic platforms, allowing us to achieve a record-high loss threshold among existing CV and hybrid approaches. We discuss the realization of our approach not only in all-photonic platforms but also in other hybrid platforms including superconducting and trapped-ion systems, which allows us to find various efficient routes toward fault-tolerant quantum computing. Published by the American Physical Society 2024
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.
Fault-tolerant photonic quantum computing schemes have suffered low photon-loss thresholds and heavy resource requirements particularly when using single-photon qubits. Recently, several approaches utilizing both discrete and continuous variables of light have been proposed to reach high photon-loss thresholds with relatively low resource requirements. Here we present two schemes that outperform known previous schemes in terms of photon-loss thresholds and resource overheads. The first one is a hybrid scheme that combines discrete-variable (DV) and continuous-variable (CV) states of light. This scheme is nearly ballistic in the sense that passive measurements with hybrid entangled states are sufficient with little feedforwards. The second scheme is based on the parity-based encoding and Bayesian error tracking that enables one to reach a significantly high photon-loss threshold of ~8.5% with moderate resource requirements compared to previous known schemes.
To use quantum information processing in a wide range of applications, fault-tolerant processing is essential to cope with noise.Fault-tolerant quantum computing using quantum error-correcting codes is scalable, but the overhead of number of qubits or processes is large, so improving efficiency is an important research theme.Quantum error mitigation incurs computational cost, but it does not require the overhead of number of qubits, so it is expected to be used for near-future applications.In this article, we introduce our research activities on these topics as well as our studies toward the implementation of quantum information processing.
Quantumcomputation is the modern version of Schrödinger’s cat experiment. It is backed up in principle by the theory and thinking about it can make people equally uncomfortable and excited. Besides, its practical realization seems so extremely challenging that some people even doubt it is possible. On the other hand, we are nowadays much closer to realizing quantum computation and in addition, it has much more implications than Schrödinger’s original cat experiment. One of the major difficulties in realizing quantum computation is the inevitable presence of noise in realistic quantum devices which makes the direct realization of quantum computers impossible. In order to protect quantum information and quantum processes against noise, quantum error correction and fault-tolerance have been devised. Although the gap between experiments and the requirements of fault-tolerance is still daunting, the field of quantum error correction and fault-tolerance extends and influences architectural decisions from the hardware to the ideal quantum programs that we want to run. That is why it has the potential to make or break the practicality of quantum computation and a lot of research effort goes into this field. In this thesis we investigate and improve several aspects of fault-tolerant schemes and quantum error correction. We implement an experiment which validates on a small device the usefulness of fault-tolerance for quantum computation. We investigate the advantages of harnessing quantum continuous degrees of freedom present in the lab to protect discrete quantum information in a scalable way. We establish a framework to analyze the fault-tolerant properties of code deformation techniques which are versatile techniques to process quantum information protected by an error correcting code. We also present some novel code deformation techniques with the potential to increase reliability. Finally we define a new class of quantum error correcting codes, quantum pin codes, with built in capabilities for fault-tolerant quantum gates. We give some practical constructions and show some protocols with interesting parameters. The roads towards universal and fault-tolerant quantum computation are still steep but research efforts are pushing in the right directions.