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

• URL: http://arxiv.org/abs/2403.14811v2
• Date: Tue, 2 Apr 2024 12:42:58 GMT
• Title: Analysis of optical loss thresholds in the fusion-based quantum computing architecture
• Abstract summary: We show that fault-tolerant quantum computing is possible with currently achievable levels of optical losses in an integrated photonic implementation. 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.
• Score: 41.94295877935867
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bell state measurements (BSM) 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 analyse 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.

Related papers

• Limits of heralded photonic Bell-state generation in the presence of loss [0.0]
  High-quality entangled states of photons underlie quantum information science (QIS) applications across communication, sensing, and computing.<n>In many discrete-variable photonic QIS architectures, large application-ready states are constructed via fusion measurements on small entangled seed states.<n>We analyze five heralded schemes for generating event-ready photonic Bell states, contrasting their heralding probabilities, fidelities, and error robustness.
  arXiv  Detail & Related papers  (2026-08-03T00:12:50Z)
• Suppressing the Erasure Error of Fusion Operation in Photonic Quantum Computing [27.632599278683898]
  Photonic quantum computing provides a promising route toward quantum computation.<n>Quantum fusion operations are vulnerable to two major error sources: fusion failure and fusion erasure.<n>We propose tree-encoded fusion, an encoding strategy that suppresses erasure errors during graph-state generation.
  arXiv  Detail & Related papers  (2026-04-23T09:33:38Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Quantum Circuit-Based Adaptation for Credit Risk Analysis [27.308408027453012]
  Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation.<n>We experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis.
  arXiv  Detail & Related papers  (2026-01-11T11:17:37Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Tailoring fusion-based photonic quantum computing schemes to quantum emitters [0.0]
  Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. 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.
  arXiv  Detail & Related papers  (2024-10-09T11:31:49Z)
• Machine Learning Methods as Robust Quantum Noise Estimators [0.0]
  We show how traditional machine learning models can estimate quantum noise by analyzing circuit composition. Our results illustrate how this approach can accurately predict the robustness of circuits with a low error rate. These techniques can be used to assess the quality and security of quantum code, leading to more reliable quantum products.
  arXiv  Detail & Related papers  (2024-09-23T09:00:12Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Quantum Volume for Photonic Quantum Processors [15.3862808585761]
  Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts. Most metrics such as randomized benchmarking and quantum volume were originally introduced for circuit-based quantum computers. We present a framework to map physical noises and imperfections in MBQC processes to logical errors in equivalent quantum circuits.
  arXiv  Detail & Related papers  (2022-08-24T18:05:16Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Parity-encoding-based quantum computing with Bayesian error tracking [0.0]
  Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture. We propose a linear optical topological MBQC protocol employing multiphoton qubits based on the parity encoding. We show that our protocol is advantageous over several other existing approaches in terms of fault-tolerance, resource overhead, or feasibility of basic elements.
  arXiv  Detail & Related papers  (2022-07-14T10:32:05Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.