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

Hardware-Friendly Estimation of LCU-Based Expectation Values via Quantum-to-Classical Workload Shifting

Hari Hara Suthan Chittoor, Thirumalai Manimaran

quant-phcs.ETSubmitted Oct 23, 2026• Announced Oct 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Estimating the expectation value of an observable $O$ for a quantum state evolved under a general, possibly non-unitary, operator $A$ is a fundamental task in quantum simulation, chemistry, and variational algorithms. Existing linear-combination-of-unitaries (LCU) approaches implement $A$ on hardware, requiring ancilla qubits, controlled unitaries and, in randomized variants, fresh circuit executions for every Monte Carlo sample. These costs are prohibitive on NISQ and early fault-tolerant devices. We propose HERMES (Hardware-Efficient Reusable Measurements for Estimating LCU-based expectation valueS), which moves the processing of $A$ entirely to the classical domain. Expanding $A$ and $O$ in the Pauli basis and sampling pairs of Pauli terms classically, HERMES rewrites $μ= \mathrm{Tr}(OAρA^{\dagger})/\mathrm{Tr}(AρA^{\dagger})$ as a ratio of weighted sums of Pauli expectation values on the unmodified state $ρ$, with no ancillas, controlled unitaries, or quantum implementation of $A$. A two-level measurement reduction scheme (Pauli deduplication and commuting-group partitioning) bounds the number of distinct measurement settings independently of the sample count, unlike randomized LCU methods whose circuit executions grow linearly with it. On ground-state energy estimation of $\mathrm{H}_2$ and $\mathrm{LiH}$ via imaginary-time evolution, HERMES matches or beats Pauli single-ancilla LCU baseline using shallow circuits with no two-qubit gates beyond state preparation under qubit-wise commuting grouping. It is also more robust to noise and completes a noisy $\mathrm{LiH}$ simulation infeasible for the baseline, at the cost of classical overhead growing with the number of Pauli terms in $A$.

AI Summary

The paper studies estimation of $\mu=\mathrm{Tr}(OA\rho A^\dagger)/\mathrm{Tr}(A\rho A^\dagger)$ without implementing the possibly non-unitary operator $A$ on quantum hardware. HERMES expands $A$ and $O$ in the Pauli basis, samples pairs of terms from $A$ with probabilities proportional to coefficient magnitudes, and classically reduces their contributions to weighted Pauli expectations on the unchanged state $\rho$. Duplicate Pauli strings are removed and the remainder partitioned into commuting measurement groups. With qubit-wise commuting grouping, circuits require only state preparation, single-qubit basis rotations, and measurement, without ancillas or controlled operations. The number of distinct settings is bounded independently of the classical Monte Carlo sample count; this is not a fixed-precision shot-complexity guarantee. Numerical benchmarks compare against Pauli single-ancilla LCU for four-qubit $\mathrm{H}_2$ and twelve-qubit LiH at five bond lengths, using 10,000 sampled pairs and 10,000 shots per circuit. Evolution is approximated by $A=I-\tau H+\tau^2H^2/2$ with $\tau=100$, containing 24 and 25,542 Pauli terms, respectively. Against this approximation, noiseless mean absolute energy errors are 0.00111 versus 0.00109 Hartree for $\mathrm{H}_2$, and 0.00756 versus 0.03510 for LiH. Under a simulated IBM noise model, $\mathrm{H}_2$ errors are 0.124 versus 0.984 Hartree; noisy LiH baseline simulations could not be completed within available resources. Applicability requires manageable Pauli expansions and incurs classical overhead. The paper notes potentially difficult normalization when the denominator is small, shared evolution-truncation bias, and the absence of rigorous convergence and sample-complexity bounds.

Little sign of AI-generated textAI use disclosedOverclaimsUnclear noveltyMissing comparisonStrong assumptions
All ideas and writing are due to the authors of this work. GPT-6 and Claude Sonnet 5.5 were used to proofread the manuscript and suggest minor edits.

Central claim may not hold: PSA-LCU with a finite M-term decomposition also permits cached estimates of repeated circuits and has at most M²G_O distinct settings, contradicting the claimed intrinsic saturation-versus-no-saturation distinction. HERMES's measurement-setting saturation does not establish a fixed-accuracy circuit-execution advantage, because reused finite-shot estimates retain shared measurement uncertainty that additional classical samples do not remove. The Hartree–Fock computational-basis benchmarks admit exact classical Pauli expectations, so they do not support the assertion that evaluating their reference energies requires exponentially large state manipulation.

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

Comments
12 pages, 3 figures

Related papers

Trade-offs between Quantum and Classical Resources in the Linear Combination of Unitaries

Kaito Wada, Hiroyuki Harada, Yasunari Suzuki +3 more

The randomized linear combination of unitaries (LCU) method with many applications to early fault-tolerant quantum computing algorithms has been proposed. This quantum algorithm computes the same expectation values as the original, fully coherent LCU algorithm using a shallower quantum circuit with a single ancilla qubit, at the cost of a quadratically larger sampling overhead. In this work, we propose a quantum algorithm intermediate between the original and randomized LCU that manages the trade-off between the sampling overhead and circuit complexity. Our algorithm divides the set of unitary operators into several groups and then randomly samples LCU circuits from these groups to evaluate the target expectation value. Notably, we reveal that across all grouping strategies, the mechanism of the sampling overhead reduction can be solely characterized by a metric we call the reduction factor. Moreover, we analytically prove an underlying monotonicity of the reduction factor in the group size: larger group sizes entail smaller sampling overhead. Finally, our framework enables a more flexible algorithmic design by systematically yielding intermediate implementations of LCU-based algorithms; we provide intermediate implementations of non-Hermitian dynamics simulation, ground-state property estimation, and quantum error detection. Besides, we demonstrate this principle by deriving intermediate trade-off scaling in sample complexity and ancillary space for quantum linear system solver.

quant-pharXiv:2512.06260•Dec 9, 2025•0 citations

Randomised composite linear-combination-of-unitaries: its role in quantum simulation and observable estimation

Jinzhao Sun, Pei Zeng

Randomisation is widely used in quantum algorithms to reduce the number of quantum gates and ancillary qubits required. A range of randomised algorithms, including eigenstate property estimation by spectral filters, Hamiltonian simulation, and perturbative quantum simulation, though motivated and designed for different applications, share common features in the use of unitary decomposition and Hadamard-test-based implementation. In this work, we start by analysing the role of randomised linear-combination-of-unitaries (LCU) in quantum simulations, and present several quantum circuits that realise the randomised composite LCU. A caveat of randomisation, however, is that the resulting state cannot be deterministically prepared, which often takes an unphysical form $U ρV^\dagger$ with unitaries $U$ and $V$. Therefore, randomised LCU algorithms are typically restricted to only estimating the expectation value of a single Pauli operator. To address this, we introduce a quantum instrument that can realise a non-completely-positive map, whose feature of frequent measurement and reset on the ancilla makes it particularly suitable in the fault-tolerant regime. We then show how to construct an unbiased estimator of the effective (unphysical) state $U ρV^\dagger$ and its generalisation. Moreover, we demonstrate how to effectively realise the state prepared by applying an operator that admits a composite LCU form. Our results reveal a natural connection between randomised LCU algorithms and shadow tomography, thereby allowing simultaneous estimation of many observables efficiently. As a concrete example, we construct the estimators and present the simulation complexity for three use cases of randomised LCU in Hamiltonian simulation and eigenstate preparation tasks.

arXiv:2506.15658•Jun 18, 2025•0 citations

Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers

Shantanav Chakraborty

We develop three new methods to implement any Linear Combination of Unitaries (LCU), a powerful quantum algorithmic tool with diverse applications. While the standard LCU procedure requires several ancilla qubits and sophisticated multi-qubit controlled operations, our methods consume significantly fewer quantum resources. The first method ( Single-Ancilla LCU ) estimates expectation values of observables with respect to any quantum state prepared by an LCU procedure while requiring only a single ancilla qubit, and no multi-qubit controlled operations. The second approach ( Analog LCU ) is a simple, physically motivated, continuous-time analogue of LCU, tailored to hybrid qubit-qumode systems. The third method ( Ancilla-free LCU ) requires no ancilla qubit at all and is useful when we are interested in the projection of a quantum state (prepared by the LCU procedure) in some subspace of interest. We apply the first two techniques to develop new quantum algorithms for a wide range of practical problems, ranging from Hamiltonian simulation, ground state preparation and property estimation, and quantum linear systems. Remarkably, despite consuming fewer quantum resources they retain a provable quantum advantage. The third technique allows us to connect discrete and continuous-time quantum walks with their classical counterparts. It also unifies the recently developed optimal quantum spatial search algorithms in both these frameworks, and leads to the development of new ones that require fewer ancilla qubits. Overall, our results are quite generic and can be readily applied to other problems, even beyond those considered here.

arXiv:2302.13555•Quantum•Oct 10, 2024•34 citations

Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization

Almudena Carrera Vazquez, Daniel J. Egger, Stefan Woerner

We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits. This is particularly effective for quantum optimization algorithms, where candidate solutions can be evaluated classically and the task is to sample high-quality bitstrings rather than reproduce the full output distribution. We show that Fourier-based LCU constructions efficiently decompose broad classes of diagonal and non-diagonal unitaries, replacing highly connected qubit interactions with single-qubit gate layers or significantly simpler structures at the cost of a polynomial sampling overhead. Applied to algorithms such as QAOA, this yields efficient, hardware-friendly decompositions of, for instance, cardinality-constraint penalties and the fully connected XY-mixer, while maintaining rigorous performance guarantees compared to fully coherent implementations. Furthermore, we establish a formal connection between Fourier-based quantum penalties and Lagrangian relaxation, offering a unified perspective on constraint handling. We validate our approach using exact statevector simulations of 12-qubit circuits and large-scale experiments on 106 superconducting qubits. Our results illustrate how approximate sampling via an LCU systematically trades circuit complexity for sampling overhead, extending the practical reach of near-term quantum optimization.

quant-pharXiv:2605.18985•May 20, 2026•0 citations

Variance reduction methods in the estimation of Pauli sums

Søren Fuglede Jørgensen, Rafael Emilio Barfknecht, Patrick Ettenhuber +1 more

Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.

quant-pharXiv:2603.20029•Mar 23, 2026•0 citations

Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition

Ammar Daskin

Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or simply completing to a larger dimensional matrix. Standard Birkhoff-von~Neumann and Pauli decompositions represent such matrices as linear combinations of $O(N^2)$ permutation or Pauli terms, leading to a large ancilla overhead in a quantum Linear Combination of Unitaries (LCU) implementation. We prove that a bottleneck variant of Birkhoff's algorithm reduces the number of permutations to $O(N\log(1/\varepsilon))$, where $\varepsilon$ is the $\ell_1$-norm approximation error of the reconstructed matrix, and demonstrate empirically that a largest‑weight greedy variant requires only $\approx 2N$ terms for dense matrices (the exact average observed is $\approx 2.4N$). The quadratic reduction in term count directly shrinks the ancilla register from $2\log_2 N$ to $\log_2 N$ qubits, shortens the SELECT circuit, and is especially valuable in fixed‑Hadamard LCU architectures whose success probability scales with $1/K$. The approach enables compact quantum implementations of dense operators appearing in optimal transport, non‑Hermitian simulation, and other settings amenable to Sinkhorn preconditioning. Furthermore, because the decomposition is a convex combination, the LCU normalization constant is exactly $\alpha = 1$, and the uniform superposition is an eigenvector of the target matrix with eigenvalue~1. This structure can be exploited to achieve high success probability without amplitude amplification in many practical scenarios, including quantum walks and Markov chain simulations.

