Closed-form analytic expressions for shadow estimation with brickwork circuits

• URL: http://arxiv.org/abs/2211.09835v2
• Date: Fri, 22 Sep 2023 16:43:34 GMT
• Title: Closed-form analytic expressions for shadow estimation with brickwork circuits
• Authors: Mirko Arienzo, Markus Heinrich, Ingo Roth, Martin Kliesch
• Abstract summary: 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.
• Score: 0.4997673761305335
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Properties of quantum systems can be estimated using classical shadows, which implement measurements based on random ensembles of unitaries. Originally derived for global Clifford unitaries and products of single-qubit Clifford gates, practical implementations are limited to the latter scheme for moderate numbers of qubits. Beyond local gates, the accurate implementation of very short random circuits with two-local gates is still experimentally feasible and, therefore, interesting for implementing measurements in near-term applications. In this work, we derive closed-form analytical expressions for shadow estimation using brickwork circuits with two layers of parallel two-local Haar-random (or Clifford) unitaries. Besides the construction of the classical shadow, our results give rise to sample-complexity guarantees for estimating Pauli observables. We then compare the performance of shadow estimation with brickwork circuits to the established approach using local Clifford unitaries and find improved sample complexity in the estimation of observables supported on sufficiently many qubits.

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)
• Thrifty shadow estimation: re-using quantum circuits and bounding tails [1.6814343144960449]
  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.
  arXiv  Detail & Related papers  (2022-12-12T20:50:41Z)
• 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)
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks [0.0]
  We show a scalable classical shadow tomography approach for generic randomized measurements implemented with finite-depth local Clifford random unitary circuits. The method enables classical shadow tomography to be performed on shallow quantum circuits with superior sample efficiency and minimal gate overhead.
  arXiv  Detail & Related papers  (2022-09-05T18:42:53Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Faster Born probability estimation via gate merging and frame optimisation [3.9198548406564604]
  Outcome probabilities of any quantum circuit can be estimated using Monte Carlo sampling. We propose two classical sub-routines: circuit gate optimisation and frame optimisation. We numerically demonstrate that our methods provide improved scaling in the negativity overhead for all tested cases of random circuits.
  arXiv  Detail & Related papers  (2022-02-24T14:18:34Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Path Sample-Analytic Gradient Estimators for Stochastic Binary Networks [78.76880041670904]
  In neural networks with binary activations and or binary weights the training by gradient descent is complicated. We propose a new method for this estimation problem combining sampling and analytic approximation steps. We experimentally show higher accuracy in gradient estimation and demonstrate a more stable and better performing training in deep convolutional models.
  arXiv  Detail & Related papers  (2020-06-04T21:51:21Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.