Robust shadow estimation

• URL: http://arxiv.org/abs/2011.09636v2
• Date: Fri, 25 Jun 2021 05:54:21 GMT
• Title: Robust shadow estimation
• Authors: Senrui Chen, Wenjun Yu, Pei Zeng and Steven T. Flammia
• Abstract summary: We show how to mitigate errors in the shadow estimation protocol recently proposed by Huang, Kueng, and Preskill. By adding an experimentally friendly calibration stage to the standard shadow estimation scheme, our robust shadow estimation algorithm can obtain an unbiased estimate of the classical shadow of a quantum system.
• Score: 1.7205106391379026
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory. While quantum computers promise speedups for many such tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates. Here we show how to mitigate errors in the shadow estimation protocol recently proposed by Huang, Kueng, and Preskill. By adding an experimentally friendly calibration stage to the standard shadow estimation scheme, our robust shadow estimation algorithm can obtain an unbiased estimate of the classical shadow of a quantum system and hence extract many useful properties in a sample-efficient and noise-resilient manner given only minimal assumptions on the experimental conditions. We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments.

Related papers

• Noise-mitigated randomized measurements and self-calibrating shadow estimation [0.0]
  We introduce an error-mitigated method of randomized measurements, giving rise to a robust shadow estimation procedure. On the practical side, we show that error mitigation and shadow estimation can be carried out using the same session of quantum experiments.
  arXiv  Detail & Related papers  (2024-03-07T18:53:56Z)
• 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)
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.412425180760368]
  We propose a robust shallow shadows protocol for characterizing quantum states on current quantum computing platforms. Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
  arXiv  Detail & Related papers  (2024-02-27T21:53:32Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum Error Mitigated Classical Shadows [0.0]
  We consider error mitigation techniques, such as Probabilistic Error Cancellation (PEC), Zero Noise Extrapolation (ZNE) and Symmetry Verification (SV) PEC shadows are an unbiased estimator for the ideal quantum state $rho_id$. The broad set of tools introduced in this work may be instrumental in exploiting near-term and early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-05-08T18:00:09Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [55.47824411563162]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Conditional preparation of non-Gaussian quantum optical states by mesoscopic measurement [62.997667081978825]
  Non-Gaussian states of an optical field are important as a proposed resource in quantum information applications. We propose a novel approach involving displacement of the ancilla field into the regime where mesoscopic detectors can be used. We conclude that states with strong Wigner negativity can be prepared at high rates by this technique under experimentally attainable conditions.
  arXiv  Detail & Related papers  (2021-03-29T16:59:18Z)
• Classical Shadows With Noise [0.0]
  We study the effects of noise on the classical shadows protocol. We derive an analytical upper bound for the sample complexity in terms of a shadow seminorm for both local and global noise. Our results can be used to prove rigorous sample complexity upper bounds in the cases of depolarizing noise and amplitude damping.
  arXiv  Detail & Related papers  (2020-11-23T17:43:42Z)

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.