•May 19, 2026•0 citations
Estimating the expectation value of an observable OOO for a quantum state evolved under a general, possibly non-unitary, operator AAA is a fundamental task in quantum simulation, chemistry, and variational algorithms. Existing linear-combination-of-unitaries (LCU) approaches implement AAA on hardware, requiring ancilla qubits, controlled unitaries and, in randomized variants, fresh circuit executions for every Monte Carlo sample. These costs are prohibitive on NISQ and early fault-tolerant devices. We propose HERMES (Hardware-Efficient Reusable Measurements for Estimating LCU-based expectation valueS), which moves the processing of AAA entirely to the classical domain. Expanding AAA and OOO in the Pauli basis and sampling pairs of Pauli terms classically, HERMES rewrites μ=Tr(OAρA†)/Tr(AρA†)μ= \mathrm{Tr}(OAρA^{\dagger})/\mathrm{Tr}(AρA^{\dagger})μ=Tr(OAρA†)/Tr(AρA†) as a ratio of weighted sums of Pauli expectation values on the unmodified state ρρρ, with no ancillas, controlled unitaries, or quantum implementation of AAA. A two-level measurement reduction scheme (Pauli deduplication and commuting-group partitioning) bounds the number of distinct measurement settings independently of the sample count, unlike randomized LCU methods whose circuit executions grow linearly with it. On ground-state energy estimation of H2\mathrm{H}_2H2​ and LiH\mathrm{LiH}LiH via imaginary-time evolution, HERMES matches or beats Pauli single-ancilla LCU baseline using shallow circuits with no two-qubit gates beyond state preparation under qubit-wise commuting grouping. It is also more robust to noise and completes a noisy LiH\mathrm{LiH}LiH simulation infeasible for the baseline, at the cost of classical overhead growing with the number of Pauli terms in AAA.
The paper studies estimation of μ=Tr(OAρA†)/Tr(AρA†)\mu=\mathrm{Tr}(OA\rho A^\dagger)/\mathrm{Tr}(A\rho A^\dagger)μ=Tr(OAρA†)/Tr(AρA†) without implementing the possibly non-unitary operator AAA on quantum hardware. HERMES expands AAA and OOO in the Pauli basis, samples pairs of terms from AAA with probabilities proportional to coefficient magnitudes, and classically reduces their contributions to weighted Pauli expectations on the unchanged state ρ\rhoρ. Duplicate Pauli strings are removed and the remainder partitioned into commuting measurement groups. With qubit-wise commuting grouping, circuits require only state preparation, single-qubit basis rotations, and measurement, without ancillas or controlled operations. The number of distinct settings is bounded independently of the classical Monte Carlo sample count; this is not a fixed-precision shot-complexity guarantee.
Numerical benchmarks compare against Pauli single-ancilla LCU for four-qubit H2\mathrm{H}_2H2​ and twelve-qubit LiH at five bond lengths, using 10,000 sampled pairs and 10,000 shots per circuit. Evolution is approximated by A=I−τH+τ2H2/2A=I-\tau H+\tau^2H^2/2A=I−τH+τ2H2/2 with τ=100\tau=100τ=100, containing 24 and 25,542 Pauli terms, respectively. Against this approximation, noiseless mean absolute energy errors are 0.00111 versus 0.00109 Hartree for H2\mathrm{H}_2H2​, and 0.00756 versus 0.03510 for LiH. Under a simulated IBM noise model, H2\mathrm{H}_2H2​ errors are 0.124 versus 0.984 Hartree; noisy LiH baseline simulations could not be completed within available resources.
Applicability requires manageable Pauli expansions and incurs classical overhead. The paper notes potentially difficult normalization when the denominator is small, shared evolution-truncation bias, and the absence of rigorous convergence and sample-complexity bounds.
The randomized linear combination of unitaries (LCU) method with many applications to early fault-tolerant quantum computing algorithms has been proposed. This quantum algorithm computes the same expectation values as the original, fully coherent LCU algorithm using a shallower quantum circuit with a single ancilla qubit, at the cost of a quadratically larger sampling overhead. In this work, we propose a quantum algorithm intermediate between the original and randomized LCU that manages the trade-off between the sampling overhead and circuit complexity. Our algorithm divides the set of unitary operators into several groups and then randomly samples LCU circuits from these groups to evaluate the target expectation value. Notably, we reveal that across all grouping strategies, the mechanism of the sampling overhead reduction can be solely characterized by a metric we call the reduction factor. Moreover, we analytically prove an underlying monotonicity of the reduction factor in the group size: larger group sizes entail smaller sampling overhead. Finally, our framework enables a more flexible algorithmic design by systematically yielding intermediate implementations of LCU-based algorithms; we provide intermediate implementations of non-Hermitian dynamics simulation, ground-state property estimation, and quantum error detection. Besides, we demonstrate this principle by deriving intermediate trade-off scaling in sample complexity and ancillary space for quantum linear system solver.
Randomisation is widely used in quantum algorithms to reduce the number of quantum gates and ancillary qubits required. A range of randomised algorithms, including eigenstate property estimation by spectral filters, Hamiltonian simulation, and perturbative quantum simulation, though motivated and designed for different applications, share common features in the use of unitary decomposition and Hadamard-test-based implementation. In this work, we start by analysing the role of randomised linear-combination-of-unitaries (LCU) in quantum simulations, and present several quantum circuits that realise the randomised composite LCU. A caveat of randomisation, however, is that the resulting state cannot be deterministically prepared, which often takes an unphysical form UρV†U ρV^\daggerUρV† with unitaries UUU and VVV. Therefore, randomised LCU algorithms are typically restricted to only estimating the expectation value of a single Pauli operator. To address this, we introduce a quantum instrument that can realise a non-completely-positive map, whose feature of frequent measurement and reset on the ancilla makes it particularly suitable in the fault-tolerant regime. We then show how to construct an unbiased estimator of the effective (unphysical) state UρV†U ρV^\daggerUρV† and its generalisation. Moreover, we demonstrate how to effectively realise the state prepared by applying an operator that admits a composite LCU form. Our results reveal a natural connection between randomised LCU algorithms and shadow tomography, thereby allowing simultaneous estimation of many observables efficiently. As a concrete example, we construct the estimators and present the simulation complexity for three use cases of randomised LCU in Hamiltonian simulation and eigenstate preparation tasks.
We develop three new methods to implement any Linear Combination of Unitaries (LCU), a powerful quantum algorithmic tool with diverse applications. While the standard LCU procedure requires several ancilla qubits and sophisticated multi-qubit controlled operations, our methods consume significantly fewer quantum resources. The first method ( Single-Ancilla LCU ) estimates expectation values of observables with respect to any quantum state prepared by an LCU procedure while requiring only a single ancilla qubit, and no multi-qubit controlled operations. The second approach ( Analog LCU ) is a simple, physically motivated, continuous-time analogue of LCU, tailored to hybrid qubit-qumode systems. The third method ( Ancilla-free LCU ) requires no ancilla qubit at all and is useful when we are interested in the projection of a quantum state (prepared by the LCU procedure) in some subspace of interest. We apply the first two techniques to develop new quantum algorithms for a wide range of practical problems, ranging from Hamiltonian simulation, ground state preparation and property estimation, and quantum linear systems. Remarkably, despite consuming fewer quantum resources they retain a provable quantum advantage. The third technique allows us to connect discrete and continuous-time quantum walks with their classical counterparts. It also unifies the recently developed optimal quantum spatial search algorithms in both these frameworks, and leads to the development of new ones that require fewer ancilla qubits. Overall, our results are quite generic and can be readily applied to other problems, even beyond those considered here.
We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits. This is particularly effective for quantum optimization algorithms, where candidate solutions can be evaluated classically and the task is to sample high-quality bitstrings rather than reproduce the full output distribution. We show that Fourier-based LCU constructions efficiently decompose broad classes of diagonal and non-diagonal unitaries, replacing highly connected qubit interactions with single-qubit gate layers or significantly simpler structures at the cost of a polynomial sampling overhead. Applied to algorithms such as QAOA, this yields efficient, hardware-friendly decompositions of, for instance, cardinality-constraint penalties and the fully connected XY-mixer, while maintaining rigorous performance guarantees compared to fully coherent implementations. Furthermore, we establish a formal connection between Fourier-based quantum penalties and Lagrangian relaxation, offering a unified perspective on constraint handling. We validate our approach using exact statevector simulations of 12-qubit circuits and large-scale experiments on 106 superconducting qubits. Our results illustrate how approximate sampling via an LCU systematically trades circuit complexity for sampling overhead, extending the practical reach of near-term quantum optimization.
Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.
Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or simply completing to a larger dimensional matrix. Standard Birkhoff-von~Neumann and Pauli decompositions represent such matrices as linear combinations of O(N2)O(N^2)O(N2) permutation or Pauli terms, leading to a large ancilla overhead in a quantum Linear Combination of Unitaries (LCU) implementation. We prove that a bottleneck variant of Birkhoff's algorithm reduces the number of permutations to O(Nlog⁡(1/ε))O(N\log(1/\varepsilon))O(Nlog(1/ε)), where ε\varepsilonε is the ℓ1\ell_1ℓ1​-norm approximation error of the reconstructed matrix, and demonstrate empirically that a largest‑weight greedy variant requires only ≈2N\approx 2N≈2N terms for dense matrices (the exact average observed is ≈2.4N\approx 2.4N≈2.4N). The quadratic reduction in term count directly shrinks the ancilla register from 2log⁡2N2\log_2 N2log2​N to log⁡2N\log_2 Nlog2​N qubits, shortens the SELECT circuit, and is especially valuable in fixed‑Hadamard LCU architectures whose success probability scales with 1/K1/K1/K. The approach enables compact quantum implementations of dense operators appearing in optimal transport, non‑Hermitian simulation, and other settings amenable to Sinkhorn preconditioning. Furthermore, because the decomposition is a convex combination, the LCU normalization constant is exactly α=1\alpha = 1α=1, and the uniform superposition is an eigenvector of the target matrix with eigenvalue~1. This structure can be exploited to achieve high success probability without amplitude amplification in many practical scenarios, including quantum walks and Markov chain simulations.