Low-depth amplitude estimation via statistical eigengap estimation

• URL: http://arxiv.org/abs/2603.05475v1
• Date: Thu, 05 Mar 2026 18:45:52 GMT
• Title: Low-depth amplitude estimation via statistical eigengap estimation
• Authors: Po-Wei Huang, Bálint Koczor,
• Abstract summary: Amplitude estimation is equivalent to estimating the energy gap of an effective Hamiltonian.<n>We develop two amplitude estimation algorithms for both Heisenberg-limited and low-depth circuit regimes.
• Score: 3.6696978514328715
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Amplitude estimation, in its original form, is formulated as phase estimation upon the Grover walk operator. Since its introduction, subsequent improvements to the algorithm have removed the use of phase estimation and introduced low-depth variants that trade speedup factors for lower circuit depth. We make the key observation that amplitude estimation is equivalent to estimating the energy gap of an effective Hamiltonian, whereby discrete time evolution is generated by amplitude amplification. This enables us to develop two amplitude estimation algorithms for both Heisenberg-limited and low-depth circuit regimes, inspired by statistical phase estimation techniques developed for seemingly unrelated early fault-tolerant ground-state energy estimation. Our approach has significant technical and practical benefits, and uses simplified classical post-processing compared to prior techniques -- our theoretical and numerical results indicate that we achieve state-of-the-art performance. Furthermore, while our approach achieves Heisenberg-limited scaling, we also establish optimal query-depth tradeoffs up to polylogarithmic factors in the low-depth regime with provable theoretical guarantees. Due to its flexibility, generality, and robustness, we expect our approach to be a key enabler for a broad range of early fault-tolerant applications.

Related papers

• Adaptive Estimation and Learning under Temporal Distribution Shift [17.82448143883071]
  We study the problem of estimation and learning under temporal distribution shift.<n>Consider an observation sequence of length $n$, which is a noisy realization of a time-varying groundtruth sequence.<n>We show that a wavelet soft-thresholding estimator provides an optimal estimation error bound for the groundtruth.
  arXiv  Detail & Related papers  (2025-05-21T17:56:07Z)
• Optimal sparse phase retrieval via a quasi-Bayesian approach [0.0]
  A signal need to be reconstructed using only the magnitude of its transformation while phase information remains inaccessible.<n>We introduce a novel sparse quasi-Bayesian approach and provide the first theoretical guarantees for such an approach.<n>Our results establish that the proposed Bayesian estimator achieves minimax-optimal convergence rates under sub-exponential noise.
  arXiv  Detail & Related papers  (2025-04-13T10:21:35Z)
• In-Context Parametric Inference: Point or Distribution Estimators? [66.22308335324239]
  We show that amortized point estimators generally outperform posterior inference, though the latter remain competitive in some low-dimensional problems.<n>Our experiments indicate that amortized point estimators generally outperform posterior inference, though the latter remain competitive in some low-dimensional problems.
  arXiv  Detail & Related papers  (2025-02-17T10:00:24Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Time-adaptive phase estimation [0.0]
  We present Bayesian phase estimation methods that adaptively choose a control phase and the time of coherent evolution based on prior phase knowledge.<n>We find near-optimal performance with respect to known theoretical bounds, and demonstrate some robustness of the estimates to noise that is not accounted for in the model of the estimator.<n>The methods provide optimal solutions accounting for available prior knowledge and experimental imperfections with minimal effort from the user.
  arXiv  Detail & Related papers  (2024-05-14T19:49:22Z)
• Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation [62.969796245827006]
  Delayed-PSVI is an optimistic value-based algorithm that explores the value function space via noise perturbation with posterior sampling. We show our algorithm achieves $widetildeO(sqrtd3H3 T + d2H2 E[tau]$ worst-case regret in the presence of unknown delays. We incorporate a gradient-based approximate sampling scheme via Langevin dynamics for Delayed-LPSVI.
  arXiv  Detail & Related papers  (2023-10-29T06:12:43Z)
• Unmasking Bias in Diffusion Model Training [40.90066994983719]
  Denoising diffusion models have emerged as a dominant approach for image generation. They still suffer from slow convergence in training and color shift issues in sampling. In this paper, we identify that these obstacles can be largely attributed to bias and suboptimality inherent in the default training paradigm.
  arXiv  Detail & Related papers  (2023-10-12T16:04:41Z)
• Robust ground-state energy estimation under depolarizing noise [4.969229261095783]
  We present a novel ground-state energy estimation algorithm that is robust under global depolarizing error channels. Our research demonstrates the feasibility of ground-state energy estimation in the presence of depolarizing noise.
  arXiv  Detail & Related papers  (2023-07-20T22:30:12Z)
• Dynamic Iterative Refinement for Efficient 3D Hand Pose Estimation [87.54604263202941]
  We propose a tiny deep neural network of which partial layers are iteratively exploited for refining its previous estimations. We employ learned gating criteria to decide whether to exit from the weight-sharing loop, allowing per-sample adaptation in our model. Our method consistently outperforms state-of-the-art 2D/3D hand pose estimation approaches in terms of both accuracy and efficiency for widely used benchmarks.
  arXiv  Detail & Related papers  (2021-11-11T23:31:34Z)
• Global Heisenberg scaling in noisy and practical phase estimation [52.70356457590653]
  Heisenberg scaling characterizes the ultimate precision of parameter estimation enabled by quantum mechanics. We study the attainability of strong, global notions of Heisenberg scaling in the fundamental problem of phase estimation.
  arXiv  Detail & Related papers  (2021-10-05T06:57:55Z)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)
• On Deep Instrumental Variables Estimate [21.003925102068298]
  "Deep Instrumental Variable (IV)" is a framework based on deep neural networks to address endogeneity. We consider a two-stage estimator using deep neural networks in the linear instrumental variables model. We show that the second-stage estimator achieves the semiparametric efficiency bound.
  arXiv  Detail & Related papers  (2020-04-30T17:03:00Z)
• Large Batch Training Does Not Need Warmup [111.07680619360528]
  Training deep neural networks using a large batch size has shown promising results and benefits many real-world applications. In this paper, we propose a novel Complete Layer-wise Adaptive Rate Scaling (CLARS) algorithm for large-batch training. Based on our analysis, we bridge the gap and illustrate the theoretical insights for three popular large-batch training techniques.
  arXiv  Detail & Related papers  (2020-02-04T23:03:12Z)

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.