Metraipolis › archive › dc_4e47d15924c0

Exact Operator Complexity Measures from Random Matchgate Unitaries — arXiv:2609.38300

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38300
License (as archived)
CC0-1.0
Archived
2026-10-07T15:20:45.611Z
SHA-256 of the archived text
433f66148925e06ca243e366e976c7212e7678d332dedd4ff5acd276f3642b9d
Stable URL of this page
https://metraipolis.com/documento/dc_4e47d15924c0

How to cite

Exact Operator Complexity Measures from Random Matchgate Unitaries — arXiv:2609.38300 — arXiv (en), https://arxiv.org/abs/2609.38300 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4e47d15924c0 (Metraipolis archive dc_4e47d15924c0, sha256 433f66148925e06ca243e366e976c7212e7678d332dedd4ff5acd276f3642b9d)
BibTeX
@misc{dc4e47d15924c0,
  title = {Exact Operator Complexity Measures from Random Matchgate Unitaries — arXiv:2609.38300},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38300},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4e47d15924c0; sha256 433f66148925e06ca243e366e976c7212e7678d332dedd4ff5acd276f3642b9d},
  year = {2026}
}

Archived text

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

Matchgate circuits describe classically tractable dynamics in a physically relevant setting while nonetheless exhibiting features characteristic of complex quantum systems, such as high amounts of magic. This invites the broader question: to what extent are typical complexity measures saturated under trivial dynamics? Here, we address this by studying the behaviour of different Heisenberg-picture complexity measures in random matchgate ensembles. Our main technical contribution is a tractable and generalisible free-fermionic unitary Weingarten calculus formulated entirely in the Majorana basis. This method is tailored to computing moments of operators, and simplifies to a combinatorics problem which depends on the boundary conditions prescribed by a given operator functional. Using this framework, we derive closed-form expressions for the typical local-operator entanglement, operator stabiliser entropy, and higher-order out-of-time-ordered correlators. For extensive initial Majorana strings, both operator entanglement and stabiliser entropy obey volume laws, even though the underlying circuits remain classically simulable. Out-of-time-ordered correlators can likewise become exponentially small, showing that their late-time saturation value alone does not witness computational hardness and constituting a classically tractable example of emergent free independence. Finally, we relate these separations to operator resource theories, showing how operator entanglement beyond the Gaussian baseline lower-bounds the number of non-Gaussian gates in doped matchgate circuits. Our results present a practical toolbox for computing exact averages over random matchgates, while clarifying the distinction between quantum resources versus simulation complexity, and their dependence on the representation being exploited.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.38300 — 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.590Z 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).