Thrifty shadow estimation: re-using quantum circuits and bounding tails

• URL: http://arxiv.org/abs/2212.06240v2
• Date: Sun, 24 Dec 2023 10:02:08 GMT
• Title: Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Authors: Jonas Helsen and Michael Walter
• Abstract summary: We propose a more practical variant of the protocol, thrifty shadow estimation, in which quantum circuits are reused many times. We show that reuse is maximally effective when sampling Haar random unitaries, and maximally ineffective when sampling from the Clifford group.
• Score: 1.6814343144960449
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shadow estimation is a recent protocol that allows estimating exponentially many expectation values of a quantum state from ``classical shadows'', obtained by applying random quantum circuits and computational basis measurements. In this paper we study the statistical efficiency of this approach in light of near-term quantum computing. We propose a more practical variant of the protocol, thrifty shadow estimation, in which quantum circuits are reused many times instead of having to be freshly generated for each measurement. We show that reuse is maximally effective when sampling Haar random unitaries, and maximally ineffective when sampling from the Clifford group, i.e., one should not reuse circuits when performing shadow estimation with the Clifford group. We provide an efficiently simulable family of quantum circuits that interpolates between these extremes, which we believe should be used instead of the Clifford group. Finally, we consider tail bounds for shadow estimation and discuss when median-of-means estimation can be replaced with standard mean estimation.

Related papers

• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Simulating quantum circuit expectation values by Clifford perturbation theory [0.0]
  We consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations. We introduce a perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approxing expectation values of large near-Clifford circuits.
  arXiv  Detail & Related papers  (2023-06-07T21:42:10Z)
• 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)
• Closed-form analytic expressions for shadow estimation with brickwork circuits [0.4997673761305335]
  Properties of quantum systems can be estimated using classical shadows. We derive analytical expressions for shadow estimation using brickwork circuits. We find improved sample complexity in the estimation of observables supported on sufficiently many qubits.
  arXiv  Detail & Related papers  (2022-11-17T19:01:15Z)
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits [0.8481798330936976]
  We present a depth-modulated randomized measurement scheme that interpolates between two known classical shadows schemes. We focus on the regime where depth scales logarithmically in n and provide evidence that this retains the desirable properties of both extremal schemes. We present methods for two key tasks; estimating expectation values of certain observables from generated classical shadows and, computing upper bounds on the depth-modulated shadow norm.
  arXiv  Detail & Related papers  (2022-09-26T18:01:19Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Efficient qubit phase estimation using adaptive measurements [0.0]
  Estimating the quantum phase of a physical system is a central problem in quantum parameter estimation theory. Current methods to estimate quantum phases fail to reach the quantum Cram'er-Rao bound. We propose a new adaptive scheme based on covariant measurements to circumvent this problem.
  arXiv  Detail & Related papers  (2020-12-21T02:43:47Z)
• Robust shadow estimation [1.7205106391379026]
  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.
  arXiv  Detail & Related papers  (2020-11-19T03:46:49Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.