{
  "abstract": "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\\%$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.40173",
  "author_total": 5,
  "authors": [
    {
      "name": "Maxwell West"
    },
    {
      "name": "Su Yeon Chang"
    },
    {
      "name": "Luke Coffman"
    },
    {
      "name": "Martin Larocca"
    },
    {
      "name": "M. Cerezo"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/85g5053z2pf0x.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.40173",
  "fulltext_url": null,
  "id": "85g5053z2pf0x",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.40173",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7215107385",
  "pdf_url": "https://arxiv.org/pdf/2609.40173",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/85g5053z2pf0x.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:49Z",
      "native_id": "2609.40173",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.40173"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Practical fermionic shadows enabled by improved sample-complexity bounds",
  "title_text": "Practical fermionic shadows enabled by improved sample-complexity bounds",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:49Z",
  "url": "https://research.draconitic.com/paper/85g5053z2pf0x",
  "venue": "arXiv",
  "versions": []
}