Efficient Learning of Structured Fermionic States under General Quadratic Evolution
quant-ph
Submitted: 2026-10-06
Updated: 2026-10-15
Comments: 46 pages, 3 figures; supporting Lean files included as ancillary material
License: http://creativecommons.org/licenses/by/4.0/
The gist: We prove that unknown pure fermionic states prepared from disjoint-branch fixed-particle-number blocks can be reconstructed after general quadratic evolution, including pair creation and annihilation.
Abstract
We prove that unknown pure fermionic states prepared from disjoint-branch fixed-particle-number blocks can be reconstructed after general quadratic evolution, including pair creation and annihilation. For a fixed particle cap per block, adaptive or nonadaptive single-copy Gaussian measurements yield classical input and circuit descriptions with prescribed fidelity and confidence, using polynomial resources in system size and inverse infidelity. The adaptive procedure has the sharper copy guarantee. Connected quartic correlations and a covariance-compatible commutant identify the hidden blocks; local states are recovered from fresh measurements or a predetermined bounded-degree moment table. Stable branch recovery gives valid preparation descriptions. Neither particle-number conservation nor block homogeneity is required; no lower bound on branch weights or covariance gaps is assumed. A certified variant returns a passive preparation whenever one exists within the promised family, without advance membership information. On the full Gaussian orbit of paired magic states, quartic measurements alone suffice, with an explicit bound converting observable error into state error.
Sources
- Matchgate Shadows for Fermionic Quantum Simulation
- Efficient Learning of Fermionic Magic States under Free-Fermion Evolution
- Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency
- Learning SYK Hamiltonians
- Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
- Classical shadows of fermions with particle number symmetry
- Algorithms in Real Algebraic Geometry: A Survey
- Practical fermionic shadows enabled by improved sample-complexity bounds
- The Hubbard Dimer: A density functional case study of a many-body problem
- Simulating Majorana zero modes on a noisy quantum processor
- Detecting null patterns in tensor data
- A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors
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
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians