Quantum State Preparation (QSP)

• Quantum State Preparation (QSP) is the process of converting a fixed fiducial state into a target n-qubit state with amplitudes encoding classical or physical data.
• Techniques span from exact amplitude encoding with exponential resource costs to sparse and variational methods that leverage structural and compressed representations.
• Different QSP approaches balance trade-offs among circuit depth, ancilla usage, and measurement latency to meet both theoretical and hardware constraints.

Searching arXiv for recent quantum state preparation papers to ground the article in fresh literature. Quantum state preparation (QSP) is the task of converting a fixed fiducial input, usually $|0\rangle^{\otimes n}$, into a target $n$-qubit state whose amplitudes encode classical or physically derived data. In exact amplitude encoding, one seeks a unitary $U$ such that

$$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$

while in sparse quantum state preparation (SQSP) the target has only $d$ nonzero amplitudes, for example

$$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$

for a list $S=\{(\alpha_i,q_i)\}$ (Zhao et al., 2024, Lu et al., 29 Aug 2025). QSP is a key component in many quantum algorithms, but for a general $n$-qubit state exact amplitude encoding typically requires $O(2^n)$ CNOT gates and $O(2^n)$ circuit depth, making worst-case loading impractical on near-term hardware and driving a large literature on sparse, low-rank, transform-based, ancilla-assisted, variational, and measurement-based alternatives (Boosari et al., 1 Dec 2025).

1. Formal problem and worst-case complexity

The canonical formulation of QSP is to prepare

$n$0

from a normalized classical vector $n$1. In the sparse setting, the input is not the full $n$2-component vector but the sparsity $n$3, a list of nonzero amplitudes, and the associated basis strings $n$4 (Boosari et al., 1 Dec 2025, Lu et al., 29 Aug 2025). This distinction is operationally decisive: generic exact amplitude encoding scales exponentially with $n$5, whereas SQSP and other structured regimes admit lower-depth constructions when the target has compressed classical structure.

Several papers make the worst-case barrier explicit. Exact amplitude encoding for a general $n$6-qubit state requires on the order of $n$7 CNOT gates and $n$8 circuit depth in standard decompositions such as Mottonen-Iten-style schemes, because the amplitudes must be synthesized by cascades of controlled rotations over the computational basis (Boosari et al., 1 Dec 2025). A related phase-estimation-based line of work associates state preparation efficiency with the decomposition of diagonal unitaries $n$9, $U$0, and $U$1, and states that efficient decomposition of the corresponding diagonal unitary operators is a sufficient condition for efficient state preparation (Zhao et al., 2019).

Ancilla qubits change the depth landscape. Any $U$2-qubit state can be prepared with a $U$3-depth circuit using only single- and two-qubit gates, but this construction uses $U$4 ancillary qubits (Zhang et al., 2022). For sparse states with $U$5 nonzero entries, the same work gives depth $U$6 with $U$7 ancillary qubits and argues optimality through light-cone and fan-out style lower bounds (Zhang et al., 2022). This establishes a recurring theme of the QSP literature: depth reduction is routinely purchased by ancillas, classical preprocessing, or stronger hardware assumptions.

2. Exact structured preparation: sparsity, factorization, and compressed classical descriptions

SQSP has become a central exact regime because many targets of practical interest have small support in the computational basis. A 2025 construction gives two sparse-state algorithms with total size $U$8 and $U$9 ancilla qubits: a fully unitary algorithm of depth $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$0, and a second algorithm of depth $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$1 that uses mid-circuit measurement and feedforward (Lu et al., 29 Aug 2025). The unitary version is organized into four conceptual steps: dense GQSP on $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$2 qubits, one-hot encoding, permutation into the full $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$3-qubit support, and garbage elimination. The measurement-assisted version replaces copy trees and OR-controlled gates by constant-depth measurement-based fan-out constructions, using the MaF primitive of Bäumer and Woerner and the equivalence between OR-controlled $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$4 and parity-controlled $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$5 on one-hot inputs (Lu et al., 29 Aug 2025).

That same sparse-state work compares its resource profile with several prior proposals. Relative to Sun et al. for $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$6, it reports lower depth; relative to Zhang–Li–Yuan it matches $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$7-type depth with exponentially fewer ancillas $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$8; relative to CCQSP it keeps $$U|0\ldots 0\rangle=\sum_{k=0}^{2^n-1} d_k |k\rangle, \qquad \|d\|_2=1,$$9 ancillas instead of $d$0; and relative to constant-depth MaF preparation it reduces size and ancilla count to $d$1 and $d$2, at the cost of linear depth (Lu et al., 29 Aug 2025). The practical limitations are equally explicit: ancilla count $d$3 may still be large for intermediate $d$4, the MaF version requires low-latency classical feedforward and mid-circuit measurements, and all-to-all connectivity is assumed for large-fanout and multi-Toffoli gates (Lu et al., 29 Aug 2025).

Another exact line of work exploits compressed classical data structures rather than sparsity alone. Weighted free binary decision diagrams (FBDDs) encode a state by assigning complex weights to graph edges, and any state represented by a weighted FBDD with $d$5 nodes can be prepared by an $d$6-sized, $d$7-depth circuit using $d$8 ancillas (Tanaka et al., 2024). The paper emphasizes that FBDDs strictly generalize OBDDs and provides examples where a state with $d$9 support has an $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$0-node FBDD, yielding exponential improvement over OBDD-based QSP (Tanaka et al., 2024).

LimTDD-based QSP similarly uses compressed graph structure, but with local invertible map tensor decision diagrams. It proposes algorithms for no ancilla qubits, one ancilla qubit, and many ancilla qubits, with complexities governed by the number of reduced paths $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$1 or the number of nodes $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$2 in the LimTDD (Hong et al., 23 Jul 2025). In the best-case “tower” form, the no-ancilla algorithm uses $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$3 single-qubit plus $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$4 two-qubit gates, and the many-ancilla algorithm runs in $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$5 time. Benchmarks on random Clifford+T states up to $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$6 report substantial post-transpile gate-count reductions relative to Qiskit, QuICT, ADD-based, and FBDD-based baselines (Hong et al., 23 Jul 2025).

Exact preparation can also be simplified when the target factors. A multiplexer simplification method detects tensor-product structure by reshaping amplitudes into a $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$7 matrix and checking whether the matrix rank is $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$8 (Carvalho et al., 2024). When repeated blocks occur in the multiplexer tree, controls can be eliminated, replacing worst-case depth and CNOT count $$|\phi(n,d,S)\rangle=\sum_{i=0}^{d-1}\alpha_i|q_i\rangle$$9 by $S=\{(\alpha_i,q_i)\}$0, where $S=\{(\alpha_i,q_i)\}$1 is the size of the largest entangled component after factorization (Carvalho et al., 2024). This does not address approximate factorization, but it yields substantial compilation-time and circuit-size gains for exactly separable or partially disentangled states.

3. Compression, low-rank structure, tensor networks, and multivariate functions

A major branch of QSP shifts complexity into classical compression or factorization. An ancilla-free hybrid classical-quantum framework first applies a reversible transform $S=\{(\alpha_i,q_i)\}$2, such as the discrete Fourier transform or the discrete Haar wavelet transform, sparsifies the transformed vector by thresholding, prepares the resulting $S=\{(\alpha_i,q_i)\}$3-sparse state, and then applies the inverse quantum transform $S=\{(\alpha_i,q_i)\}$4 (Boosari et al., 1 Dec 2025). For compressible data this replaces exponential quantum cost by $S=\{(\alpha_i,q_i)\}$5 quantum gates. The paper reports, for example, a multi-frequency periodic benchmark with $S=\{(\alpha_i,q_i)\}$6, $S=\{(\alpha_i,q_i)\}$7, $S=\{(\alpha_i,q_i)\}$8, where the hybrid method uses 82 CNOTs, depth 74, and fidelity $S=\{(\alpha_i,q_i)\}$9, compared with $n$0 CNOTs and depth $n$1 for exact amplitude encoding; for a piecewise-constant benchmark with $n$2, $n$3, $n$4, it reports 126 CNOTs, depth 46, and fidelity $n$5, compared with $n$6 CNOTs and depth $n$7 for exact loading (Boosari et al., 1 Dec 2025). The same work states that worst-case scaling remains exponential if $n$8, so the polynomial regime is conditional on classical compressibility (Boosari et al., 1 Dec 2025).

Low-rank quantum state preparation uses Schmidt truncation. For a bipartition $n$9,

$O(2^n)$0

and the target can be approximated by retaining only the top $O(2^n)$1 Schmidt terms (Araujo et al., 2021). The quantum circuit first prepares Schmidt coefficients on $O(2^n)$2 qubits, then uses CNOT entangling and two isometries $O(2^n)$3 and $O(2^n)$4. If $O(2^n)$5, the CNOT count and depth become $O(2^n)$6, interpolating between highly compressed and worst-case $O(2^n)$7 preparation (Araujo et al., 2021). On discretized probability distributions over 7 qubits, allowing fidelity loss $O(2^n)$8, the bounded-approximation-error wrapper reduced CNOT counts from 28–109 to 3–6, and on a random complex 3-qubit vector the LRSP circuit achieved tomography fidelity $O(2^n)$9 versus $O(2^n)$0 for Qiskit’s standard amplitude encoding under the FakeCairo noise model (Araujo et al., 2021).

Tensor-network structure yields another compressed regime. For smooth differentiable probability densities, an MPS representation with small bond dimension can be exploited by iterative MPS circuit loading (Iaconis et al., 2023). For normal distributions, the paper uses an Irwin–Hall approximation whose piecewise-polynomial structure admits an exact MPS of bond dimension $O(2^n)$1, and then applies Ran et al.’s iterative $O(2^n)$2 circuit-loading scheme (Iaconis et al., 2023). The circuits are ancilla-free, the two-qubit gate count is approximately $O(2^n)$3 CNOTs, and experiments on IonQ Aria reached up to 20 qubits. For $O(2^n)$4, the Kolmogorov–Smirnov statistic is reported as $O(2^n)$5 for 10 qubits and $O(2^n)$6 for 20 qubits with $O(2^n)$7 shots (Iaconis et al., 2023).

Multivariate function loading can also be phrased as linear combination of block-encodings. A Fourier/Chebyshev approach prepares the normalized discretization of $O(2^n)$8 by block-encoding basis functions and combining them with LCU, without arithmetic circuits, QFTs, or multivariate quantum signal processing (Rosenkranz et al., 2024). For the Fourier version, the asymptotic resource statement is $O(2^n)$9 two-qubit gates and depth, with $n$00 ancillas; for the Chebyshev version, the two-qubit gate count is $n$01 (Rosenkranz et al., 2024). On Quantinuum H2-1, the method prepared bivariate Gaussian distributions on a $n$02 grid using 24 qubits and up to 237 two-qubit gates, with overall fidelity $n$03 for the uncorrelated case and $n$04 for the correlated case (Rosenkranz et al., 2024).

4. Approximate series methods, variational loaders, and learned circuit synthesis

Approximate QSP is often attractive when fidelity can be traded for shallower circuits. The Walsh Series Loader (WSL) targets states defined by real-valued functions of a single real variable and uses a truncated Walsh expansion implemented through diagonal Walsh rotations plus a Repeat-Until-Success interference step (Zylberman et al., 2023). In the dense truncated-series version, the truncation order is $n$05, the circuit depth is $n$06, the size is $n$07, and only one ancilla qubit is needed (Zylberman et al., 2023). In the sparse-Walsh version, if the series has sparsity $n$08 and maximal Walsh-index Hamming weight $n$09, the circuit approximates the target up to error $n$10 with depth $n$11, size $n$12, and one ancilla qubit (Zylberman et al., 2023). The protocol is probabilistic, with success probability $n$13 in the main setting, so its averaged total time becomes $n$14 for WSL and $n$15 for sparse WSL (Zylberman et al., 2023).

