Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation

Quantum-network simulations are discretely random, making it difficult to extract derivatives. We solve this using a recent machine-learning technique called stochastic automatic differentiation and showcase it by optimizing the placement of quantum repeaters and more.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.1364/quantum.2025.qw3a.14
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

Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation

Guus Avis, Stefan Krastanov
Quantum Computing Algorithms and Architecture
article

Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation

Guus Avis, Stefan Krastanov
article en

Abstract

Quantum-network simulations are discretely random, making it difficult to extract derivatives. We solve this using a recent machine-learning technique called stochastic automatic differentiation and showcase it by optimizing the placement of quantum repeaters and more.

University of Massachusetts Amherst (US)
Openalex Percentile: Top 91%
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.

Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation — Guus Avis, Stefan Krastanov · (2025) | TGRS Research Map | TGRS