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:2609.28760

Walsh-Transform Realization of Dense-to-Sparse Quantum State Preparation

Emad Rezaei Fard Boosari

On Aqora:Emad Rezaei Fard BoosariEmad Rezaei Fard Boosari
quant-phSubmitted Sep 23, 2026• Announced Sep 25, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose a hybrid quantum state preparation method based on the Walsh--Hadamard transform within the dense-to-sparse quantum state preparation framework. The method approximately prepares structured classical data in a quantum circuit through an indirect approach. Instead of directly preparing the dense amplitude-encoded state, the method first transforms the classical data into the Walsh domain and prepares only the largest-magnitude coefficients using a sparse state-preparation algorithm. The original state can then be approximately recovered through a parallel layer of Hadamard gates. Since this reconstruction requires no CNOT gates and has circuit depth 1, the proposed method introduces no additional CNOT or circuit-depth overhead, and its quantum preparation cost is determined by the underlying sparse state-preparation algorithm. Numerical results on representative benchmark signals demonstrate that the proposed method enables accurate state preparation for signals admitting sparse or approximately sparse representations in the Walsh domain.

AI Summary

The paper studies approximate amplitude encoding of structured classical signals using a Walsh–Hadamard realization of the existing dense-to-sparse state-preparation framework. It classically transforms an $N=2^n$-component vector, retains its $d$ largest-magnitude Walsh coefficients, prepares the normalized sparse coefficient state, and applies $H^{\otimes n}$ to reconstruct an approximation to the target state. The quantum decompression is exact, requires no CNOT gates, and adds one parallel gate layer. Preparation costs therefore follow the chosen sparse-state encoder: the quoted circuit-size bounds are $\mathcal{O}(nd)$ without ancillas and $\mathcal{O}(nd/\log(n+m)+n)$ with $m$ ancillas. Unlike the probabilistic Walsh loaders discussed in the paper, this construction uses deterministic sparse preparation without postselection or amplitude amplification. Evidence consists of classical numerical compression and reconstruction experiments on eight one-dimensional benchmark signals, with dimensions up to $N=16384$. The selected square-wave, step, and piecewise-constant examples require exactly one, two, and three Walsh coefficients. At $N=16384$ and relative coefficient-truncation error $10^{-5}$, the sinusoid requires 206 coefficients; Gaussian, sinc, and Gaussian-mixture signals require 614, 1502, and 2141, respectively. White noise requires 16375 coefficients. Additional experiments examine trace distance and sparsity versus dimension and accuracy. The stated advantage is conditional on Walsh sparsity or compressibility: unstructured inputs offer little compression, and tighter accuracy generally increases the required sparsity. Thresholding irreversibly discards information. The numerical investigation concerns one-dimensional signals; higher-dimensional data are left for future work.

Little sign of AI-generated textIncrementalMissing comparisonUnclear novelty

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
13 pages, 5 figures

Related papers

Hybrid Quantum State Preparation via Data Compression

Emad Rezaei Fard Boosari, Maryam Afsary

Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid classical-quantum strategy that reduces this cost to $O(poly(n))$ for a broad class of compressible data. The method first applies a classical compression step to obtain a $d$-sparse representation of the input, loads this sparse vector using a sparse-state preparation routine, and then reconstructs the target state through a polynomial-depth quantum inverse transform. We evaluate the framework on synthetic benchmark signals and real biomedical time series using Fourier and Haar transforms, demonstrating substantial reductions in CNOT counts and circuit depth compared to EAE, together with competitive performance relative to the Fourier Series Loader (FSL). The quantum simulation results show that combining classical data compression with quantum decompression provides a scalable framework for efficient QSP, reducing quantum overhead without requiring variational training or ancillary registers.

quant-pharXiv:2512.01798•Dec 2, 2025•4 citations

Circuit-based quantum random access memory for sparse quantum state preparation

Tiago M. L. Veras

In order to use a quantum device to assess a classical dataset D, we need to representthe set D in a quantum state. Applying a quantum algorithm, that is a quantum state preparation algorithm, to convert classical data into quantum data would be the common method. Loading classical data into a quantum device is required in many current applications. Efficiently preparing a quantum state to be used as the initial state of a quantum algorithm is an essential step in developing efficient quantum algorithms, since many algorithms need to reload the initial state several times during their execution. The cost to initialize a quantum state can compromise the algorithm efficiency if the process of quantum states preparation is not efficient. The topic of quantum states preparation in quantum computing has been the focus of much attention. In this scope, preparing sparse quantum states is a more specific problem that remains open since many quantum algorithms also require sparse initialization. This dissertation presents the results of an investigation on sparse quantum states preparation with the development of three algorithms, with highlight to the preparation of sparse quantum states, the main contributionof this dissertation. From a classical input dataset with M patterns formed by pairs composed of a complex number and a binary pattern with n bits, this algorithm can prepare a quantum state with n qubits and continuous amplitudes. The cost of its steps is O(nM), classical cost of o(MlogM+nM)and requires a lower CNOT number than the main quantum state preparation algorithms currently known. The preparation of a quantumstate with 2 non-zero amplitudes reveals the need of fewer CNOT gates in n>>1 relation to the main known state preparation algorithms, with even more favorable results with s higher and less 1S in the binary string.