Variational and adaptive ansätze approach QSP by circuit compression rather than direct exact synthesis. In the context of strongly correlated chemistry states up to 28 qubits, Overlap-ADAPT-VQE builds a circuit by greedily appending operators that maximize the gradient of the overlap with a target sparse CI state (Feniou et al., 2023). For the 28-qubit H$n$16 chain, the paper reports that 50% overlap is reached at $n$17 CNOTs, 90% at $n$18, 95% at $n$19, and 99% at $n$20, while exact CVO-QRAM loading of the full ground state requires $n$21 CNOTs (Feniou et al., 2023). The authors conclude that Overlap-ADAPT-VQE offers the most advantageous performance for near-term applications (Feniou et al., 2023).

A different approximate paradigm treats QSP as a learned compilation problem. SuperEncoder uses a pre-trained fully connected MLP with two hidden layers, each of width 512 in the prototype, to map a target amplitude vector directly to the parameters of a hardware-efficient PQC (Zhao et al., 2024). The final circuit depth is $n$22, with empirical settings $n$23, $n$24, and $n$25 (Zhao et al., 2024). On a 4-qubit ideal simulator, the reported per-sample runtimes are $n$26 s for exact amplitude encoding, $n$27 s for iterative approximate amplitude encoding, and $n$28 s for SuperEncoder, with fidelities $n$29, $n$30, and $n$31, respectively (Zhao et al., 2024). This suggests a specific trade-off: online optimization is removed, but fidelity is systematically lower than in per-instance variational refinement.

5. Measurement, feedforward, and control-theoretic preparation

Mid-circuit measurement and classical feedback have become explicit algorithmic resources in QSP. In sparse preparation, measurement-assisted fan-out reduces the depth from $n$32 to $n$33 by replacing copy trees and multi-control constructions with MaF-based constant-depth primitives, but the same paper notes that on current hardware measurement latency in the $n$34s–ms range may dominate gate delays in the ns range and negate the nominal depth advantage (Lu et al., 29 Aug 2025). The resulting advantage is therefore architecture-dependent rather than purely asymptotic.

Measurement-induced steering provides a conceptually different use of feedback. A system register $n$35 is repeatedly entangled with an ancilla $n$36, the ancilla is measured, and $n$37 is actively reset, while $n$38 is never measured or reset (Volya et al., 2023). The induced CPTP map has Kraus operators $n$39, and for suitable $n$40 the steering inequality

$n$41

holds at every step (Volya et al., 2023). On IBM superconducting processors, blind passive qubit steering to $n$42 reached $n$43 after $n$44 rounds, the average fidelity over six stabilizer targets was $n$45, and active feedback reduced the mean number of rounds from $n$46 to $n$47 to reach $n$48 (Volya et al., 2023). The same framework was extended to qutrit steering, where $n$49 was obtained after six rounds (Volya et al., 2023).

Control-theoretic formulations cast state preparation as policy learning. In semiconductor double quantum dots, arbitrary-to-arbitrary pure-state preparation was mapped to a discrete-time Markov decision process and solved with a Deep Q-Network whose input concatenates informationally complete POVM statistics for the current and target states (Wang et al., 2024). For the single-qubit system $n$50, the action set is $n$51 with $n$52; for the two-qubit capacitively coupled system the action space is $n$53 with $n$54 (Wang et al., 2024). Average fidelities over randomized test sets are reported as $n$55 for single-qubit AQSP and $n$56 for two-qubit AQSP, with robustness against moderate charge and nuclear noise (Wang et al., 2024).

