Metraipolis › archive › dc_eecfc4935cee

Practical fermionic shadows enabled by improved sample-complexity bounds — arXiv:2609.40173

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.40173
License (as archived): CC0-1.0
Archived: 2026-10-07T15:22:14.938Z
SHA-256 of the archived text: 8a838c1b1eaf83d7f39ea799e3c6069ccac8a99ab9f8996234add254b36a1b11
Stable URL of this page: https://metraipolis.com/documento/dc_eecfc4935cee

How to cite

Practical fermionic shadows enabled by improved sample-complexity bounds — arXiv:2609.40173 — arXiv (en), https://arxiv.org/abs/2609.40173 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eecfc4935cee (Metraipolis archive dc_eecfc4935cee, sha256 8a838c1b1eaf83d7f39ea799e3c6069ccac8a99ab9f8996234add254b36a1b11)

BibTeX

@misc{dceecfc4935cee,
  title = {Practical fermionic shadows enabled by improved sample-complexity bounds — arXiv:2609.40173},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40173},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eecfc4935cee; sha256 8a838c1b1eaf83d7f39ea799e3c6069ccac8a99ab9f8996234add254b36a1b11},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40173. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Classical shadow tomography is widely touted as supplying a family of methods for extracting information from quantum systems with polynomially scaling sample-complexities. In the current era of quantum computers possessing on the order of hundreds of qubits, however, polynomial scaling can nonetheless be prohibitive. Thus, there is a strong practical need for obtaining sample-complexity bounds which are as tight as possible. Here we address this in the case of fermionic (matchgate) shadows. For an arbitrary observable $O$ of Majorana degree $2k$, we improve the previously known sample-complexity bound of $\mathcal{O}(n^{2k}\|O\|_\infty^2)$ to $\mathcal{O}(n^{k}\|O\|_\infty^2)$, which is asymptotically tight. For example, for the estimation of the energy per mode of an open fermionic 50-site Hubbard chain with hopping and on site strenghts respectively given by $t=1$, $V=4$, and for a target additive precision of 0.1, this reduces the number of required shots from $\sim 10^9$ to $\sim 10^5$. That is, the new bound reduces the required number of shots by approximately $99.98\%$.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.40173 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:53:56.824Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).