Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2502.05193 · IEEE International Conference on Quantum Computing and Engineering (QCE)

On the Correct Implementation of the Walsh Series Loader

Riccardo Pellini, Maurizio Ferrari Dacrema

Published Aug 30, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum state preparation is a preliminary step needed by quantum algorithms that require a specific input state. Exact state preparation methods scale exponentially with the number of qubits, making them impractical on noisy intermediate-scale quantum (NISQ) devices. Approximate approaches offer therefore more flexible and scalable alternatives. In this paper, we discuss the Walsh Series Loader (WSL), a recently proposed approximate algorithm for state preparation. In particular, we observe that the paper does not describe how to implement the term of order zero of the operator WSL is based on. While this does not affect the theoretical validity of WSL, it poses obstacles for practitioners aiming to use WSL because, as we show in our experiments, an incorrect implementation leads to states with very poor fidelity. In this paper, we describe how to implement the full quantum circuit required by WSL, including the term of order zero, releasing our source code online, and show that the algorithm works correctly. Finally, we empirically show how, as was theoretically demonstrated in the original article, truncated WSL does not prepare well highly entangled states.

DOI
10.1109/qce65121.2025.00039

Related papers

Efficient quantum state preparation with Walsh series

Julien Zylberman, Fabrice Debbasch

An approximate quantum state preparation method is introduced, called the Walsh series loader (WSL). The WSL approximates quantum states defined by real-value functions of single real variables with a depth independent of the number $n$ of qubits. Two approaches are presented. The first one approximates the target quantum state by a Walsh series truncated at $O(1/\sqrt{\ensuremath{\epsilon}})$, where $\ensuremath{\epsilon}$ is the precision of the approximation in terms of infidelity. The circuit depth is also $O(1/\sqrt{\ensuremath{\epsilon}})$, the size is $O(n+1/\sqrt{\ensuremath{\epsilon}})$, and only one ancilla qubit is needed. The second method accurately represents quantum states with sparse Walsh series. The WSL loads $s$-sparse Walsh series into $n$ qubits with a depth doubly sparse in $s$ and $k$, the maximum number of bits with value 1 in the binary decomposition of the Walsh function indices. The associated quantum circuit approximates the sparse Walsh series up to an error $\ensuremath{\epsilon}$ with a depth $O(sk)$, a size $O(n+sk)$, and one ancilla qubit. In both cases, the protocol is a repeat-until-success procedure with a probability of success $P=\mathrm{\ensuremath{\Theta}}(\ensuremath{\epsilon})$, giving an averaged total time of $O(1/{\ensuremath{\epsilon}}^{3/2})$ for the WSL and $O(sk/\ensuremath{\epsilon})$ for the sparse WSL. Amplitude amplification can be used to reach a probability of success $P=\mathrm{\ensuremath{\Theta}}(1)$, modifying the quantum circuit size to $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{O}((n+1/\sqrt{\ensuremath{\epsilon}})/\sqrt{\ensuremath{\epsilon}})$ and $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{O}((n+sk)/\sqrt{\ensuremath{\epsilon}})$ and the depth to $O([log{(n)}^{3}+1/\sqrt{\ensuremath{\epsilon}}]/\sqrt{\ensuremath{\epsilon}})$ and $O([log{(n)}^{3}+sk]/\sqrt{\ensuremath{\epsilon}})$, respectively. Amplitude amplification reduces by a factor $O(1/\sqrt{\ensuremath{\epsilon}})$ the total time dependence on $\ensuremath{\epsilon}$ but increases the size and depth of the associated quantum circuits, making them linearly dependent on $n$. These protocols give overall efficient algorithms with no exponential scaling in any parameter. They can be generalized to any complex-value, multivariate, almost-everywhere-differentiable function. The repeat-until-success Walsh series loader is so far the only method that prepares a quantum state with a circuit depth and an averaged total time independent of the number of qubits.

arXiv:2307.08384•Physical Review A•Apr 1, 2024•39 citations

