Robust Shadow Estimation

  title={Robust Shadow Estimation},
  author={Senrui Chen and Wenjun Yu and Pei Zeng and Steven T. Flammia},
  journal={PRX Quantum},
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… 

Figures and Tables from this paper

Avoiding barren plateaus using classical shadows
This work defines a notion of weak barren plateaus (WBP) based on the entropies of local reduced density matrices and demonstrates that decreasing the gradient step size allows to avoid WBPs during the optimization process.
Classical shadows with Pauli-invariant unitary ensembles
The class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator are considered, which pave the way for more efficient or robust protocols for predicting important properties of quantum states.
Exponential Separations Between Learning With and Without Quantum Memory
It is proved that to estimate absolute values of all $n-qubit Pauli observables, algorithms with k < n qubits of quantum memory require at least $\Omega(2^{(n-k)/3})$ samples, but there is an algorithm using $n$-qu bit quantum memory which only requires $\mathcal{O}(n)$ samples.
Hamiltonian-Driven Shadow Tomography of Quantum States
Facing the challenge of realizing deep unitary circuits on near-term quantum devices, this work explores the scenario in which the unitary channel can be shallow and is generated by a quantum chaotic Hamiltonian via time evolution, and provides an unbiased estimator of the density matrix for all ranges of the evolution time.
Hardware-efficient entangled measurements for variational quantum algorithms
Variational algorithms have received significant attention in recent years due to their potential to solve practical problems in noisy intermediate-scale quantum (NISQ) devices. A fundamental step of
Logical shadow tomography: Efficient estimation of error-mitigated observables
Hong-Ye Hu, 2, 3, 4, ∗ Ryan LaRose, 3, ∗ Yi-Zhuang You, Eleanor Rieffel, and Zhihui Wang 4, † Department of Physics, University of California San Diego, La Jolla, CA 92093, USA Department of Physics,
Magic hinders quantum certification
The resource theory of magic quantifies the hardness of quantum certification protocols, showing that the resources needed to certify the quality of the application of a given unitary U are governed by the magic in the Choi state associated with U, which is shown to possess a profound connection with out-of-time order correlators.
Probing Many-Body Quantum Chaos with Quantum Simulators
Lata Kh Joshi, 2, ∗ Andreas Elben, 2, 3, ∗ Amit Vikram, 5 Benôıt Vermersch, 2, 6 Victor Galitski, 5 and Peter Zoller 2 Center for Quantum Physics, University of Innsbruck, Innsbruck A-6020, Austria
Quantum advantages for Pauli channel estimation
We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for
The randomized measurement toolbox
Andreas Elben,1, 2, 3, 4 Steven T. Flammia,5, 1 Hsin-Yuan Huang,1, 6 Richard Kueng,7 John Preskill,1, 2, 6, 5 Benoît Vermersch,3, 4, 8 and Peter Zoller3, 4 Institute for Quantum Information and


and s
Classical shadows with noise (2020), arXiv:2011.11580
  • 2011
Estimating expectation values using approximate quantum states
An operational procedure for constructing the approximate description of the state that requires, besides the quantum state preparation, only single- qubit rotations followed by single-qubit measurements is described.
PRX Quantum 2
  • 010322
  • 2021
Physical Review A 103
  • 042605
  • 2021
Quantum 5
  • 413
  • 2021
Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors
It is shown that the Randomized Benchmarking protocol is a convolution amenable to Fourier space analysis, and an alternative proof of Wallman's and Proctor's bounds on the effect of gate-dependent noise on randomized benchmarking is provided.
  • Mod. Phys. 93, 025005
  • 2021
ACM Transactions on Quantum Computing 1
  • 1
  • 2020
Efficient Estimation of Pauli Channels
These results enable a host of applications beyond just characterizing noise in a large-scale quantum system: they pave the way to tailoring quantum codes, optimizing decoders, and customizing fault tolerance procedures to suit a particular device.