Papers › Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
Mudassir Moosa, Thomas W. Watts, Yiyou Chen, Abhijat Sarma, Peter L. McMahon
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 ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms. We introduce the Fourier Series Loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. The FSL method prepares a (Dn)-qubit state encoding the 2ᴰⁿ-point uniform discretization of a D-dimensional function specified by a D-dimensional Fourier series. A free parameter m < n determines the number of Fourier coefficients, 2ᴰ⁽ᵐ⁺¹⁾, used to represent the function. The FSL method uses a quantum circuit of depth at most 2(n-2)+⌈log₂(n-m) ⌉+ 2ᴰ⁽ᵐ⁺¹⁾⁺² -2D(m+1), which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function's discretization is over exponentially many (2ᴰⁿ) points. We present a classical compilation algorithm with runtime O(2³ᴰ⁽ᵐ⁺¹⁾) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10⁻⁶ and 10⁻³, respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H$1$-$1$ and H$1$-$2$ trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95%, as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.
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