Metraipolis › archive › dc_7c14f21029aa

Logarithmic-Depth Fermion Sampling: Anticoncentration and Average-Case Hardness — arXiv:2609.40100

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40100
License (as archived)
CC0-1.0
Archived
2026-10-07T15:22:06.172Z
SHA-256 of the archived text
03b7b7d4d16351bffb646925e3ad23585c56312fcc81b2a739057564f592b8c7
Stable URL of this page
https://metraipolis.com/documento/dc_7c14f21029aa

How to cite

Logarithmic-Depth Fermion Sampling: Anticoncentration and Average-Case Hardness — arXiv:2609.40100 — arXiv (en), https://arxiv.org/abs/2609.40100 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c14f21029aa (Metraipolis archive dc_7c14f21029aa, sha256 03b7b7d4d16351bffb646925e3ad23585c56312fcc81b2a739057564f592b8c7)
BibTeX
@misc{dc7c14f21029aa,
  title = {Logarithmic-Depth Fermion Sampling: Anticoncentration and Average-Case Hardness — arXiv:2609.40100},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40100},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c14f21029aa; sha256 03b7b7d4d16351bffb646925e3ad23585c56312fcc81b2a739057564f592b8c7},
  year = {2026}
}

Archived text

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

Sampling problems give some of the clearest conditional separations between quantum and classical computation. In Fermion Sampling, passive linear optics acts on a non-Gaussian magic input. Globally Haar-random transformations give anticoncentration and high-precision average-case hardness, but require linear depth and quadratically many gates. A natural open question is whether linear depth is necessary? We show that logarithmic depth suffices for both guarantees in the same ensemble. For fresh uniform matchings with independent Haar two-mode gates, the collision reaches the passive-Haar scale at a sharp threshold of $\log n/\log(9/4)\approx0.855\log_2 n$ layers, with an explicit limiting transition profile and a matching lower bound from two-particle correlations. The mechanism is input-dependent: the magic input suppresses the extensive weight of the slowest relaxation mode, leaving the next to set the scale. An occupation-basis input retains large collision even under full Haar randomness. At a larger logarithmic depth, we prove, in the real-RAM model, average-case $\#\mathsf{P}$-hardness of estimating output probabilities to additive error $2^{-O(n\log^2 n)}$ on any fixed fraction of instances above $3/4$. We construct hard instances in four native layers, embed them in typical schedules, and interpolate along Cayley paths using a rational linear-program decoder. A finite $192$-gate alphabet preserves the collision law exactly. Both guarantees use logarithmic native fermionic depth between arbitrary mode pairs and $O(n\log n)$ gates, replacing the global-Haar construction's quadratic budget. The accuracy proved is finer than the $1/N$ scale, where $N=\binom{n}{n/2}$, required by sampling-to-counting; hardness of sampling within constant total-variation distance remains open.

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.40100 — 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.803Z 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).