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.28845

Pushing beyond the memory barrier in propagation algorithms with randomization

Manuel S. Rudolph, Ricard Puig, Slimane Thabet, Zoë Holmes

quant-phphysics.comp-phSubmitted Oct 20, 2026• Announced Oct 22, 2026• 1 citation
arXivHTMLPDF

Abstract

Performant classical tools for simulating quantum circuits are important for benchmarking and supporting upcoming quantum devices. Pauli propagation offers promising capabilities, but deep circuits usually cause a rapid growth in the number of Pauli strings and can quickly exhaust the available memory. In this work, we introduce a randomized protocol that combines a specialized resampling schedule, merging, and a controlled amount of bias to keep the propagating Pauli sum within any prescribed memory budget. Additional computational resources can then be spent on embarrassingly parallel repetitions that systematically improve the estimate. Building on the open-source library PauliPropagation.jl, we show that 1) increasing memory of each simulation reduces the error systematically more than outside averaging, 2) resampling just enough to apply the next gate delays variance accumulation and gives better error-per-time trade-offs than more aggressive resampling, and 3) a small, controlled bias is crucial in cutting down variance and pushing far beyond unbiased randomization. The resulting framework can reproduce deterministic calculations while requiring several orders of magnitude less memory.

AI Summary

Pauli propagation can simulate circuit observables without storing a state vector, but branching under non-Clifford gates can exhaust memory. This paper studies how to continue propagation within a prescribed memory budget by trading additional computation for statistical precision. The protocol combines deterministic gate application, merging of duplicate Pauli strings, coefficient truncation, and stochastic compression when the stored expansion reaches its cap. Calibrated or semi-deterministic comb resampling retains dominant coefficients while sampling the remainder. Independent runs can be averaged in parallel. Benchmarks favor compressing only enough to accommodate the next gate—conservatively to $M/2$ strings for Pauli rotations—rather than aggressively reducing the expansion. Tests on a 30-qubit transverse-field Ising circuit, checked against exact state-vector simulation, show an apparent standard-deviation scaling near $M^{-1}$ at shallower depths, reverting toward $M^{-1/2}$ as coefficient distributions flatten. With $M=10^5$, biased randomized calculations approach or outperform deterministic calculations storing $4.2\times10^6$–$9.6\times10^6$ strings. Variance bounds depend on accumulated squared coefficient one-norms; a phenomenological model describes the truncation bias–variance trade-off. The CPU implementation reports approximately $10^9$ strings processed per second using 64 threads. An application estimates marginal collision entropies for a 64-qubit disordered Heisenberg experiment using independent replicas. Those estimates retain truncation and zero-clipping biases, excluded from statistical error bars, and are not fully converged at an intermediate coupling. More generally, averaging cannot remove truncation bias, and deep-circuit variance can still grow exponentially; the improved memory scaling is not established universally.

Little sign of AI-generated textAI use disclosedStrong assumptionsOverclaims
for the purposes of literature search, combining drafts, editing text, deriving and formatting equations, and implementing high-performance code.

Error found: The abstract's claim of several orders of magnitude less memory exceeds the explicit accuracy comparisons, which demonstrate 42-fold and 96-fold reductions in stored Pauli-string counts rather than measured total RAM. The abstract overgeneralizes the advantage of increasing per-run memory over independent averaging, since the reported faster memory scaling is regime-dependent and is explicitly expected to revert to ordinary Monte Carlo scaling for sufficiently flattened coefficient distributions.

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

Comments
47 pages, 10 figures

Related papers

Quantum Enhanced Pauli Propagation

S. Majumder, J. R. Garrison, L. Luo +8 more

Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions about the circuit noise, and cannot guarantee the magnitude of residual bias error. Here, rather than using classical resources to mitigate a noisy quantum circuit execution, we propose a hybrid algorithm that uses quantum resources to improve the accuracy of approximate classical Pauli-path simulation. Our protocol, Quantum Enhanced Pauli Propagation (QuEPP), uses Clifford perturbation theory (CPT) to construct a classically simulable ensemble of Clifford circuits from the low-order terms in CPT, which directly provide the approximate classical Pauli-path simulation of the target circuit. Noisy quantum expectation values of this ensemble are then used to infer a global rescaling factor that corrects quantum execution of the target circuit, providing higher-order contributions absent from the truncated low-order classical simulation. This approach requires no noise characterization, applies to arbitrary circuits, and provides a provable route to asymptotically unbiased estimates. Using IBM Heron hardware, we demonstrate QuEPP on 2D random mirror circuits of up to 49 qubits and circuit depth 80, as well as Trotterized Hamiltonian evolution, showing consistent improvements beyond classical CPT and unmitigated quantum results. QuEPP offers a simple, scalable, and model-free framework for enabling accurate quantum computation in the pre-fault-tolerant era.

quant-pharXiv:2603.14485•Mar 17, 2026•5 citations

Resource-Optimal Importance Sampling for Randomized Quantum Algorithms

