Robust and Scalable Quantum Repeaters Using Machine Learning
Diego Fuentealba, Jackson Dahn, James Steck and 1 more
Information · 2025
doi:10.3390/info16070552 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
References30
30 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.