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

Efficient re-sampling in quasi-probability decompositions

Sara Santos, Stefan Woerner, Vincenzo Savona, Julien Gacon

quant-phSubmitted Aug 3, 2026• Announced Aug 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Near-term quantum devices are limited by noise and hardware constraints, motivating algorithmic approaches that trade circuit complexity for increased sampling overhead. Quasi-probability decompositions (QPDs), for example, allow replacing non-local operations by multiple circuits with local operations, but the associated sampling overhead generally scales exponentially and limits their practicality. In this work, we introduce a reweighting strategy for QPDs for circuits with the same variational structure across parameter settings, reusing samples and thereby reducing the sampling overhead. We first demonstrate this approach by estimating fidelities between parameterized quantum states, a key primitive in variational time evolution and quantum kernel methods. Importantly, this setup allows controlling the exponential QPD sampling overhead while preserving the structure of the state-encoding ansatz. We then apply the method to estimate the real part of the quantum geometric tensor using the simultaneous perturbation stochastic approximation and find that, in the presence of realistic hardware noise, our method outperforms other standard estimation techniques. These results highlight the potential of reweighting strategies to extend the applicability of QPD-based methods in variational quantum algorithms.

Comments
10 pages, 7 figures, 2026 IEEE International Conference on Quantum Computing and Engineering (QCE)

Related papers

Stratified Sampling for Quasi-Probability Decompositions

Joshua W. Dai, Bálint Koczor

Quasi-probability decompositions (QPDs) have proven essential in many quantum algorithms and protocols -- one replaces a ``difficult'' quantum circuit with an ensemble of ``easier'' circuit variants whose weighted outcomes reproduce any target observable. This, however, inevitably yields an increased configuration variance beyond Born-rule shot noise. We develop a broad framework for accounting for and reducing this variance and prove that stratified sampling -- under ideal proportional allocation -- results in an unbiased estimator with a variance that is never worse than naïve sampling (with equality only in degenerate cases). Furthermore, we provide a classical dynamic programme to enable stratification on arbitrary product-form QPDs. Numerical simulations of typical QPDs, such as Probabilistic Error Cancellation (PEC) and Probabilistic Angle Interpolation (PAI), demonstrate constant-factor reductions in overall variance (up to $\sim 60$--$80\%$ in an oracle model) and robust $\sim 10\%$ savings in the pessimistic single-shot regime. Our results can be applied immediately to reduce the net sampling cost of practically relevant QPDs that are commonly used in near term and early fault-tolerant algorithms without requiring additional quantum resources.

quant-pharXiv:2602.11245•Feb 12, 2026•0 citations

Reducing the Sampling Overhead in Quasiprobabilistic Decompositions Using Control Variates

Prasanth Shyamsundar

Quasiprobabilistic decompositions (QPDs) play a key role in maximizing the utility of near-term quantum hardware. For example, Probabilistic Error Cancellation (PEC) (an error mitigation technique) and circuit cutting (which enables large quantum computations to be performed on quantum hardware with a limited number of qubits) both involve QPDs. Computations based on QPDs typically incur large sampling overheads that grow exponentially with the number of error-terms mitigated or number of circuit-cuts employed, limiting their practical feasibility. In this work, we adapt the control variates variance reduction technique from the statistics literature in order to reduce the sampling overhead in QPD-based computations. We demonstrate our method using simulation experiments that mimic a realistic PEC scenario. In our experiments, we observed a more than 50% reduction in the number of samples needed to achieve a given precision, in more than 50% of the PEC-based estimations performed in the study when using our approach. We discuss how future research on constructing good control variates can lead to even stronger sampling overhead reduction.

•Jun 24, 2024•0 citations

Simulating Quantum State Transfer between Distributed Devices using Noisy Interconnects

Marvin Bechtold, Johanna Barzen, Frank Leymann +1 more

