Metraipolis › archive › dc_a9075eae3e2d

Robust exponential lower bounds for fermionic and bosonic Gaussian ranks — arXiv:2610.02172

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02172
License (as archived)
CC0-1.0
Archived
2026-10-07T11:38:39.724Z
SHA-256 of the archived text
c27debcb7e57fd2cc7ce55b699954e771b5e8f18cc479e59e72dc3e0ebcc67a5
Stable URL of this page
https://metraipolis.com/documento/dc_a9075eae3e2d

How to cite

Robust exponential lower bounds for fermionic and bosonic Gaussian ranks — arXiv:2610.02172 — arXiv (en), https://arxiv.org/abs/2610.02172 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a9075eae3e2d (Metraipolis archive dc_a9075eae3e2d, sha256 c27debcb7e57fd2cc7ce55b699954e771b5e8f18cc479e59e72dc3e0ebcc67a5)
BibTeX
@misc{dca9075eae3e2d,
  title = {Robust exponential lower bounds for fermionic and bosonic Gaussian ranks — arXiv:2610.02172},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02172},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a9075eae3e2d; sha256 c27debcb7e57fd2cc7ce55b699954e771b5e8f18cc479e59e72dc3e0ebcc67a5},
  year = {2026}
}

Archived text

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

The power and limitations of classical simulation are central to understanding quantum computational advantages. A leading simulation paradigm is based on coherent decomposition into classically tractable free states where the decomposition rank determines the simulation complexity. Proving strong lower bounds on this number is a notoriously difficult and mathematically rich problem, as exemplified by the qubit stabilizer rank problem. Here, we study the Gaussian version of this problem in both bosonic and fermionic systems and establish robust exponential lower bounds on Gaussian rank. In particular, we prove that for every pure non-Gaussian state on finitely many modes, with definite parity in the fermionic case, the approximate border Gaussian rank of its tensor powers grows at least exponentially at any fixed norm error below one. Our proofs combine reduction to four modes with Majorana spectral bounds for fermions, and Gaussian postselection with an entropy-based rank bound for bosons. As concrete examples, we derive explicit exponential lower bounds for the four-mode fermionic GHZ state and the bosonic single-photon state. The bosonic results require no assumption on the energy of the target state. Our results show that non-Gaussianity universally entails exponential Gaussian decomposition complexity, setting fundamental limitations on decomposition-based classical simulation of bosonic and fermionic systems.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.02172 — 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-07T11:19:01.766Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).