English
Related papers

Related papers: Sample-optimal classical shadows for pure states

200 papers

We study the sample complexity of the classical shadows task: what is the fewest number of copies of an unknown state you need to measure to predict expected values with respect to some class of observables? Large joint measurements are…

Quantum Physics · Physics 2024-05-16 Daniel Grier , Sihan Liu , Gaurav Mahajan

Given many copies of an unknown quantum state $\rho$, we consider the task of learning a classical description of its principal eigenstate. Namely, assuming that $\rho$ has an eigenstate $|\phi\rangle$ with (unknown) eigenvalue $\lambda >…

Quantum Physics · Physics 2024-07-09 Daniel Grier , Hakop Pashayan , Luke Schaeffer

We give the first tight sample complexity bounds for shadow tomography and classical shadows in the regime where the target error is below some sufficiently small inverse polynomial in the dimension of the Hilbert space. Formally we give a…

Quantum Physics · Physics 2024-07-22 Sitan Chen , Jerry Li , Allen Liu

We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown $d$-dimensional quantum state $\rho$ and a known set of observables $\{O_i\}_{i=1}^m$, the goal is to…

Quantum Physics · Physics 2026-02-06 Senrui Chen , Weiyuan Gong , Sisi Zhou

Efficiently learning expectation values of a quantum state using classical shadow tomography has become a fundamental task in quantum information theory. In a classical shadows protocol, one measures a state in a chosen basis W after it has…

Quantum Physics · Physics 2025-06-04 Maxwell West , Antonio Anna Mele , Martin Larocca , M. Cerezo

A crucial subroutine for various quantum computing and communication algorithms is to efficiently extract different classical properties of quantum states. In a notable recent theoretical work by Huang, Kueng, and Preskill [Nat. Phys. 16,…

Quantum Physics · Physics 2021-11-19 Ting Zhang , Jinzhao Sun , Xiao-Xu Fang , Xiao-Ming Zhang , Xiao Yuan , He Lu

We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of $M$ observables $O_1, \ldots, O_M$ with $\varepsilon$ accuracy, but $\gamma$-fraction of the outcomes can be…

Predicting properties of complex, large-scale quantum systems is essential for developing quantum technologies. We present an efficient method for constructing an approximate classical description of a quantum state using very few…

Quantum Physics · Physics 2021-04-20 Hsin-Yuan Huang , Richard Kueng , John Preskill

Classical shadows are a computationally efficient approach to storing quantum states on a classical computer for the purposes of estimating expectation values of local observables, obtained by performing repeated random measurements. In…

Quantum Physics · Physics 2023-05-03 Saumya Shivam , C. W. von Keyserlingk , S. L. Sondhi

Classical shadows are an efficient method for constructing an approximate classical description of a quantum state using very few measurements. In the paper we propose to enhance classical shadow methods using bootstrap resampling methods.…

Quantum Physics · Physics 2025-11-18 Eric Ghysels , Jack Morgan

Classical Shadow Tomography (Huang, Kueng and Preskill, Nature Physics 2020) is a method for creating a classical snapshot of an unknown quantum state, which can later be used to predict the value of an a-priori unknown observable on that…

Quantum Physics · Physics 2025-07-15 Zvika Brakerski , Nir Magrafta , Tomer Solomon

Learning quantum state properties is both a fundamental and practical problem in quantum information theory. Classical shadows have emerged as an efficient method for estimating properties of unknown quantum states, with rigorous…

Quantum Physics · Physics 2026-03-30 Hugo Thomas , Ulysse Chabaud , Pierre-Emmanuel Emeriau

The method of classical shadows heralds unprecedented opportunities for quantum estimation with limited measurements [H.-Y. Huang, R. Kueng, and J. Preskill, Nat. Phys. 16, 1050 (2020)]. Yet its relationship to established quantum…

Quantum Physics · Physics 2021-07-19 Joseph M. Lukens , Kody J. H. Law , Ryan S. Bennink

Classical shadows (CS) have emerged as a powerful way to estimate many properties of quantum states based on random measurements and classical post-processing. In their original formulation, they come with optimal (or close to) sampling…

Quantum Physics · Physics 2024-08-13 Frederic Sauvage , Martin Larocca

Shadow tomography is a framework for constructing succinct descriptions of quantum states using randomized measurement bases, called classical shadows, with powerful methods to bound the estimators used. We recast existing experimental…

Classical shadow tomography (CST) involves obtaining enough classical descriptions of an unknown state via quantum measurements to predict the outcome of a set of quantum observables. CST has numerous applications, particularly in…

Quantum Physics · Physics 2025-05-22 Zahra Honjani , Mohsen Heidari

Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve…

Quantum Physics · Physics 2026-05-08 Rebecca Chang , Maureen Krumtünger , Martin Larocca , Maxwell West

Classical shadows are a powerful method for learning many properties of quantum states in a sample-efficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli…

Quantum Physics · Physics 2023-06-13 Matteo Ippoliti , Yaodong Li , Tibor Rakovszky , Vedika Khemani

Classical shadows provide a versatile framework for estimating many properties of quantum states from repeated, randomly chosen measurements without requiring full quantum state tomography. When prior information is available, such as…

Quantum Physics · Physics 2026-05-27 Jacob Bringewatt , Henry Froland , Andreas Elben , Niklas Mueller

We provide more sample-efficient versions of some basic routines in quantum data analysis, along with simpler proofs. Particularly, we give a quantum "Threshold Search" algorithm that requires only $O((\log^2 m)/\epsilon^2)$ samples of a…

Quantum Physics · Physics 2024-08-07 Costin Bădescu , Ryan O'Donnell
‹ Prev 1 2 3 10 Next ›