Adaptivity can help exponentially for shadow tomography

Sitan Chen, Weiyuan Gong, Zhihan Zhang
12/26/2024
quant-phcs.ITcs.LG

No confident code implementation found for this paper.

Abstract

In recent years there has been significant interest in understanding the statistical complexity of learning from quantum data under the constraint that one can only make unentangled measurements. While a key challenge in establishing tight lower bounds in this setting is to deal with the fact that the measurements can be chosen in an adaptive fashion, a recurring theme has been that adaptivity offers little advantage over more straightforward, nonadaptive protocols. In this note, we offer a counterpoint to this. We show that for the basic task of shadow tomography, protocols that use adaptively chosen two-copy measurements can be exponentially more sample-efficient than any protocol that uses nonadaptive two-copy measurements.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{chen2024adaptivity,
  title  = {Adaptivity can help exponentially for shadow tomography},
  author = {Sitan Chen and Weiyuan Gong and Zhihan Zhang},
  year   = {2024},
  eprint = {2412.19022},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.19022v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.19022.svg)](https://codeofpaper.com/paper/2412.19022)

Discussion