Robust and Scalable Quantum Repeaters Using Machine Learning

Quantum repeaters are integral systems to quantum computing and quantum communication as they allow the transfer of information between qubits, particularly over long distances. Because of the “no-cloning theorem,” which says that general quantum states cannot be directly copied, one cannot perform signal amplification in the usual way. The standard approach uses entanglement swapping, in which quantum states are teleported from one (short) segment to the next, using at each step a shared entangled pair. This is the job of the repeater. In general, this requires reliable quantum memories and shared entanglement resources, which are vulnerable to noise and decoherence. It is also difficult to manually create and implement the quantum algorithm for the swap circuit as the size of the system increases. Here, we propose a different approach: to use machine learning to train a repeater node. To demonstrate the feasibility of this method, the system is simulated in MATLAB 2022a. Training is conducted for a system of 2 qubits. It is then scaled up, with no additional training, to systems of 4, 6, and 8 qubits using transfer learning. Finally, the systems are tested in noisy conditions. The results show that the scale-up is very effective and relatively easy, and the effects of noise and decoherence are reduced as the size of the system increases.

Authors

Institutions

Publication Details

Journal
Information
Published
2025-06-28
DOI
https://doi.org/10.3390/info16070552
Citations
1
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust and Scalable Quantum Repeaters Using Machine Learning

Elizabeth Behrman, James E. Steck, Diego Fuentealba, Jackson Dahn
1 citations
Information
Quantum Information and Cryptography
2.48
article

Robust and Scalable Quantum Repeaters Using Machine Learning

Elizabeth Behrman, James E. Steck, Diego Fuentealba, Jackson Dahn
article en
1 citations

Abstract

Quantum repeaters are integral systems to quantum computing and quantum communication as they allow the transfer of information between qubits, particularly over long distances. Because of the “no-cloning theorem,” which says that general quantum states cannot be directly copied, one cannot perform signal amplification in the usual way. The standard approach uses entanglement swapping, in which quantum states are teleported from one (short) segment to the next, using at each step a shared entangled pair. This is the job of the repeater. In general, this requires reliable quantum memories and shared entanglement resources, which are vulnerable to noise and decoherence. It is also difficult to manually create and implement the quantum algorithm for the swap circuit as the size of the system increases. Here, we propose a different approach: to use machine learning to train a repeater node. To demonstrate the feasibility of this method, the system is simulated in MATLAB 2022a. Training is conducted for a system of 2 qubits. It is then scaled up, with no additional training, to systems of 4, 6, and 8 qubits using transfer learning. Finally, the systems are tested in noisy conditions. The results show that the scale-up is very effective and relatively easy, and the effects of noise and decoherence are reduced as the size of the system increases.

InformationVol. 16(7)
University of Arizona (US), Wichita State University (US)
Openalex Percentile: Top 10%
Quantum Information and Cryptography
2.48
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.