High-Dimensional Subspace Expansion Using Classical Shadows

• URL: http://arxiv.org/abs/2406.11533v1
• Date: Mon, 17 Jun 2024 13:37:27 GMT
• Title: High-Dimensional Subspace Expansion Using Classical Shadows
• Authors: Gregory Boyd, Bálint Koczor, Zhenyu Cai,
• Abstract summary: We introduce a post-processing technique for classical shadow measurement data that enhances the precision of ground state estimation. We analytically investigate noise propagation within our method, and upper bound the statistical fluctuations due to the limited number of snapshots in classical shadows. In numerical simulations, our method can achieve a reduction in the energy estimation errors in many cases, sometimes by more than an order of magnitude.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a post-processing technique for classical shadow measurement data that enhances the precision of ground state estimation through high-dimensional subspace expansion; the dimensionality is only limited by the amount of classical post-processing resources rather than by quantum resources. Crucial steps of our approach are the efficient identification of useful observables from shadow data, followed by our regularised subspace expansion that is designed to be numerically stable even when using noisy data. We analytically investigate noise propagation within our method, and upper bound the statistical fluctuations due to the limited number of snapshots in classical shadows. In numerical simulations, our method can achieve a reduction in the energy estimation errors in many cases, sometimes by more than an order of magnitude. We also demonstrate that our performance improvements are robust against both coherent errors (bad initial state) and gate noise in the state-preparation circuits. Furthermore, performance is guaranteed to be at least as good - and in many cases better - than direct energy estimation without using additional quantum resources and the approach is thus a very natural alternative for estimating ground state energies directly from classical shadow data.

Related papers

• Linear-Time User-Level DP-SCO via Robust Statistics [55.350093142673316]
  User-level differentially private convex optimization (DP-SCO) has garnered significant attention due to the importance of safeguarding user privacy in machine learning applications. Current methods, such as those based on differentially private gradient descent (DP-SGD), often struggle with high noise accumulation and suboptimal utility. We introduce a novel linear-time algorithm that leverages robust statistics, specifically the median and trimmed mean, to overcome these challenges.
  arXiv  Detail & Related papers  (2025-02-13T02:05:45Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Classical optimisation of reduced density matrix estimations with classical shadows using N-representability conditions under shot noise considerations [0.0]
  We build upon previous research by choice of an improved estimator within classical shadow tomography. We explore the specific regimes where these methods outperform the unbiased estimator of the standalone classical shadow protocol.
  arXiv  Detail & Related papers  (2024-11-27T15:13:37Z)
• Error mitigated shadow estimation based on virtual distillation [6.354965487736348]
  Shadow estimation is a method for deducing numerous properties of an unknown quantum state through a limited set of measurements. We introduce an error-mitigated shadow estimation approach based on virtual distillation, tailored for applications in near-term quantum devices.
  arXiv  Detail & Related papers  (2024-02-29T03:31:18Z)
• Biased Estimator Channels for Classical Shadows [0.0]
  We consider a biased scheme, intentionally introducing a bias by rescaling the conventional classical shadows estimators. We analytically prove average case as well as worst- and best-case scenarios, and rigorously prove that it is, in principle, always worth biasing the estimators.
  arXiv  Detail & Related papers  (2024-02-14T19:00:01Z)
• Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization [48.65416821017865]
  This chapter introduces a new algorithmic approach, dubbed scaled gradient (ScaledGD) It converges linearly at a constant rate independent of the condition number of the low-rank object. It maintains the low periteration cost of gradient descent for a variety of tasks.
  arXiv  Detail & Related papers  (2023-10-09T21:16:57Z)
• On Classical and Hybrid Shadows of Quantum States [0.0]
  Classical shadows are a computationally efficient approach to storing quantum states on a classical computer. We discuss the advantages and limitations of using classical shadows to simulate many-body dynamics. We introduce the notion of a hybrid shadow, constructed from measurements on a part of the system instead of the entirety.
  arXiv  Detail & Related papers  (2022-06-14T06:25:24Z)
• PriorGrad: Improving Conditional Denoising Diffusion Models with Data-Driven Adaptive Prior [103.00403682863427]
  We propose PriorGrad to improve the efficiency of the conditional diffusion model. We show that PriorGrad achieves a faster convergence leading to data and parameter efficiency and improved quality.
  arXiv  Detail & Related papers  (2021-06-11T14:04:03Z)
• A Bayesian analysis of classical shadows [0.2867517731896504]
  We investigate classical shadows through the lens of Bayesian mean estimation (BME) In direct tests on numerical data, BME is found to attain significantly lower error on average, but classical shadows prove remarkably more accurate in specific situations. We introduce an observable-oriented pseudo-likelihood that successfully emulates the dimension-independence and state-specific optimality of classical shadows.
  arXiv  Detail & Related papers  (2020-12-16T14:45:18Z)
• 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)
• NCVis: Noise Contrastive Approach for Scalable Visualization [79.44177623781043]
  NCVis is a high-performance dimensionality reduction method built on a sound statistical basis of noise contrastive estimation. We show that NCVis outperforms state-of-the-art techniques in terms of speed while preserving the representation quality of other methods.
  arXiv  Detail & Related papers  (2020-01-30T15:43:50Z)

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.