Davide Cugini, Touheed Anwar Atif, Yigit Subasi

Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical implementations, the dominant cost of such protocols typically arises from circuit execution and measurement, and depends on hardware-specific resources such as gate counts, circuit depth, runtime, or dissipated energy. We introduce a general framework for applying classical importance sampling to randomized quantum protocols. Given a cost function for running quantum circuits, the proposed approach minimizes a net-cost figure of merit that jointly captures the computational expense per circuit and the estimator variance. We further extend the framework to scenarios where the quantum computation is subject to errors arising either from algorithmic approximations or from physical noise, proving that importance sampling preserves estimator bias despite altering the sampling distribution, and to settings with error-detection schemes, where we characterize the resulting changes in the optimal sampling strategy and achievable net-cost reduction. Representative applications include the Qdrift protocol, dephasing channels, mixed-states simulation, composite observables estimation, classical shadows, and probabilistic error cancellation. Overall, our results establish a principled approach for reducing the computational resources required by randomized quantum protocols through classical sampling optimization.

quant-pharXiv:2603.13495•Mar 17, 2026•2 citations

Scalable Pauli propagation through $\mathbb{F}_2$-linear partitioning

Alev Orfi, Andrew Kille, J. Clayton Peacock +2 more

Pauli propagation simulates quantum circuits and many-body dynamics by evolving observables in the Heisenberg picture as sparse sums of Pauli strings. As Pauli-string operations reduce to bit manipulations, its performance is limited by memory bandwidth and capacity rather than computational throughput. Pooling the memory of many cores and nodes is hindered by the deduplication step after every gate, which can require global synchronization. We avoid this bottleneck by partitioning the strings with an $\mathbb{F}_2$-linear hash function, which guarantees that a $k$-qubit channel couples each partition to at most $4^k$ partitions fixed by the gate, decomposing gate application into independent tasks with bounded communication. Benchmarks of our open-source implementation demonstrate efficient parallel scaling within and across compute nodes, enabling simulations with over $10^{11}$ Pauli strings and extending the accessible timescales of quantum many-body dynamics.

arXiv:2611.17262•Nov 12, 2026•0 citations

Computing noise-canceling observables via Pauli propagation

Andrew Eddins, Caleb Johnson, Alberto Baiardi +8 more

The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.

quant-pharXiv:2606.20441•Jun 19, 2026•4 citations

Leveraging Symmetry Merging in Pauli Propagation

Yanting Teng, Su Yeon Chang, Manuel S. Rudolph +1 more

We introduce a symmetry-adapted framework for simulating quantum dynamics based on Pauli propagation. When a quantum circuit possesses a symmetry, many Pauli strings evolve redundantly under actions of the symmetry group. We exploit this by merging Pauli strings related through symmetry transformations. This procedure, formalized as the symmetry-merging Pauli propagation algorithm, propagates only a minimal set of orbit representatives. Analytically, we show that symmetry merging reduces space complexity by a factor set by orbit sizes, with explicit gains for translation and permutation symmetries. Numerical benchmarks of all-to-all Heisenberg dynamics confirm improved stability, particularly under truncation and noise. Our results establish a group-theoretic framework for enhancing Pauli propagation, supported by open-source code demonstrating its practical relevance for classical quantum-dynamics simulations.

quant-pharXiv:2512.12094•Dec 16, 2025•17 citations

Optimized Randomized Hamiltonian Simulation via Average-Error Analysis

Hayata Morisaki, Keisuke Fujii

Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed $R_z$ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized Hamiltonian simulation.

