Papers › Quantum Radio Astronomy: Quantum Linear Solvers for Redundant Baseline Calibration
Quantum Radio Astronomy: Quantum Linear Solvers for Redundant Baseline Calibration
Nicolas Renaud, Pablo Rodríguez-Sánchez, Johan Hidding, P. Chris Broekema
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The computational requirements of future large scale radio telescopes are expected to scale well beyond the capabilities of conventional digital resources. Current and planned telescopes are generally limited in their scientific potential by their ability to efficiently process the vast volumes of generated data. To mitigate this problem, we investigate the viability of emerging quantum computers for radio astronomy applications. In this a paper we demonstrate the potential use of variational quantum linear solvers in Noisy Intermediate Scale Quantum (NISQ) computers and combinatorial solvers in quantum annealers for a radio astronomy calibration pipeline. While we demonstrate that these approaches can lead to satisfying results when integrated in calibration pipelines, we show that current restrictions of quantum hardware limit their applicability and performance.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections