Optimization of quantum-repeater networks using stochastic automatic differentiation

Quantum repeaters are envisioned to enable long-distance entanglement distribution. Analysis of quantum-repeater networks could hasten their realization by informing design decisions and research priorities. Determining derivatives of network properties is crucial toward that end, facilitating optimizations and revealing parameter sensitivity. Doing so, however, is difficult because the networks are discretely random. Here we use a recently developed technique, stochastic automatic differentiation, to automatically extract derivatives from discrete Monte Carlo simulations of repeater networks. With these derivatives, we optimize rate-fidelity tradeoffs in a repeater chain, determine the chain's sensitivity with respect to the coherence times of different nodes, and finally choose the locations of quantum repeaters in a two-dimensional plane to optimize the guaranteed quality of service between four end nodes. In particular, the technique enabled us to discover how the best achievable quality of service, the minimal number of repeaters required to improve a network, and the number of repeaters required to saturate the network scale with the physical size of the network.

Authors

Institutions

Publication Details

Journal
Physical Review Research
Published
2025-06-02
DOI
https://doi.org/10.1103/2g9m-h3jm
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
7.44

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of quantum-repeater networks using stochastic automatic differentiation

Karl J. Friston
3 citations
Physical Review Research
Quantum Computing Algorithms and Architecture
7.44
article

Optimization of quantum-repeater networks using stochastic automatic differentiation

Karl J. Friston
article en
3 citations

Abstract

Quantum repeaters are envisioned to enable long-distance entanglement distribution. Analysis of quantum-repeater networks could hasten their realization by informing design decisions and research priorities. Determining derivatives of network properties is crucial toward that end, facilitating optimizations and revealing parameter sensitivity. Doing so, however, is difficult because the networks are discretely random. Here we use a recently developed technique, stochastic automatic differentiation, to automatically extract derivatives from discrete Monte Carlo simulations of repeater networks. With these derivatives, we optimize rate-fidelity tradeoffs in a repeater chain, determine the chain's sensitivity with respect to the coherence times of different nodes, and finally choose the locations of quantum repeaters in a two-dimensional plane to optimize the guaranteed quality of service between four end nodes. In particular, the technique enabled us to discover how the best achievable quality of service, the minimal number of repeaters required to improve a network, and the number of repeaters required to saturate the network scale with the physical size of the network.

Physical Review ResearchVol. 7(3)
University of Massachusetts Amherst (US)
National Science Foundation
Openalex Percentile: Top 3%
Quantum Computing Algorithms and Architecture
7.44
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.

Optimization of quantum-repeater networks using stochastic automatic differentiation — Karl J. Friston · Physical Review Research (2025) | TGRS Research Map | TGRS