Linear Combination of Unitaries (LCU)

• LCU is a quantum framework that decomposes operators into weighted sums of unitary operations, enabling block encoding and scalable circuit implementations.
• It leverages PREPARE–SELECT structures and coefficient normalization to balance ancilla cost, circuit depth, and error compensation in quantum simulations.
• LCU supports diverse applications such as Hamiltonian simulation, quantum chemistry, and optimization by facilitating flexible operator decompositions and continuous generalizations.

Linear Combination of Unitaries (LCU) is a quantum-algorithmic framework in which a target operator is expressed as a weighted sum of unitary operators, typically in the discrete form $A=\sum_j a_j U_j$, and more generally in continuous forms such as $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$. In contemporary usage, LCU denotes both the algebraic decomposition itself and the circuit constructions that turn such decompositions into block encodings, postselected transformations, quasi-probability samplers, or classical-post-processing schemes for nonunitary functions. It is a standard input model for block-encoding-based algorithms, including qubitization and QSVT, and it appears in Hamiltonian simulation, quantum chemistry, state preparation, optimization, and variational circuit design (Chiara et al., 28 Jul 2025, Loaiza et al., 2024, Kawamata et al., 17 Sep 2025).

1. Algebraic formulation and coherent realization

In the standard coherent formulation, one starts from a decomposition

$A=\sum_{j=0}^{L-1}\alpha_j U_j,$

with unitary $U_j$ and coefficients whose phases can be absorbed into the unitaries. Writing

$\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$

LCU constructs a block encoding of $A/\alpha$ by combining a coefficient-preparation oracle with a multiplexed unitary. A canonical PREPARE map acts on an ancilla register as

$$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$

while SELECT applies

$$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$

The PREPARE–SELECT–UNPREPARE pattern then yields a larger unitary whose $\ket{\bar 0}$-ancilla block is $\Upsilon/|\alpha|_1$ (Sze et al., 30 Jan 2025).

This construction is equivalently described in block-encoding language. If $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$0 and $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$1 are ancilla unitaries whose first columns encode the magnitudes and phases of the coefficients, then

$$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$2

realizes an $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$3-block encoding of the target operator (Brearley et al., 25 Jan 2026). In standard postselected use, the success probability on input $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$4 is

$$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$5

and oblivious amplitude amplification is the conventional mechanism for boosting this probability (Sze et al., 30 Jan 2025).

The same formalism also accommodates parametrized constructions. In variational settings, one writes

$$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$6

and the output is naturally sub-normalized. In that setting, the expectation value $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$7 already incorporates the LCU postselection probability rather than separating it as a preprocessing overhead (Khatri et al., 27 Jun 2025).

2. Resource measures, optimality, and decomposition quality

The central cost parameter of an LCU decomposition is its coefficient $$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$8-norm. For a Hamiltonian written as

$$F(A)=\int_V f(\mathbf t)\,G(A,\mathbf t)\,d\mathbf t$$9

the quantity

$A=\sum_{j=0}^{L-1}\alpha_j U_j,$0

sets the normalization in the block encoding and governs the query complexity of Hamiltonian simulation. In particular, truncated Dyson-series simulation has complexity

$A=\sum_{j=0}^{L-1}\alpha_j U_j,$1

while qubitization has complexity

$A=\sum_{j=0}^{L-1}\alpha_j U_j,$2

in oracle uses (Loaiza et al., 2022).

A general lower bound links LCU quality to spectral geometry. For any bounded Hermitian operator, every LCU decomposition obeys

$A=\sum_{j=0}^{L-1}\alpha_j U_j,$3

where $A=\sum_{j=0}^{L-1}\alpha_j U_j,$4 is the spectral range. The same work shows that $A=\sum_{j=0}^{L-1}\alpha_j U_j,$5 is achievable in principle by using unitaries built from

$A=\sum_{j=0}^{L-1}\alpha_j U_j,$6

after shifting and rescaling the spectrum to $A=\sum_{j=0}^{L-1}\alpha_j U_j,$7. The practical limitation is that the square-root term is generally highly nonlocal, so the optimal-$A=\sum_{j=0}^{L-1}\alpha_j U_j,$8 construction is “practically unattainable for general Hamiltonians” (Loaiza et al., 2022).

This lower-bound perspective is especially important in quantum chemistry, where different fermionic and qubit LCUs induce large differences in $A=\sum_{j=0}^{L-1}\alpha_j U_j,$9. The “Majorana Tensor Decomposition” provides a unifying description in which existing Pauli, anti-commuting, single-factorization, double-factorization, CSA, THC, and newer low-rank constructions are all instances of a common tensor-factorized Majorana LCU framework (Loaiza et al., 2024). A complementary line of work, the Block Invariant Symmetry Shift method, reduces the spectral range and the resulting LCU $U_j$0-norm by modifying the Hamiltonian only outside the target electron-number block; the 2024 linear-programming reformulation guarantees global optimality within the BLISS ansatz and scales to active spaces of up to 76 orbitals (Patel et al., 2024).

A recurring misconception is that “LCU cost” is determined only by the number of terms. The chemistry literature instead shows that coefficient structure, symmetry shifts, factorization rank, and fragment spectral ranges can matter as much as raw term count. This suggests that decomposition design is often the dominant classical preprocessing problem in practical LCU pipelines.

3. Continuous, Fourier, and ancilla-free generalizations

LCU is not limited to finite sums. In the LCU via classical post-processing paradigm, one assumes an integral representation

$U_j$1

where each $U_j$2 is proportional to a unitary operator. A quantum device estimates

$U_j$3

with the Hadamard test, and the nonunitary quantity $U_j$4 is reconstructed by classical integration. Within this setting, Monte Carlo, trapezoid, and quasi-Monte Carlo integration induce different asymptotic numerical-integration errors: $U_j$5 respectively, while all retain Hadamard-test statistical error of order $U_j$6. In ground-state property estimation and Green’s-function estimation, quasi-Monte Carlo was found to yield the lowest overall errors for practically relevant shot counts per unitary (Kawamata et al., 17 Sep 2025).

A second generalization replaces coherent LCU gadgets by quasi-probability or sampling constructions. In ancilla-free Fourier-based LCU for optimization, a target unitary is written as

$U_j$7

and the induced channel is decomposed into a quasi-probability combination with cost

$U_j$8

Dropping the signed interference terms yields an ancilla-free sampler with output probabilities $U_j$9 satisfying

$\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$0

For diagonal unitaries generated by $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$1, the Fourier construction gives $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$2; for arbitrary permutation-invariant unitaries expanded over collective $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$3 rotations, the cost satisfies $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$4 (Vazquez et al., 18 May 2026). The same framework makes explicit the connection between Fourier penalties in QAOA and classical Lagrangian relaxation.

A third direction studies general nonunitary operators through Fourier extension. There, one approximates the identity function on a buffered interval by a smooth sine series with exponentially decaying coefficients, applies it separately to the Hermitian and anti-Hermitian parts of $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$5, and rewrites the sines as complex exponentials. The resulting LCU achieves exponential convergence in the truncation order, while the block-encoding subnormalization scales as

$\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$6

which is substantially better than the polynomial dependence on $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$7 in earlier general-purpose constructions (Brearley et al., 25 Jan 2026).

4. Hamiltonian simulation and error-compensated synthesis

Hamiltonian simulation has been the most prominent application of LCU. In truncated-Taylor simulation, one expands $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$8 as a linear combination of products of Hamiltonian terms and then block-encodes the truncated series. For electronic-structure Hamiltonians with highly nonuniform coefficients, it is not optimal to keep all terms at a fixed Taylor order. An adaptive truncation scheme that iteratively retains larger-magnitude terms at each order improves the simulation accuracy typically by an order of magnitude for a given circuit depth across a range of molecular instances (Meister et al., 2020).

A distinct strategy uses LCU to compensate the error of product formulas rather than replacing them. For a $\alpha=\sum_{j=0}^{L-1}|\alpha_j|,$9-th order Trotter formula $A/\alpha$0, define the multiplicative remainder

$A/\alpha$1

The “Paired Taylor-Series Compensation” construction builds an LCU only for $A/\alpha$2 and pairs the leading anti-Hermitian error terms with the identity so that the per-segment LCU norm remains close to one. The resulting algorithm improves the time scaling of $A/\alpha$3-th order Trotter from $A/\alpha$4 to $A/\alpha$5 and yields logarithmic dependence on $A/\alpha$6. For local lattice Hamiltonians, the “Nested-Commutator Compensation” variant uses explicit nested-commutator expansions of the Trotter remainder and achieves

$A/\alpha$7

gate complexity, thereby quadratically improving the accuracy exponent of $A/\alpha$8-th order Trotter while retaining almost linear system-size dependence (Zeng et al., 2022).

LCU has also been demonstrated on hardware for Hamiltonian dynamics. In an ion-trap realization for squared overlaps of time-evolved states, the Taylor-expanded propagator was collapsed into one large LCU, then reduced by pre-selecting only those Pauli terms contributing to the target observable. Together with a multiplexor-based SELECT implementation, this yielded a two-qubit gate count

$A/\alpha$9

for an $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$0-term $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$1-qubit LCU. In the Rabi–Hubbard example discussed there, a 400–500-term expansion was reduced to at most 11 terms in the observable-relevant subspace, enabling a practical implementation on an ion-trap device (Sze et al., 30 Jan 2025).

These developments show that LCU is no longer used only as a monolithic asymptotic primitive. In practice it is frequently combined with truncation heuristics, factorization structure, or product formulas to rebalance ancilla cost, circuit depth, and classical preprocessing.

5. Structured block encodings and application-specific constructions

