Exact Operator Complexity Measures from Random Matchgate Unitaries
quant-ph, cond-mat.stat-mech, math-ph, math.MP
Submitted: 2026-09-29
Updated: 2026-09-29
Terminology
Sources
- Classical Simulability from Operator Entanglement Scaling
- Learning, Optimizing, and Simulating Fermions with Quantum Computers
- Optimal Haar random fermionic linear optics circuits
- Theory of the Matchgate Commutant
- The commutant of fermionic Gaussian unitaries
- Fermionic Averaged Circuit Eigenvalue Sampling
- Page Curve for Local-Operator Entanglement from Free Probability
- Noise-induced Simulability Transition from Operator Scrambling
- Free Independence and Unitary Design from Random Matrix Product Unitaries
- Exact Enumeration and Sampling of Matrices with Specified Margins
- Coarse-grained dynamics of operator and state entanglement
- Natural super-orbitals representation of many-body operators
- Entangling power and quantum circuit complexity
- Simulation of Fermionic circuits using Majorana Propagation
- Resolving space-time structures of quantum impurities with a numerically exact few-body algorithm
- Classical shadows over symmetric spaces
- Continuum field theory of matchgate tensor network ensembles
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity