Sample-optimal classical shadows for pure states
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916292238245888 |
|---|---|
| author | Grier, Daniel Pashayan, Hakop Schaeffer, Luke |
| author_facet | Grier, Daniel Pashayan, Hakop Schaeffer, Luke |
| contents | 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 $\mathrm{Tr}(O ρ)$ for any Hermitian observable $O$ to within additive error $ε$ provided $\mathrm{Tr}(O^2)\leq B$ and $\lVert O \rVert = 1$. Our main result applies to the joint measurement setting, where we show $\tildeΘ(\sqrt{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 $\mathcal O(\sqrt{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_11810 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Sample-optimal classical shadows for pure states Grier, Daniel Pashayan, Hakop Schaeffer, Luke Quantum Physics Information Theory Machine Learning 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 $\mathrm{Tr}(O ρ)$ for any Hermitian observable $O$ to within additive error $ε$ provided $\mathrm{Tr}(O^2)\leq B$ and $\lVert O \rVert = 1$. Our main result applies to the joint measurement setting, where we show $\tildeΘ(\sqrt{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 $\mathcal O(\sqrt{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. |
| title | Sample-optimal classical shadows for pure states |
| topic | Quantum Physics Information Theory Machine Learning |
| url | https://arxiv.org/abs/2211.11810 |