Optimizing Symmetry Informed Probabilistic Error Cancellation

• URL: http://arxiv.org/abs/2607.01072v1
• Date: Wed, 01 Jul 2026 15:30:56 GMT
• Title: Optimizing Symmetry Informed Probabilistic Error Cancellation
• Abstract summary: We show that combining quantum error detection with probabilistic error cancellation gives more accurate and lower-variance estimates than PEC alone.<n>Because noisy symmetry measurements can negate the benefits of the PEC+QED approach, we cast the selection of measurement configurations as a classical optimization problem.<n>Our results demonstrate the importance of circuit-specific tailoring of QEM techniques and that fault-tolerant design principles may already provide value for near-term devices.
• Score: 0.19116784879310023
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We show that combining quantum error detection (QED) with probabilistic error cancellation (PEC) gives more accurate and lower-variance estimates than PEC alone, provided that the symmetry measurements required for QED are carefully chosen. Because noisy symmetry measurements can negate the benefits of the PEC+QED approach, we cast the selection of measurement configurations as a classical optimization problem that systematically suppresses the impact of noise. Applying optimized PEC+QED to GHZ-state output distributions and to simulating the time-dynamics of a generalized superfast encoded Fermi-Hubbard model, we find consistent improvements over PEC. For GHZ states, the optimization over symmetry measurement configurations is essential for achieving an advantage. For the Fermi-Hubbard model, PEC+QED improves observable estimation on a $2 \times 2$ lattice and for larger systems the mitigation overheads can be reduced by measuring only subsets of stabilizers. Our results demonstrate the importance of circuit-specific tailoring of QEM techniques and that fault-tolerant design principles may already provide value for near-term devices.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Noise-Symmetry Optimization of Quantum Error-Corrected Metrology [0.0]
  We show that an intrinsic freedom of QEC codes can be exploited to improve metrological sensitivity.<n>We develop a symmetry-based optimization approach and derive criteria identifying when such optimization can enhance metrological sensitivity.<n>In particular, for stabilizer-sum Hamiltonians, symmetry optimization can convert a code with vanishing QFI into one achieving the standard quantum limit in general or even Heisenberg scaling in specific cases.
  arXiv  Detail & Related papers  (2026-08-22T08:24:50Z)
• The Value of Mechanistic Priors in Sequential Decision Making [41.418304743101174]
  Hybrid mechanistic models, physical priors with learned residuals, promise to reduce the data required for good decisions, but have no computable criterion to test this.<n>We characterize the value of mechanistic priors in sequential decision-making within both and burn-in regimes.
  arXiv  Detail & Related papers  (2026-05-11T05:43:53Z)
• MEC: Machine-Learning-Assisted Generalized Entropy Calibration for Semi-Supervised Mean Estimation [1.3965477771846408]
  Prediction-powered inference (PPI) leverages a machine-learning predictor trained on a small labeled sample to improve efficiency.<n>We introduce Machine-Learning-Assisted Generalized Entropy (MEC), a cross-fitted, calibration-weighted variant of PPI.<n>MEC improves efficiency by reweighting labeled samples to better align with the target population.
  arXiv  Detail & Related papers  (2026-04-07T05:30:11Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• A Comparative Study of MAP and LMMSE Estimators for Blind Inverse Problems [0.17188280334580194]
  We show how two synthetic MAP approaches can be used to reduce the inherent non-dimensionality problem.<n>We also show that the LMMSE estimator can serve as an alternative that can circumvent the limitations.
  arXiv  Detail & Related papers  (2026-02-12T10:49:45Z)
• ECO: Quantized Training without Full-Precision Master Weights [58.97082407934466]
  Error-Compensating (ECO) eliminates master weights by applying updates directly to quantized parameters.<n>We show that ECO converges to a constant-radius neighborhood of the optimum, while naive master-weight removal can incur an error that is inversely proportional to the learning rate.
  arXiv  Detail & Related papers  (2026-01-29T18:35:01Z)
• Beyond Outliers: A Study of Optimizers Under Quantization [82.75879062804955]
  We study impact of choice on model robustness under quantization.<n>We evaluate how model performance degrades when trained with different baselines.<n>We derive scaling laws for quantization-aware training under different parameters.
  arXiv  Detail & Related papers  (2025-09-27T21:15:22Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
  Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models. We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling. We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
  arXiv  Detail & Related papers  (2022-09-27T07:58:25Z)
• Characterizing Error Mitigation by Symmetry Verification in QAOA [2.9860417981482263]
  Hardware errors are a major obstacle to demonstrating quantum advantage with the quantum approximate optimization algorithm (QAOA) Symmetry verification uses parity checks that leverage the symmetries of the objective function to be optimized. We numerically investigate the symmetry verification on the MaxCut problem and identify the error regimes in which this approach improves the QAOA objective.
  arXiv  Detail & Related papers  (2022-04-12T14:51:14Z)
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries [2.517903855792476]
  We introduce an application-specific approach for mitigating the errors in QAOA evolution by leveraging the symmetries present in the classical objective function to be optimized. Specifically, the QAOA state is projected into the symmetry-restricted subspace, with projection being performed either at the end of the circuit or throughout the evolution. Our approach improves the fidelity of the QAOA state, thereby increasing both the accuracy of the sample estimate of the QAOA objective and the probability of sampling the binary string corresponding to that objective value.
  arXiv  Detail & Related papers  (2021-06-08T14:40:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.