Scaling beyond individual quantum devices via distributed quantum computing relies critically on high-fidelity quantum state transfers between devices, yet the quantum interconnects needed for this are currently unavailable or expected to be significantly noisy. These limitations can be bypassed by simulating ideal state transfer using quasiprobability decompositions (QPDs). Wire cutting, for instance, allows this even without quantum interconnects. Nevertheless, QPD methods face drawbacks, requiring sampling from multiple circuit variants and incurring substantial sampling overhead. While prior theoretical work showed that incorporating noisy interconnects within QPD protocols could reduce sampling overhead relative to interconnect quality, a practical implementation for realistic conditions was lacking. Addressing this gap, this work presents a generalized and practical QPD for state transfer simulation using noisy interconnects to reduce sampling overhead. The QPD incorporates a single tunable parameter for straightforward calibration to any utilized interconnect. To lower practical costs, the work also explores reducing the number of distinct circuit variants required by the QPD. Experimental validation on contemporary quantum devices confirms the proposed QPD's practical feasibility and expected sampling overhead reduction under realistic noise. Notably, the results show higher effective state transfer fidelity than direct transfer over the underlying noisy interconnect.

arXiv:2507.01683•Jul 2, 2025•0 citations

Noise-Resilient Optimization of Parameterized Quantum Circuits for Near-Term Quantum Devices

Deepika D, K Vanishree, Munishamaiah Krishna

Abstract Noisy Intermediate-Scale Quantum (NISQ) devices are near-term quantum computing devices that inherently suffer from imperfect gate implementation, decoherence, and measurement noise. The main type of variational quantum algorithms(VQAs) is based on Parameterized Quantum Circuits (PQCs), which, however, face practical challenges due to optimization instability of optimization caused by noise and reduced performance. In this paper, we suggest a comprehensive noise-resilient optimization framework for PQCs, which explicitly incorporates noise-resilient circuit architecture design, incorporating noise-aware training strategies into the variational optimization loop. The framework uses circuit structures that are efficient in depth and are hardware compatible in addition to adaptive optimizer choice, stochastic optimization, and averaging as a part of repeated measurement to reduce the impacts of realistic noise. Large-scale experiments are performed with different amounts of qubits, depths of the circuit and noise strengths with realistic noise models. The findings indicate that the convergence rate is faster, the stability is increased, the variability of run-to-run variability is minimized, and other robustness is better than the noise-unaware optimization techniques. Moreover, systematic studies determine optimal operating regions that optimally trade-off expressibility and noise tolerance to offer useful design advice on trusted implementation of VQAs with near-term quantum hardware.

•Jan 28, 2026•0 citations

Efficient implementation of single particle Hamiltonians in exponentially reduced qubit space

Martin Plesch, Martin Friák, Ijaz Ahamed Mohammad

Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid state Hamiltonians by introducing a logarithmic-qubit encoding that maps a system with $N$ physical sites onto only $\lceil \log_2 N \rceil$ qubits while maintaining a clear correspondence with the underlying physical model. Within this reduced register, we construct a compatible variational circuit and a Gray-code-inspired measurement strategy whose number of global settings grows only logarithmically with system size. To quantify the overall hardware load, we introduce a volumetric efficiency metric that combines the number of qubit, circuit depth, and the number of measurement settings into a single measure, expressing the overall computation costs. Using this metric, we show that the total space-time-sampling volume required in a variational loop can be reduced dramatically from $N^2$ to $(logN)^3$ for hardware efficient ansatz, allowing an exponential reduction in time and size of the quantum hardware. These results demonstrate that large, structured solid-state Hamiltonians can be simulated on substantially smaller quantum registers with controlled sampling overhead and manageable circuit complexity, extending the reach of variational quantum algorithms on near-term devices.

quant-pharXiv:2601.00247•Quantum•Jan 2, 2026•0 citations

Domain-Aware Probability Sampling for Hybrid Quantum Systems using Bayesian Optimization

Nicholas S. DiBrita, Jason J. Han, Bhatia, Krishna +3 more

