Fidelity-Aware Channel Allocation in Quantum Repeater Networks using Recursive and Clustered QAOA

Quantum repeater networks(QRN) require efficient resource allocation to maintain highentanglement fidelity under noise and interference. We formulate this problem as a physicsinformedquadratic unconstrained binary optimization (QUBO) and solve it using the QuantumApproximate Optimization Algorithm (QAOA). To enable scalability on Noisy Intermediate-Scale Quantum (NISQ) devices, we introduce a cluster-based variant (CLQAOA) that decomposesthe global problem into smaller subproblems. We compare CLQAOA with classicalmethods, including Greedy and Simulated Annealing, and observe that it achieves nearoptimalsolution quality with controlled runtime scaling. We further incorporate RecursiveQAOA (RQAOA), which improves solution quality through iterative variable reduction butincurs higher computational cost. These results demonstrate that hybrid, cluster-basedquantum optimization provides a practical pathway for scalable quantum repeater networkcontrol, balancing solution quality and computational efficiency.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-03-31
DOI
https://doi.org/10.5281/zenodo.19341093
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fidelity-Aware Channel Allocation in Quantum Repeater Networks using Recursive and Clustered QAOA

Tooba Bibi
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Fidelity-Aware Channel Allocation in Quantum Repeater Networks using Recursive and Clustered QAOA

Tooba Bibi
article en

Abstract

Quantum repeater networks(QRN) require efficient resource allocation to maintain highentanglement fidelity under noise and interference. We formulate this problem as a physicsinformedquadratic unconstrained binary optimization (QUBO) and solve it using the QuantumApproximate Optimization Algorithm (QAOA). To enable scalability on Noisy Intermediate-Scale Quantum (NISQ) devices, we introduce a cluster-based variant (CLQAOA) that decomposesthe global problem into smaller subproblems. We compare CLQAOA with classicalmethods, including Greedy and Simulated Annealing, and observe that it achieves nearoptimalsolution quality with controlled runtime scaling. We further incorporate RecursiveQAOA (RQAOA), which improves solution quality through iterative variable reduction butincurs higher computational cost. These results demonstrate that hybrid, cluster-basedquantum optimization provides a practical pathway for scalable quantum repeater networkcontrol, balancing solution quality and computational efficiency.

Zenodo (CERN European Organization for Nuclear Research)
Decent work and economic growth
Openalex Percentile: Top 28%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fidelity-Aware Channel Allocation in Quantum Repeater Networks using Recursive and Clustered QAOA — Tooba Bibi · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS