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

Topological Quantum Error Correction for Scalable Quantum Networks: A Unified Framework for Fault-Tolerant Distributed Quantum Computing

Uchechukwu Ajuzieogu

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.34129.39528

Related papers

Topological Quantum Error Correction with Tensor-Network Optimization for Scalable Photonic Quantum Computing Architectures

Murali Krishna Pasupuleti

Abstract: This study investigates a topological quantum error-correction framework for scalable photonic quantum-computing architectures in which fusion-based entangling primitives are combined with tensor-network optimization. The central problem addressed is the gap between high-fidelity photonic components and the stringent logical-error rates required for fault-tolerant quantum computation. Photonic platforms offer room-temperature operation, manufacturable silicon-photonic process flows, high-bandwidth optical interconnects and natural compatibility with measurement-based computation; however, photon loss, probabilistic fusion and decoder latency impose architectural constraints that cannot be resolved by hardware fidelity alone. The proposed framework therefore treats hardware metrics, code geometry and decoding as a coupled optimization problem rather than as separate engineering layers. The manuscript develops a mathematically grounded model of surface-code and cluster-state error correction under photonic loss and fusion noise, then evaluates tensor-network contraction as a decoder and resource-allocation method. The data section explicitly uses published real-data-based benchmark inputs from contemporary photonic and quantum-error-correction literature, supplemented by transparent, domain-plausible projections where complete open photonic logical-QEC datasets are not yet available. Results show that tensor-network optimization improves the logical-error index relative to matching-based baselines in the modelled photonic regime, while the feasibility boundary remains dominated by loss, fusion infidelity and real-time decoding latency. The contribution is a reproducible evaluation framework that links topological protection, photonic architecture constraints and decoder design for future scalable fault-tolerant systems. Keywords: topological quantum error correction; surface code; photonic quantum computing; fusion-based quantum computation; tensor-network decoding; loss tolerance; scalable quantum architecture; measurement-based quantum computing; fault tolerance; silicon photonics.

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Jun 10, 2026•6 citations

Quantum Computation with Topological Codes: From Qubit to Topological Fault-Tolerance

Keisuke Fujii

arXiv:1504.01444•SpringerBriefs in mathematical physics•Jan 1, 2015•83 citations

Quantum Error Correction Based Topological Protected Quantum Neural Networks

Jincheng Zhang

This paper proposes a novel architecture for quantum neural networks (QNNs) that leverages the benefits of topological protection and quantum error correction (QEC). The core idea is to construct a QNN based on a network of non-Abelian anyons, exploiting their inherent robustness against local perturbations. We introduce a framework where topological protection significantly reduces the impact of noise on the network, while LDPC (Low-Density Parity-Check) codes are employed to actively correct errors in the quantum information. The resulting system demonstrates a high tolerance to noise, a critical requirement for scalable QNN implementations. This approach represents a significant advancement in QNN design, merging the strengths of topological quantum computing and established QEC techniques. The theoretical framework outlines the key components and provides a pathway toward realizing fault-tolerant QNNs. The proposed architecture offers a promising route toward building practical and reliable quantum computing systems.

•Aug 28, 2026•0 citations

Fault-Tolerant Quantum Error Correction and Fault-Tolerant Quantum Computing

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2021•3 citations

Minimizing Qubit Overhead in Error-Aware Distributed Quantum Computing

Ranjani G. Sundaram, Himanshu Gupta

Scaling fault-tolerant quantum computing to practical advantage requires distributing quantum circuits across networks of heterogeneous processors. However, managing physical qubit overhead while satisfying strict logical error targets remains a critical bottleneck. We introduce the Error-Aware Distributed Quantum Computing (EA-DQC) problem, a unified framework for minimizing the physical footprint of distributed circuits under global error and per-processor capacity constraints. To drive our algorithm design and enable formal performance guarantees, we leverage an aggregation model that frames single-qubit allocation as a Generalized Assignment Problem (GAP), allowing us to prove the optimality of our main algorithm (BPF) in several hardware-specific cases. We also consider the generalized setting of multi-qubit block-encodings, which introduce sub-additive costs and non-monotonic scaling that break standard assignment frameworks, necessitating a density-aware algorithm (BCF-Set) to exploit synergistic resource efficiencies. We evaluate our framework on a diverse set of synthetic and benchmark circuits (QFT, QPE, GHZ) across heterogeneous network topologies. Our results show that our combinatorial heuristics achieve up to a 50% reduction in physical-qubit overhead compared to stochastic baselines such as Simulated Annealing. This work provides a rigorous bridge between quantum error correction and classical optimization, offering a scalable path for resource-efficient faulttolerant distributed quantum architectures.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jun 1, 2026•0 citations

Fault-Tolerant Quantum Error Correction and Fault-Tolerant Quantum Computing

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2012•0 citations
Abstract: This study investigates a topological quantum error-correction framework for scalable photonic quantum-computing architectures in which fusion-based entangling primitives are combined with tensor-network optimization. The central problem addressed is the gap between high-fidelity photonic components and the stringent logical-error rates required for fault-tolerant quantum computation. Photonic platforms offer room-temperature operation, manufacturable silicon-photonic process flows, high-bandwidth optical interconnects and natural compatibility with measurement-based computation; however, photon loss, probabilistic fusion and decoder latency impose architectural constraints that cannot be resolved by hardware fidelity alone. The proposed framework therefore treats hardware metrics, code geometry and decoding as a coupled optimization problem rather than as separate engineering layers. The manuscript develops a mathematically grounded model of surface-code and cluster-state error correction under photonic loss and fusion noise, then evaluates tensor-network contraction as a decoder and resource-allocation method. The data section explicitly uses published real-data-based benchmark inputs from contemporary photonic and quantum-error-correction literature, supplemented by transparent, domain-plausible projections where complete open photonic logical-QEC datasets are not yet available. Results show that tensor-network optimization improves the logical-error index relative to matching-based baselines in the modelled photonic regime, while the feasibility boundary remains dominated by loss, fusion infidelity and real-time decoding latency. The contribution is a reproducible evaluation framework that links topological protection, photonic architecture constraints and decoder design for future scalable fault-tolerant systems. Keywords: topological quantum error correction; surface code; photonic quantum computing; fusion-based quantum computation; tensor-network decoding; loss tolerance; scalable quantum architecture; measurement-based quantum computing; fault tolerance; silicon photonics.
This paper proposes a novel architecture for quantum neural networks (QNNs) that leverages the benefits of topological protection and quantum error correction (QEC). The core idea is to construct a QNN based on a network of non-Abelian anyons, exploiting their inherent robustness against local perturbations. We introduce a framework where topological protection significantly reduces the impact of noise on the network, while LDPC (Low-Density Parity-Check) codes are employed to actively correct errors in the quantum information. The resulting system demonstrates a high tolerance to noise, a critical requirement for scalable QNN implementations. This approach represents a significant advancement in QNN design, merging the strengths of topological quantum computing and established QEC techniques. The theoretical framework outlines the key components and provides a pathway toward realizing fault-tolerant QNNs. The proposed architecture offers a promising route toward building practical and reliable quantum computing systems.
Scaling fault-tolerant quantum computing to practical advantage requires distributing quantum circuits across networks of heterogeneous processors. However, managing physical qubit overhead while satisfying strict logical error targets remains a critical bottleneck. We introduce the Error-Aware Distributed Quantum Computing (EA-DQC) problem, a unified framework for minimizing the physical footprint of distributed circuits under global error and per-processor capacity constraints. To drive our algorithm design and enable formal performance guarantees, we leverage an aggregation model that frames single-qubit allocation as a Generalized Assignment Problem (GAP), allowing us to prove the optimality of our main algorithm (BPF) in several hardware-specific cases. We also consider the generalized setting of multi-qubit block-encodings, which introduce sub-additive costs and non-monotonic scaling that break standard assignment frameworks, necessitating a density-aware algorithm (BCF-Set) to exploit synergistic resource efficiencies. We evaluate our framework on a diverse set of synthetic and benchmark circuits (QFT, QPE, GHZ) across heterogeneous network topologies. Our results show that our combinatorial heuristics achieve up to a 50% reduction in physical-qubit overhead compared to stochastic baselines such as Simulated Annealing. This work provides a rigorous bridge between quantum error correction and classical optimization, offering a scalable path for resource-efficient faulttolerant distributed quantum architectures.