Papers › Learning Fourier series with parametrized quantum circuits
Learning Fourier series with parametrized quantum circuits
Dirk Heimann, Hans Hohenfeld, Gunnar Schönhoff, Elie Mounzer, Frank Kirchner
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.
Variational quantum algorithms (VQAs) and their applications in the field of quantum machine learning through parametrized quantum circuits (PQCs) are thought to be one major way of leveraging noisy intermediate-scale quantum computing devices. However, differences in the performance of certain VQA architectures are often unclear since established best practices, as well as detailed studies, are missing. In this paper, we build upon the work by Schuld et al. [Phys. Rev. A 103, 032430 (2021)] and Vidal et al. [Front. Phys. 8, 297 (2020)] by comparing how well popular ans\"atze for PQCs learn different one-dimensional truncated Fourier series. We also examine dissipative quantum neural networks (dQNN) as introduced by Beer et al. [Nat. Commun. 11, 808 (2020)] and propose a data reupload structure for dQNNs to increase their capability for this regression task. By comparing the results for different PQC architectures, we can provide guidelines for designing efficient PQCs.
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