quant-pharXiv:2609.36694•Sep 30, 2026•0 citations
Performant classical tools for simulating quantum circuits are important for benchmarking and supporting upcoming quantum devices. Pauli propagation offers promising capabilities, but deep circuits usually cause a rapid growth in the number of Pauli strings and can quickly exhaust the available memory. In this work, we introduce a randomized protocol that combines a specialized resampling schedule, merging, and a controlled amount of bias to keep the propagating Pauli sum within any prescribed memory budget. Additional computational resources can then be spent on embarrassingly parallel repetitions that systematically improve the estimate. Building on the open-source library PauliPropagation.jl, we show that 1) increasing memory of each simulation reduces the error systematically more than outside averaging, 2) resampling just enough to apply the next gate delays variance accumulation and gives better error-per-time trade-offs than more aggressive resampling, and 3) a small, controlled bias is crucial in cutting down variance and pushing far beyond unbiased randomization. The resulting framework can reproduce deterministic calculations while requiring several orders of magnitude less memory.
Pauli propagation can simulate circuit observables without storing a state vector, but branching under non-Clifford gates can exhaust memory. This paper studies how to continue propagation within a prescribed memory budget by trading additional computation for statistical precision.
The protocol combines deterministic gate application, merging of duplicate Pauli strings, coefficient truncation, and stochastic compression when the stored expansion reaches its cap. Calibrated or semi-deterministic comb resampling retains dominant coefficients while sampling the remainder. Independent runs can be averaged in parallel. Benchmarks favor compressing only enough to accommodate the next gate—conservatively to M/2M/2M/2 strings for Pauli rotations—rather than aggressively reducing the expansion.
Tests on a 30-qubit transverse-field Ising circuit, checked against exact state-vector simulation, show an apparent standard-deviation scaling near M−1M^{-1}M−1 at shallower depths, reverting toward M−1/2M^{-1/2}M−1/2 as coefficient distributions flatten. With M=105M=10^5M=105, biased randomized calculations approach or outperform deterministic calculations storing 4.2×1064.2\times10^64.2×106–9.6×1069.6\times10^69.6×106 strings. Variance bounds depend on accumulated squared coefficient one-norms; a phenomenological model describes the truncation bias–variance trade-off. The CPU implementation reports approximately 10910^9109 strings processed per second using 64 threads.
An application estimates marginal collision entropies for a 64-qubit disordered Heisenberg experiment using independent replicas. Those estimates retain truncation and zero-clipping biases, excluded from statistical error bars, and are not fully converged at an intermediate coupling. More generally, averaging cannot remove truncation bias, and deep-circuit variance can still grow exponentially; the improved memory scaling is not established universally.
Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions about the circuit noise, and cannot guarantee the magnitude of residual bias error. Here, rather than using classical resources to mitigate a noisy quantum circuit execution, we propose a hybrid algorithm that uses quantum resources to improve the accuracy of approximate classical Pauli-path simulation. Our protocol, Quantum Enhanced Pauli Propagation (QuEPP), uses Clifford perturbation theory (CPT) to construct a classically simulable ensemble of Clifford circuits from the low-order terms in CPT, which directly provide the approximate classical Pauli-path simulation of the target circuit. Noisy quantum expectation values of this ensemble are then used to infer a global rescaling factor that corrects quantum execution of the target circuit, providing higher-order contributions absent from the truncated low-order classical simulation. This approach requires no noise characterization, applies to arbitrary circuits, and provides a provable route to asymptotically unbiased estimates. Using IBM Heron hardware, we demonstrate QuEPP on 2D random mirror circuits of up to 49 qubits and circuit depth 80, as well as Trotterized Hamiltonian evolution, showing consistent improvements beyond classical CPT and unmitigated quantum results. QuEPP offers a simple, scalable, and model-free framework for enabling accurate quantum computation in the pre-fault-tolerant era.
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical implementations, the dominant cost of such protocols typically arises from circuit execution and measurement, and depends on hardware-specific resources such as gate counts, circuit depth, runtime, or dissipated energy. We introduce a general framework for applying classical importance sampling to randomized quantum protocols. Given a cost function for running quantum circuits, the proposed approach minimizes a net-cost figure of merit that jointly captures the computational expense per circuit and the estimator variance. We further extend the framework to scenarios where the quantum computation is subject to errors arising either from algorithmic approximations or from physical noise, proving that importance sampling preserves estimator bias despite altering the sampling distribution, and to settings with error-detection schemes, where we characterize the resulting changes in the optimal sampling strategy and achievable net-cost reduction. Representative applications include the Qdrift protocol, dephasing channels, mixed-states simulation, composite observables estimation, classical shadows, and probabilistic error cancellation. Overall, our results establish a principled approach for reducing the computational resources required by randomized quantum protocols through classical sampling optimization.
Scalable Pauli propagation through F2\mathbb{F}_2F2​-linear partitioning
Pauli propagation simulates quantum circuits and many-body dynamics by evolving observables in the Heisenberg picture as sparse sums of Pauli strings. As Pauli-string operations reduce to bit manipulations, its performance is limited by memory bandwidth and capacity rather than computational throughput. Pooling the memory of many cores and nodes is hindered by the deduplication step after every gate, which can require global synchronization. We avoid this bottleneck by partitioning the strings with an F2\mathbb{F}_2F2​-linear hash function, which guarantees that a kkk-qubit channel couples each partition to at most 4k4^k4k partitions fixed by the gate, decomposing gate application into independent tasks with bounded communication. Benchmarks of our open-source implementation demonstrate efficient parallel scaling within and across compute nodes, enabling simulations with over 101110^{11}1011 Pauli strings and extending the accessible timescales of quantum many-body dynamics.
The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.
We introduce a symmetry-adapted framework for simulating quantum dynamics based on Pauli propagation. When a quantum circuit possesses a symmetry, many Pauli strings evolve redundantly under actions of the symmetry group. We exploit this by merging Pauli strings related through symmetry transformations. This procedure, formalized as the symmetry-merging Pauli propagation algorithm, propagates only a minimal set of orbit representatives. Analytically, we show that symmetry merging reduces space complexity by a factor set by orbit sizes, with explicit gains for translation and permutation symmetries. Numerical benchmarks of all-to-all Heisenberg dynamics confirm improved stability, particularly under truncation and noise. Our results establish a group-theoretic framework for enhancing Pauli propagation, supported by open-source code demonstrating its practical relevance for classical quantum-dynamics simulations.
Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed RzR_zRz​ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized Hamiltonian simulation.