•Sep 13, 2021•0 citations

Q-MERGE: Parallelising Quantum State Preparation for Large-Scale Classical Data

Archie Butterworth, Jens Renders, Jingbo Wang

Quantum processing of classical data fundamentally relies on efficiently mapping classical datasets onto the amplitudes of quantum states. Preparing large amplitude-encoded states, however, remains a major bottleneck in quantum computing. In this paper, we introduce a novel state-preparation framework we call Q-MERGE, that addresses this bottleneck by partitioning a large target state into $M$ $n$-qubit segments, preparing these segments independently and in parallel, and then coherently combining them into a single amplitude-encoded state using SELECT-SWAP operations and measurement. Q-MERGE is agnostic to the segment-level preparation method, allowing existing techniques to be applied to smaller subproblems while providing a tunable trade-off between circuit depth and qubit count. With mid-circuit measurement and preparation-register reuse, the required ancilla qubits can be reduced from O(Mn) to O(n). Applied to a real-world $32 x 1024$ ultrasound dataset, Q-MERGE achieves an infidelity of $3.5 x 10^{-9}$, compared with $6.2 x 10^{-3}$ for direct preparation using the same underlying method, a more than six orders of magnitude improvement at equal CNOT circuit depth. We demonstrate its feasibility experimentally with a 53 qubit circuit comprised of 954 1-qubit gates and 478 2-qubit gates, on the Quantinuum System Model H2 trapped-ion quantum computer. The prepared state is validated using shadow-overlap tomography. Numerical analysis of Haar-random states indicates consistent success probability for up to $M=10^7$ segments, supporting the scalability of Q-MERGE for encoding massive classical datasets.

quant-pharXiv:2610.04247•Oct 6, 2026•0 citations

Sparse quantum state preparation with improved Toffoli cost

Felix Rupprecht, Sabine Wölk

The preparation of quantum states is one of the most fundamental tasks in quantum computing, and a key primitive in many quantum algorithms. Of particular interest to areas such as quantum simulation and linear-system solvers are sparse quantum states, which contain only a small number $s$ of non-zero computational basis states compared to a generic state. In this work, we present an approach that prepares $s$-sparse states on $n$ qubits, reducing the number of Toffoli gates required compared to prior art. We work in the established framework of first preparing a dense state on a $\lceil{\log(s)}\rceil$-qubit sub-register, and then mapping this state to the target state via an isometry, with the latter step dominating the cost of the full algorithm. The speed-up is achieved by designing an efficient algorithm for finding and implementing the isometry. The worst-case Toffoli cost of our isometry circuit, which may be viewed as a batched version of an approach by Malvetti et al., is essentially $2s$ for sufficiently large values of $n$, yielding roughly a $\log(s)/2$ improvement factor over the state-of-the-art. In numerical benchmarks on randomly chosen states, the cost is closer to $s$. With the improved isometry circuit, we examine the dense-state preparation step and present ways to optimize the joint cost of both steps, particularly in the case of target states with purely real coefficients, by outsourcing some sub-tasks from the dense-state preparation to the isometry.

quant-pharXiv:2601.09388•Quantum•Jan 15, 2026•13 citations

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

Approximate Amplitude Encoding with the Adaptive Interpolating Quantum Transform

Gekko Budiutama, Shunsuke Daimon, Xinchi Huang +2 more

Amplitude encoding of real-world data on quantum computers is often the workflow bottleneck: direct amplitude encoding scales poorly with input size and can offset any speedups in subsequent processing. Fourier-based sparse amplitude encoding lowers cost by retaining only a small subset of dominant coefficients, but its fixed, non-adaptive basis leads to significant information loss. In this work, we replace the Fourier transform with the adaptive interpolating quantum transform (AIQT) in the sparse amplitude encoding workflow. The AIQT learns a data-adapted basis that concentrates information into a small number of coefficients. Consequently, at matched sparsity, the AIQT retains more information and achieves lower reconstruction error compared to the Fourier baseline. On financial time-series data, the AIQT reduces reconstruction error by 40% relative to the Fourier baseline, and on image datasets the reduction is up to 50% at the same sparsity level, with nearly identical encoding gate cost. Crucially, the approach preserves the efficiency of Fourier-based methods: the AIQT is built on the structure of the quantum Fourier transform circuit. Its gate count scales quadratically with the number of qubits, while classical evaluation can be carried out in quasilinear time. In addition, the AIQT is trained without labels and does not require sampling from quantum hardware or a simulator, removing a major bottleneck in data-driven amplitude-encoding methods.