We study the problem of probability distribution matching and sampling on near-term quantum computers, aiming to construct parameterized circuits that generate samples from a target distribution while minimizing resource overhead. This task arises naturally in hybrid quantum-classical workflows, where measurement-driven objectives replace full state reconstruction, and is central to applications in generative modeling and variational inference. However, it remains challenging due to hardware noise, limited circuit depth, and a high-dimensional, non-convex parameter space. We propose CircuitTree, a surrogate-guided optimization framework based on Bayesian Optimization with tree-based models for scalable, domain-aware distribution matching. Our approach introduces a structured, layerwise decomposition aligned with the variational circuit architecture, enabling distributed and sample-efficient optimization within hybrid loops with theoretical convergence guarantees. Across representative distribution-matching tasks, CircuitTree achieves up to 2-3x lower total variation distance while using 40-60% fewer gates than prior approaches. These results demonstrate its effectiveness as a practical building block for end-to-end hybrid quantum sampling.

arXiv:2510.00145•Sep 30, 2025•0 citations
Near-term quantum devices are limited by noise and hardware constraints, motivating algorithmic approaches that trade circuit complexity for increased sampling overhead. Quasi-probability decompositions (QPDs), for example, allow replacing non-local operations by multiple circuits with local operations, but the associated sampling overhead generally scales exponentially and limits their practicality. In this work, we introduce a reweighting strategy for QPDs for circuits with the same variational structure across parameter settings, reusing samples and thereby reducing the sampling overhead. We first demonstrate this approach by estimating fidelities between parameterized quantum states, a key primitive in variational time evolution and quantum kernel methods. Importantly, this setup allows controlling the exponential QPD sampling overhead while preserving the structure of the state-encoding ansatz. We then apply the method to estimate the real part of the quantum geometric tensor using the simultaneous perturbation stochastic approximation and find that, in the presence of realistic hardware noise, our method outperforms other standard estimation techniques. These results highlight the potential of reweighting strategies to extend the applicability of QPD-based methods in variational quantum algorithms.
Quasi-probability decompositions (QPDs) have proven essential in many quantum algorithms and protocols -- one replaces a ``difficult'' quantum circuit with an ensemble of ``easier'' circuit variants whose weighted outcomes reproduce any target observable. This, however, inevitably yields an increased configuration variance beyond Born-rule shot noise. We develop a broad framework for accounting for and reducing this variance and prove that stratified sampling -- under ideal proportional allocation -- results in an unbiased estimator with a variance that is never worse than naïve sampling (with equality only in degenerate cases). Furthermore, we provide a classical dynamic programme to enable stratification on arbitrary product-form QPDs. Numerical simulations of typical QPDs, such as Probabilistic Error Cancellation (PEC) and Probabilistic Angle Interpolation (PAI), demonstrate constant-factor reductions in overall variance (up to ∼60\sim 60∼60--80%80\%80% in an oracle model) and robust ∼10%\sim 10\%∼10% savings in the pessimistic single-shot regime. Our results can be applied immediately to reduce the net sampling cost of practically relevant QPDs that are commonly used in near term and early fault-tolerant algorithms without requiring additional quantum resources.
Quasiprobabilistic decompositions (QPDs) play a key role in maximizing the utility of near-term quantum hardware. For example, Probabilistic Error Cancellation (PEC) (an error mitigation technique) and circuit cutting (which enables large quantum computations to be performed on quantum hardware with a limited number of qubits) both involve QPDs. Computations based on QPDs typically incur large sampling overheads that grow exponentially with the number of error-terms mitigated or number of circuit-cuts employed, limiting their practical feasibility. In this work, we adapt the control variates variance reduction technique from the statistics literature in order to reduce the sampling overhead in QPD-based computations. We demonstrate our method using simulation experiments that mimic a realistic PEC scenario. In our experiments, we observed a more than 50% reduction in the number of samples needed to achieve a given precision, in more than 50% of the PEC-based estimations performed in the study when using our approach. We discuss how future research on constructing good control variates can lead to even stronger sampling overhead reduction.
Scaling beyond individual quantum devices via distributed quantum computing relies critically on high-fidelity quantum state transfers between devices, yet the quantum interconnects needed for this are currently unavailable or expected to be significantly noisy. These limitations can be bypassed by simulating ideal state transfer using quasiprobability decompositions (QPDs). Wire cutting, for instance, allows this even without quantum interconnects. Nevertheless, QPD methods face drawbacks, requiring sampling from multiple circuit variants and incurring substantial sampling overhead. While prior theoretical work showed that incorporating noisy interconnects within QPD protocols could reduce sampling overhead relative to interconnect quality, a practical implementation for realistic conditions was lacking. Addressing this gap, this work presents a generalized and practical QPD for state transfer simulation using noisy interconnects to reduce sampling overhead. The QPD incorporates a single tunable parameter for straightforward calibration to any utilized interconnect. To lower practical costs, the work also explores reducing the number of distinct circuit variants required by the QPD. Experimental validation on contemporary quantum devices confirms the proposed QPD's practical feasibility and expected sampling overhead reduction under realistic noise. Notably, the results show higher effective state transfer fidelity than direct transfer over the underlying noisy interconnect.
Abstract Noisy Intermediate-Scale Quantum (NISQ) devices are near-term quantum computing devices that inherently suffer from imperfect gate implementation, decoherence, and measurement noise. The main type of variational quantum algorithms(VQAs) is based on Parameterized Quantum Circuits (PQCs), which, however, face practical challenges due to optimization instability of optimization caused by noise and reduced performance. In this paper, we suggest a comprehensive noise-resilient optimization framework for PQCs, which explicitly incorporates noise-resilient circuit architecture design, incorporating noise-aware training strategies into the variational optimization loop. The framework uses circuit structures that are efficient in depth and are hardware compatible in addition to adaptive optimizer choice, stochastic optimization, and averaging as a part of repeated measurement to reduce the impacts of realistic noise. Large-scale experiments are performed with different amounts of qubits, depths of the circuit and noise strengths with realistic noise models. The findings indicate that the convergence rate is faster, the stability is increased, the variability of run-to-run variability is minimized, and other robustness is better than the noise-unaware optimization techniques. Moreover, systematic studies determine optimal operating regions that optimally trade-off expressibility and noise tolerance to offer useful design advice on trusted implementation of VQAs with near-term quantum hardware.
Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid state Hamiltonians by introducing a logarithmic-qubit encoding that maps a system with NNN physical sites onto only ⌈log⁡2N⌉\lceil \log_2 N \rceil⌈log2​N⌉ qubits while maintaining a clear correspondence with the underlying physical model. Within this reduced register, we construct a compatible variational circuit and a Gray-code-inspired measurement strategy whose number of global settings grows only logarithmically with system size. To quantify the overall hardware load, we introduce a volumetric efficiency metric that combines the number of qubit, circuit depth, and the number of measurement settings into a single measure, expressing the overall computation costs. Using this metric, we show that the total space-time-sampling volume required in a variational loop can be reduced dramatically from N2N^2N2 to (logN)3(logN)^3(logN)3 for hardware efficient ansatz, allowing an exponential reduction in time and size of the quantum hardware. These results demonstrate that large, structured solid-state Hamiltonians can be simulated on substantially smaller quantum registers with controlled sampling overhead and manageable circuit complexity, extending the reach of variational quantum algorithms on near-term devices.
We study the problem of probability distribution matching and sampling on near-term quantum computers, aiming to construct parameterized circuits that generate samples from a target distribution while minimizing resource overhead. This task arises naturally in hybrid quantum-classical workflows, where measurement-driven objectives replace full state reconstruction, and is central to applications in generative modeling and variational inference. However, it remains challenging due to hardware noise, limited circuit depth, and a high-dimensional, non-convex parameter space. We propose CircuitTree, a surrogate-guided optimization framework based on Bayesian Optimization with tree-based models for scalable, domain-aware distribution matching. Our approach introduces a structured, layerwise decomposition aligned with the variational circuit architecture, enabling distributed and sample-efficient optimization within hybrid loops with theoretical convergence guarantees. Across representative distribution-matching tasks, CircuitTree achieves up to 2-3x lower total variation distance while using 40-60% fewer gates than prior approaches. These results demonstrate its effectiveness as a practical building block for end-to-end hybrid quantum sampling.