A major challenge in practical LCU is the SELECT oracle. In conventional implementations it is realized by multi-controlled application of the indexed unitary, so two-qubit and $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$2-gate costs are often dominated by control logic rather than by the target operator itself. The FOQCS-LCU construction addresses this for Pauli-sum Hamiltonians by rewriting the sum in check-matrix form and using two $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$3-qubit ancilla registers that separately encode the $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$4 and $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$5 patterns of each Pauli string. SELECT then reduces to one parallel layer of CNOTs and one parallel layer of CZs, giving a constant-depth implementation with a linear number of singly controlled Pauli gates and ancillae. For Heisenberg and spin-glass models, the resulting block encodings show an order-of-magnitude improvement in CNOT count over conventional LCU (Chiara et al., 28 Jul 2025).

The same paper exploits generalized Dicke-state preparation to reduce PREPARE overhead. Because many structured Hamiltonians require superpositions over single-excitation, nearest-neighbor double-excitation, or paired-register excitation patterns, PREPARE can be compiled into explicit linear-CNOT Dicke routines rather than treated as a generic amplitude-loading problem (Chiara et al., 28 Jul 2025). This is an example of a broader theme in LCU: once coefficient structure is known, PREPARE can often be specialized far beyond the generic $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$6-qubit model.

LCU has also been adapted to black-box quantum state preparation. Given an oracle that returns $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$7-bit values $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$8, the amplitude $$P(\alpha)\ket{\bar 0}=\sum_{\ell=0}^{L-1}\sqrt{\frac{\alpha_\ell}{|\alpha|_1}}\ket{\ell},$$9 can be transduced into a quantum amplitude by interpreting the binary expansion

$$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$0

as an LCU over fixed dyadic coefficients. Two concrete constructions were given: a standard LCU version requiring $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$1 additional qubits and $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$2 Toffoli gates for the amplitude-transduction core, and a modified LCU version using $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$3 ancillas and $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$4 Toffoli gates. With logical-AND optimization, the standard variant’s Toffoli count can also be reduced to $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$5 (Wang et al., 2021).

Application areas have expanded accordingly. In optimization, Fourier LCU replaces fully connected penalty terms and XY-mixer evolutions by ensembles of simple single-qubit layers or collective rotations (Vazquez et al., 18 May 2026). In chemistry, tensor-factorized fermionic LCUs turn four-index integral tensors into orbital-rotation-conjugated reflection operators (Loaiza et al., 2024). In both cases, LCU functions less as a single algorithm than as a compilation language for structured operators.

6. Variational behavior, ancilla data, and parallel execution

The growth of parametrized and hybrid algorithms has made trainability a central question for LCU. For a coherent LCU of $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$6 parametrized circuits with Haar-model assumptions on the constituent families, the variance of the unnormalized expectation satisfies

$$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$7

Accordingly, if each constituent family is trainable at scale, the coherent LCU remains trainable up to a polynomial penalty in $$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$8. For incoherent superpositions, the bound improves to

$$S(\Upsilon)=\sum_{\ell=0}^{L-1}\ket{\ell}\!\bra{\ell}\otimes \mathcal P_\ell.$$9

and for uniform Dirichlet weights with identical moment structure one obtains

$\ket{\bar 0}$0

The analysis therefore rules out LCU itself as a generic barren-plateau mechanism and supports the use of LCU as a controlled expressivity increase in variational ansätze (Khatri et al., 27 Jun 2025).

Another recent development reinterprets the “junk” ancilla outcomes of LCU as useful data. In an alternative circuit with Hadamards on an index register and a single rotation qubit, every ancilla outcome $\ket{\bar 0}$1 projects the system onto a distinct linear combination of the $\ket{\bar 0}$2. Collecting these outcome states into a matrix $\ket{\bar 0}$3 yields the exact factorization

$\ket{\bar 0}$4

with $\ket{\bar 0}$5. This low-rank structure enables matrix completion from partial observations and classical recovery of the target branch, and it also motivates candidate cryptographic applications based on hiding the coefficient matrix $\ket{\bar 0}$6 as a secret key (Daskin, 4 May 2026).

Depth reduction has likewise become a major theme. Parallelization schemes based on partitioning SELECT into commuting groups, together with adaptive Clifford circuits, teleportation, and parallel QROM techniques, reduce logical depth with only an $\ket{\bar 0}$7 qubit overhead. Prior work cited there suggests $\ket{\bar 0}$8 depth savings for molecular Hamiltonians, and numerics indicate a depth reduction by a factor approximately $\ket{\bar 0}$9. Because the $\Upsilon/|\alpha|_1$0-depth decreases by the same factor while the $\Upsilon/|\alpha|_1$1-count is unchanged, the approach can reduce overall space-time volume in fault-tolerant LCU implementations (Boyd, 2023).

These strands indicate a broadening of the subject. A plausible implication is that LCU is increasingly best understood not as a single postselection gadget, but as a family of operator-encoding techniques spanning coherent block encodings, randomized samplers, continuous integral representations, low-rank data structures, and hardware-aware compilation strategies.