Ground-state preparation constitutes a specialized but important subdomain. A deterministic protocol based on a Power-Cosine quantum signal processing filter applies repeated controlled time evolution and ancilla measurement/reset so that the effective non-unitary filter is

$n$57

whose envelope is $n$58 (Jo, 23 Feb 2026). The paper derives exponential suppression of excited components and a depth scaling $n$59, with one ancilla qubit and mid-circuit measurement/reset (Jo, 23 Feb 2026). On the 1D Heisenberg XYZ model, it reports infidelity $n$60 at QSP depth $n$61, compared with Trotterized adiabatic state preparation infidelity $n$62 at the same cost (Jo, 23 Feb 2026).

6. Applications, recurring trade-offs, and limiting conditions

QSP is tightly coupled to downstream algorithm design. Low-depth state preparation has been used to reduce oracle depth in Hamiltonian simulation, linear-system solving, and QRAM, with explicit exponential depth savings in sparse regimes (Zhang et al., 2022). Distribution-loading methods are motivated by amplitude estimation, HHL, quantum machine learning, and initialization for Hamiltonian simulation (Iaconis et al., 2023). Function-based loaders target finance, physics, and chemistry simulations, including Student’s $n$63-distributions, Ricker wavelets, and electron wavefunctions in Coulomb potentials (Rosenkranz et al., 2024). Sparse chemistry-state preparation is motivated by quantum phase estimation and ground-state algorithms for strongly correlated systems (Feniou et al., 2023).

Across these subliteratures, three constraints recur. First, low depth is rarely free: arbitrary-state $n$64-depth circuits require $n$65 ancillas, sparse log-depth circuits often need $n$66 or $n$67 ancillas, FBDD and LimTDD methods scale with diagram size, and measurement-assisted schemes require mid-circuit measurement and feedforward (Zhang et al., 2022, Lu et al., 29 Aug 2025, Tanaka et al., 2024). Second, polynomial quantum cost usually presupposes classical structure, such as sparsity, low Schmidt rank, small bond dimension, transform-domain compressibility, separability, or compact decision diagrams; absent such structure, worst-case scaling remains exponential (Boosari et al., 1 Dec 2025, Araujo et al., 2021, Carvalho et al., 2024). Third, compilation and hardware realism matter as much as asymptotics: multi-controlled gates remain expensive after transpilation, all-to-all connectivity is often assumed, measurement latency can offset feedforward gains, and noise can favor approximate or compressed circuits over exact ones (Hong et al., 23 Jul 2025, Lu et al., 29 Aug 2025, Araujo et al., 2021).

A common misconception is that “state preparation” denotes a single primitive with a single optimal implementation. The literature instead presents a heterogeneous design space: exact arithmetic-style synthesis, sparse-state loaders, diagram-based compilers, low-rank and tensor-network methods, transform-domain compression, Repeat-Until-Success series approximations, adaptive variational ansätze, neural one-shot compilers, steering protocols, and control-learning formulations all instantiate QSP under different assumptions (Zhao et al., 2019, Zylberman et al., 2023, Zhao et al., 2024). Another misconception is that ancilla-free schemes are automatically preferable. Ancilla-free methods can be highly attractive, as in transform-based hybrid loading and MPS circuits, but ancilla-assisted schemes sometimes achieve much lower depth, and measurement-assisted schemes can outperform unitary ones only when classical feedforward is fast enough (Boosari et al., 1 Dec 2025, Iaconis et al., 2023, Lu et al., 29 Aug 2025).

Taken together, the modern theory of QSP is best understood as a theory of resource conversion. Classical structure is exchanged for lower quantum depth; ancillas are exchanged for fan-out, routing, or isometries; measurements and resets are exchanged for shallower coherent circuits; and approximation error is exchanged for improved fidelity on noisy devices. This suggests that no single asymptotic bound captures the practical frontier of QSP: the dominant question is which representation of the target state makes the relevant quantum resource—depth, width, two-qubit count, measurement latency, or classical preprocessing—least costly for the hardware and algorithmic context at hand.