AQER: a scalable and efficient data loader for digital quantum computers

Kaining Zhang, Xinbiao Wang, Yuxuan Du +2 more

Digital quantum computing promises to offer computational capabilities beyond the reach of classical systems, yet its capabilities are often challenged by scarce quantum resources. A critical bottleneck in this context is how to load classical or quantum data into quantum circuits efficiently. Approximate quantum loaders (AQLs) provide a viable solution to this problem by balancing fidelity and circuit complexity. However, most existing AQL methods are either heuristic or provide guarantees only for specific input types, and a general theoretical framework is still lacking. To address this gap, here we reformulate most AQL methods into a unified framework and establish information-theoretic bounds on their approximation error. Our analysis reveals that the achievable infidelity between the prepared state and target state scales linearly with the total entanglement entropy across subsystems when the loading circuit is applied to the target state. In light of this, we develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states. We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits. The results show that AQER consistently outperforms existing methods in both accuracy and gate efficiency. Our work paves the way for scalable quantum data processing and real-world quantum computing applications.

quant-pharXiv:2602.02165•Feb 3, 2026•1 citation

Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions

Mudassir Moosa, Thomas W. Watts, Yiyou Chen +2 more

Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of a D-dimensional function specified by a D-dimensional Fourier series. A free parameter, m, which must be less than n, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( 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 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) 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−6 and 10−3, respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-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

arXiv:2302.03888•Quantum Science and Technology•Sep 22, 2023•44 citations

Approximate State Preparation for Noisy Quantum Computers

Tom Rindell

Any quantum computation begins with some process of state preparation where the prepared state functions as the input value for the computation. For most states, preparation becomes exceedingly more demanding as the number of qubits increases. Moreover, the noise present in the gate operations further complicates the process by contributing to the decoherence of the state. This thesis studies possible approaches to address these problems. For a reader not familiar with the basic principles of quantum computing, Chapter 2 should provide a sufficient summary in order to follow through the rest of the thesis. In Chapter 3 a standard method of state preparation is presented in detail for 2 and 4-qubit cases and then generalized for an arbitrary number of qubits. However in order to present a comprehensive coverage, the necessary gate decompositions for state preparation are first presented and proved. The number of required quantum gates for the preparation of a general state increases exponentially in the number of qubits. Each gate introduces a small error in the computation, the cumulative effect of which can make the decoherence in the final state very severe. Therefore it is perhaps more suitable to prepare a less complex approximation of the target state with fewer gates to obtain better fidelity in the presence of noise. For this purpose, two methods are presented: low-rank state preparation algorithm (LRSP) and a genetic algorithm. LRSP provides a systematic way to generate circuits for approximate state preparation; however, for any given state LRSP can make only very specific approximations, giving us a very limited range of circuits to work with. For this reason our work introduces a genetic algorithm to iterate over the LRSP circuits and to provide a wider range of candidate circuits for approximate state preparation. Using this approach we prepared a range of approximate state preparation circuits for 1000 different Haar-random states and ran them with simulated noise on IBM Qiskit FakeVigo backend. We found that the numerical results matched closely with our theoretical prediction and showed that when run on a noisy quantum computer, the highest fidelity is obtained not for the exact state preparation circuit but for a shorter approximate circuit.

Työväentutkimus Vuosikirja•Oct 25, 2025•0 citations

A Modified Order-Finding Algorithm for NISQ Devices

Debjyoti Biswas, Sourav Dutta, Shrikant Utagi +1 more

An alternative quantum order-finding algorithm is proposed, suitable for implementing on Noisy Intermediate-Scale Quantum (NISQ) devices. In particular, the proposed algorithm bypasses the modular exponentiation and the quantum Fourier transform required in the traditional approach to order-finding. Instead, our algorithm involves an approximate implementation of the square root of a permutation unitary, which requires demonstrably fewer resources in comparison to the standard approach as well as other recently proposed NISQ-era algorithms for order-finding. We obtain heuristic bounds on the circuit complexity of our proposed algorithm and numerically estimate the error incurred due to the approximation involved. Finally, we implement our algorithm on IBM quantum machines with and without error mitigation and benchmark its performance.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 3, 2024•2 citations

