Title | Sample-optimal classical shadows for pure states |

Publication Type | Journal Article |

Year of Publication | 2022 |

Authors | Grier, D, Pashayan, H, Schaeffer, L |

Date Published | 11/21/2022 |

Keywords | FOS: Computer and information sciences, FOS: Physical sciences, Information Theory (cs.IT), Machine Learning (cs.LG), Quantum Physics (quant-ph) |

Abstract | We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state ρ in order to learn a classical description which suffices to later estimate expectation values of observables. Specifically, the goal is to approximate Tr(Oρ) for any Hermitian observable O to within additive error ϵ provided Tr(O2)≤B and ∥O∥=1. Our main result applies to the joint measurement setting, where we show Θ~(B−−√ϵ−1+ϵ−2) samples of ρ are necessary and sufficient to succeed with high probability. The upper bound is a quadratic improvement on the previous best sample complexity known for this problem. For the lower bound, we see that the bottleneck is not how fast we can learn the state but rather how much any classical description of ρ can be compressed for observable estimation. In the independent measurement setting, we show that O(Bd−−−√ϵ−1+ϵ−2) samples suffice. Notably, this implies that the random Clifford measurements algorithm of Huang, Kueng, and Preskill, which is sample-optimal for mixed states, is not optimal for pure states. Interestingly, our result also uses the same random Clifford measurements but employs a different estimator. |

URL | https://arxiv.org/abs/2211.11810 |

DOI | 10.48550/ARXIV.2211.11810 |