quant-pharXiv:2603.03803•Mar 5, 2026•0 citations
We propose a hybrid quantum state preparation method based on the Walsh--Hadamard transform within the dense-to-sparse quantum state preparation framework. The method approximately prepares structured classical data in a quantum circuit through an indirect approach. Instead of directly preparing the dense amplitude-encoded state, the method first transforms the classical data into the Walsh domain and prepares only the largest-magnitude coefficients using a sparse state-preparation algorithm. The original state can then be approximately recovered through a parallel layer of Hadamard gates. Since this reconstruction requires no CNOT gates and has circuit depth 1, the proposed method introduces no additional CNOT or circuit-depth overhead, and its quantum preparation cost is determined by the underlying sparse state-preparation algorithm. Numerical results on representative benchmark signals demonstrate that the proposed method enables accurate state preparation for signals admitting sparse or approximately sparse representations in the Walsh domain.
The paper studies approximate amplitude encoding of structured classical signals using a Walsh–Hadamard realization of the existing dense-to-sparse state-preparation framework. It classically transforms an N=2nN=2^nN=2n-component vector, retains its ddd largest-magnitude Walsh coefficients, prepares the normalized sparse coefficient state, and applies H⊗nH^{\otimes n}H⊗n to reconstruct an approximation to the target state.
The quantum decompression is exact, requires no CNOT gates, and adds one parallel gate layer. Preparation costs therefore follow the chosen sparse-state encoder: the quoted circuit-size bounds are O(nd)\mathcal{O}(nd)O(nd) without ancillas and O(nd/log⁡(n+m)+n)\mathcal{O}(nd/\log(n+m)+n)O(nd/log(n+m)+n) with mmm ancillas. Unlike the probabilistic Walsh loaders discussed in the paper, this construction uses deterministic sparse preparation without postselection or amplitude amplification.
Evidence consists of classical numerical compression and reconstruction experiments on eight one-dimensional benchmark signals, with dimensions up to N=16384N=16384N=16384. The selected square-wave, step, and piecewise-constant examples require exactly one, two, and three Walsh coefficients. At N=16384N=16384N=16384 and relative coefficient-truncation error 10−510^{-5}10−5, the sinusoid requires 206 coefficients; Gaussian, sinc, and Gaussian-mixture signals require 614, 1502, and 2141, respectively. White noise requires 16375 coefficients. Additional experiments examine trace distance and sparsity versus dimension and accuracy.
The stated advantage is conditional on Walsh sparsity or compressibility: unstructured inputs offer little compression, and tighter accuracy generally increases the required sparsity. Thresholding irreversibly discards information. The numerical investigation concerns one-dimensional signals; higher-dimensional data are left for future work.
Quantum state preparation (QSP) for a general nnn-qubit state requires O(2n)O(2^n)O(2n) CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid classical-quantum strategy that reduces this cost to O(poly(n))O(poly(n))O(poly(n)) for a broad class of compressible data. The method first applies a classical compression step to obtain a ddd-sparse representation of the input, loads this sparse vector using a sparse-state preparation routine, and then reconstructs the target state through a polynomial-depth quantum inverse transform. We evaluate the framework on synthetic benchmark signals and real biomedical time series using Fourier and Haar transforms, demonstrating substantial reductions in CNOT counts and circuit depth compared to EAE, together with competitive performance relative to the Fourier Series Loader (FSL). The quantum simulation results show that combining classical data compression with quantum decompression provides a scalable framework for efficient QSP, reducing quantum overhead without requiring variational training or ancillary registers.
In order to use a quantum device to assess a classical dataset D, we need to representthe set D in a quantum state. Applying a quantum algorithm, that is a quantum state preparation algorithm, to convert classical data into quantum data would be the common method. Loading classical data into a quantum device is required in many current applications. Efficiently preparing a quantum state to be used as the initial state of a quantum algorithm is an essential step in developing efficient quantum algorithms, since many algorithms need to reload the initial state several times during their execution. The cost to initialize a quantum state can compromise the algorithm efficiency if the process of quantum states preparation is not efficient. The topic of quantum states preparation in quantum computing has been the focus of much attention. In this scope, preparing sparse quantum states is a more specific problem that remains open since many quantum algorithms also require sparse initialization. This dissertation presents the results of an investigation on sparse quantum states preparation with the development of three algorithms, with highlight to the preparation of sparse quantum states, the main contributionof this dissertation. From a classical input dataset with M patterns formed by pairs composed of a complex number and a binary pattern with n bits, this algorithm can prepare a quantum state with n qubits and continuous amplitudes. The cost of its steps is O(nM), classical cost of o(MlogM+nM)and requires a lower CNOT number than the main quantum state preparation algorithms currently known. The preparation of a quantumstate with 2 non-zero amplitudes reveals the need of fewer CNOT gates in n>>1 relation to the main known state preparation algorithms, with even more favorable results with s higher and less 1S in the binary string.
Quantum processing of classical data fundamentally relies on efficiently mapping classical datasets onto the amplitudes of quantum states. Preparing large amplitude-encoded states, however, remains a major bottleneck in quantum computing. In this paper, we introduce a novel state-preparation framework we call Q-MERGE, that addresses this bottleneck by partitioning a large target state into MMM nnn-qubit segments, preparing these segments independently and in parallel, and then coherently combining them into a single amplitude-encoded state using SELECT-SWAP operations and measurement. Q-MERGE is agnostic to the segment-level preparation method, allowing existing techniques to be applied to smaller subproblems while providing a tunable trade-off between circuit depth and qubit count. With mid-circuit measurement and preparation-register reuse, the required ancilla qubits can be reduced from O(Mn) to O(n). Applied to a real-world 32x102432 x 102432x1024 ultrasound dataset, Q-MERGE achieves an infidelity of 3.5x10−93.5 x 10^{-9}3.5x10−9, compared with 6.2x10−36.2 x 10^{-3}6.2x10−3 for direct preparation using the same underlying method, a more than six orders of magnitude improvement at equal CNOT circuit depth. We demonstrate its feasibility experimentally with a 53 qubit circuit comprised of 954 1-qubit gates and 478 2-qubit gates, on the Quantinuum System Model H2 trapped-ion quantum computer. The prepared state is validated using shadow-overlap tomography. Numerical analysis of Haar-random states indicates consistent success probability for up to M=107M=10^7M=107 segments, supporting the scalability of Q-MERGE for encoding massive classical datasets.
The preparation of quantum states is one of the most fundamental tasks in quantum computing, and a key primitive in many quantum algorithms. Of particular interest to areas such as quantum simulation and linear-system solvers are sparse quantum states, which contain only a small number sss of non-zero computational basis states compared to a generic state. In this work, we present an approach that prepares sss-sparse states on nnn qubits, reducing the number of Toffoli gates required compared to prior art. We work in the established framework of first preparing a dense state on a ⌈log⁡(s)⌉\lceil{\log(s)}\rceil⌈log(s)⌉-qubit sub-register, and then mapping this state to the target state via an isometry, with the latter step dominating the cost of the full algorithm. The speed-up is achieved by designing an efficient algorithm for finding and implementing the isometry. The worst-case Toffoli cost of our isometry circuit, which may be viewed as a batched version of an approach by Malvetti et al., is essentially 2s2s2s for sufficiently large values of nnn, yielding roughly a log⁡(s)/2\log(s)/2log(s)/2 improvement factor over the state-of-the-art. In numerical benchmarks on randomly chosen states, the cost is closer to sss. With the improved isometry circuit, we examine the dense-state preparation step and present ways to optimize the joint cost of both steps, particularly in the case of target states with purely real coefficients, by outsourcing some sub-tasks from the dense-state preparation to the isometry.
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.
Amplitude encoding of real-world data on quantum computers is often the workflow bottleneck: direct amplitude encoding scales poorly with input size and can offset any speedups in subsequent processing. Fourier-based sparse amplitude encoding lowers cost by retaining only a small subset of dominant coefficients, but its fixed, non-adaptive basis leads to significant information loss. In this work, we replace the Fourier transform with the adaptive interpolating quantum transform (AIQT) in the sparse amplitude encoding workflow. The AIQT learns a data-adapted basis that concentrates information into a small number of coefficients. Consequently, at matched sparsity, the AIQT retains more information and achieves lower reconstruction error compared to the Fourier baseline. On financial time-series data, the AIQT reduces reconstruction error by 40% relative to the Fourier baseline, and on image datasets the reduction is up to 50% at the same sparsity level, with nearly identical encoding gate cost. Crucially, the approach preserves the efficiency of Fourier-based methods: the AIQT is built on the structure of the quantum Fourier transform circuit. Its gate count scales quadratically with the number of qubits, while classical evaluation can be carried out in quasilinear time. In addition, the AIQT is trained without labels and does not require sampling from quantum hardware or a simulator, removing a major bottleneck in data-driven amplitude-encoding methods.