Adaptive Pauli Shadows for Energy Estimation

• URL: http://arxiv.org/abs/2105.12207v1
• Date: Tue, 25 May 2021 20:42:35 GMT
• Title: Adaptive Pauli Shadows for Energy Estimation
• Authors: Charles Hadfield
• Abstract summary: Recently, derandomised classical shadows have emerged claiming to be even more accurate. This accuracy comes at a cost of introducing classical computing resources into the energy estimation procedure. This present note shows, by adding a fraction of this classical computing resource to the locally-biased classical shadows setting, that the modified algorithm, Adaptive Pauli Shadows is state-of-the-art for energy estimation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Locally-biased classical shadows allow rapid estimation of energies of quantum Hamiltonians. Recently, derandomised classical shadows have emerged claiming to be even more accurate. This accuracy comes at a cost of introducing classical computing resources into the energy estimation procedure. This present note shows, by adding a fraction of this classical computing resource to the locally-biased classical shadows setting, that the modified algorithm, termed Adaptive Pauli Shadows is state-of-the-art for energy estimation.

Related papers

• Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach [36.05085942729295]
  This paper introduces a Quantum Natural Policy Gradient (QNPG) algorithm, which replaces the random sampling used in classicalNPG estimators with a deterministic gradient estimation approach. The proposed QNPG algorithm achieves a sample complexity of $tildemathcalO(epsilon-1.5)$ for queries to the quantum oracle, significantly improving the classical lower bound of $tildemathcalO(epsilon-2)$ for queries to the Markov Decision Process (MDP)
  arXiv  Detail & Related papers  (2025-01-27T17:38:30Z)
• 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)
• Latent Style-based Quantum GAN for high-quality Image Generation [28.3231031892146]
  We introduce the Latent Style-based Quantum GAN (LaSt-QGAN), which employs a hybrid classical-quantum approach in training Generative Adversarial Networks (GANs) Our LaSt-QGAN can be successfully trained on realistic computer vision datasets beyond the standard MNIST, namely Fashion MNIST (fashion products) and SAT4 (Earth Observation images) with 10 qubits.
  arXiv  Detail & Related papers  (2024-06-04T18:00:00Z)
• Bootstrapping Classical Shadows for Neural Quantum State Tomography [0.0]
  We introduce a novel estimator for optimizing the cross-entropy loss function using classical shadows. We show that this loss function can be used to achieve stable reconstruction of GHZ states using a transformer-based neural network trained on classical shadow measurements.
  arXiv  Detail & Related papers  (2024-05-11T01:38:47Z)
• 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)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• Faster spectral density calculation using energy moments [77.34726150561087]
  We reformulate the recently proposed Gaussian Integral Transform technique in terms of Fourier moments of the system Hamiltonian. One of the main advantages of this framework is that it allows for an important reduction of the computational cost.
  arXiv  Detail & Related papers  (2022-11-01T23:57:58Z)
• 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)
• Training Hybrid Classical-Quantum Classifiers via Stochastic Variational Optimization [32.562122826341266]
  Quantum machine learning has emerged as a potential practical application of near-term quantum devices. In this work, we study a two-layer hybrid classical-quantum classifier in which a first layer of quantum neurons implementing generalized linear models (QGLMs) is followed by a second classical combining layer. Experiments show the advantages of the approach for a variety of activation functions implemented by QGLM neurons.
  arXiv  Detail & Related papers  (2022-01-21T10:30:24Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)

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.