Scalable Experimental Bounds for Entangled Quantum State Fidelities

Shamminuj Aktar, Andreas Bärtschi, Abdel‐Hameed A. Badawy +1 more

Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O (3 N for N -qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N =10 and all GHZ states up to N =20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states \(\left|\smash{D_{N/2}^{N}} \right\rangle\) , we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.

arXiv:2210.03048•ACM Transactions on Quantum Computing•Nov 11, 2024•3 citations
Quantum state preparation is a preliminary step needed by quantum algorithms that require a specific input state. Exact state preparation methods scale exponentially with the number of qubits, making them impractical on noisy intermediate-scale quantum (NISQ) devices. Approximate approaches offer therefore more flexible and scalable alternatives. In this paper, we discuss the Walsh Series Loader (WSL), a recently proposed approximate algorithm for state preparation. In particular, we observe that the paper does not describe how to implement the term of order zero of the operator WSL is based on. While this does not affect the theoretical validity of WSL, it poses obstacles for practitioners aiming to use WSL because, as we show in our experiments, an incorrect implementation leads to states with very poor fidelity. In this paper, we describe how to implement the full quantum circuit required by WSL, including the term of order zero, releasing our source code online, and show that the algorithm works correctly. Finally, we empirically show how, as was theoretically demonstrated in the original article, truncated WSL does not prepare well highly entangled states.
An approximate quantum state preparation method is introduced, called the Walsh series loader (WSL). The WSL approximates quantum states defined by real-value functions of single real variables with a depth independent of the number nnn of qubits. Two approaches are presented. The first one approximates the target quantum state by a Walsh series truncated at $O(1/\sqrt{\ensuremath{\epsilon}})$, where $\ensuremath{\epsilon}$ is the precision of the approximation in terms of infidelity. The circuit depth is also $O(1/\sqrt{\ensuremath{\epsilon}})$, the size is $O(n+1/\sqrt{\ensuremath{\epsilon}})$, and only one ancilla qubit is needed. The second method accurately represents quantum states with sparse Walsh series. The WSL loads sss-sparse Walsh series into nnn qubits with a depth doubly sparse in sss and kkk, the maximum number of bits with value 1 in the binary decomposition of the Walsh function indices. The associated quantum circuit approximates the sparse Walsh series up to an error $\ensuremath{\epsilon}$ with a depth O(sk)O(sk)O(sk), a size O(n+sk)O(n+sk)O(n+sk), and one ancilla qubit. In both cases, the protocol is a repeat-until-success procedure with a probability of success $P=\mathrm{\ensuremath{\Theta}}(\ensuremath{\epsilon})$, giving an averaged total time of $O(1/{\ensuremath{\epsilon}}^{3/2})$ for the WSL and $O(sk/\ensuremath{\epsilon})$ for the sparse WSL. Amplitude amplification can be used to reach a probability of success $P=\mathrm{\ensuremath{\Theta}}(1)$, modifying the quantum circuit size to $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{O}((n+1/\sqrt{\ensuremath{\epsilon}})/\sqrt{\ensuremath{\epsilon}})$ and $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{O}((n+sk)/\sqrt{\ensuremath{\epsilon}})$ and the depth to $O([log{(n)}^{3}+1/\sqrt{\ensuremath{\epsilon}}]/\sqrt{\ensuremath{\epsilon}})$ and $O([log{(n)}^{3}+sk]/\sqrt{\ensuremath{\epsilon}})$, respectively. Amplitude amplification reduces by a factor $O(1/\sqrt{\ensuremath{\epsilon}})$ the total time dependence on $\ensuremath{\epsilon}$ but increases the size and depth of the associated quantum circuits, making them linearly dependent on nnn. These protocols give overall efficient algorithms with no exponential scaling in any parameter. They can be generalized to any complex-value, multivariate, almost-everywhere-differentiable function. The repeat-until-success Walsh series loader is so far the only method that prepares a quantum state with a circuit depth and an averaged total time independent of the number of qubits.
Digital quantum computing promises to offer computational capabilities beyond the reach of classical systems, yet its capabilities are often challenged by scarce quantum resources. A critical bottleneck in this context is how to load classical or quantum data into quantum circuits efficiently. Approximate quantum loaders (AQLs) provide a viable solution to this problem by balancing fidelity and circuit complexity. However, most existing AQL methods are either heuristic or provide guarantees only for specific input types, and a general theoretical framework is still lacking. To address this gap, here we reformulate most AQL methods into a unified framework and establish information-theoretic bounds on their approximation error. Our analysis reveals that the achievable infidelity between the prepared state and target state scales linearly with the total entanglement entropy across subsystems when the loading circuit is applied to the target state. In light of this, we develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states. We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits. The results show that AQER consistently outperforms existing methods in both accuracy and gate efficiency. Our work paves the way for scalable quantum data processing and real-world quantum computing applications.
Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of a D-dimensional function specified by a D-dimensional Fourier series. A free parameter, m, which must be less than n, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( 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 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) 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−6 and 10−3, respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-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
Any quantum computation begins with some process of state preparation where the prepared state functions as the input value for the computation. For most states, preparation becomes exceedingly more demanding as the number of qubits increases. Moreover, the noise present in the gate operations further complicates the process by contributing to the decoherence of the state. This thesis studies possible approaches to address these problems. For a reader not familiar with the basic principles of quantum computing, Chapter 2 should provide a sufficient summary in order to follow through the rest of the thesis. In Chapter 3 a standard method of state preparation is presented in detail for 2 and 4-qubit cases and then generalized for an arbitrary number of qubits. However in order to present a comprehensive coverage, the necessary gate decompositions for state preparation are first presented and proved. The number of required quantum gates for the preparation of a general state increases exponentially in the number of qubits. Each gate introduces a small error in the computation, the cumulative effect of which can make the decoherence in the final state very severe. Therefore it is perhaps more suitable to prepare a less complex approximation of the target state with fewer gates to obtain better fidelity in the presence of noise. For this purpose, two methods are presented: low-rank state preparation algorithm (LRSP) and a genetic algorithm. LRSP provides a systematic way to generate circuits for approximate state preparation; however, for any given state LRSP can make only very specific approximations, giving us a very limited range of circuits to work with. For this reason our work introduces a genetic algorithm to iterate over the LRSP circuits and to provide a wider range of candidate circuits for approximate state preparation. Using this approach we prepared a range of approximate state preparation circuits for 1000 different Haar-random states and ran them with simulated noise on IBM Qiskit FakeVigo backend. We found that the numerical results matched closely with our theoretical prediction and showed that when run on a noisy quantum computer, the highest fidelity is obtained not for the exact state preparation circuit but for a shorter approximate circuit.
An alternative quantum order-finding algorithm is proposed, suitable for implementing on Noisy Intermediate-Scale Quantum (NISQ) devices. In particular, the proposed algorithm bypasses the modular exponentiation and the quantum Fourier transform required in the traditional approach to order-finding. Instead, our algorithm involves an approximate implementation of the square root of a permutation unitary, which requires demonstrably fewer resources in comparison to the standard approach as well as other recently proposed NISQ-era algorithms for order-finding. We obtain heuristic bounds on the circuit complexity of our proposed algorithm and numerically estimate the error incurred due to the approximation involved. Finally, we implement our algorithm on IBM quantum machines with and without error mitigation and benchmark its performance.
Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O (3 N for N -qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N =10 and all GHZ states up to N =20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states ∣DN/2N⟩\left|\smash{D_{N/2}^{N}} \right\rangle∣DN/2N​⟩ , we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.