Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 16 min ago
PreprintarXiv licencearXiv

Efficient Learning of Fermionic Magic States under Free-Fermion Evolution

Abstract

We establish efficient learning for a family of fermionic magic states under unknown number-conserving free-fermion evolution. Each input block has a definite particle number and is a superposition of Fock states, with occupied mode sets disjoint both within and across blocks. The key idea is to exploit the spectral structure of particle reduced density matrices (RDMs) to separate contributions from individual blocks from those involving several blocks, allowing us to reconstruct the hidden block structure. For a fixed upper bound on the particle number per block, our algorithm uses single-copy measurements and polynomial sample and classical computational complexity to recover a compact description of the state with prescribed fidelity and high probability, without prior knowledge of the block decomposition or the evolution. RDMs up to this upper bound suffice for reconstruction. We further show that this RDM order is necessary in general: two orthogonal states in the family can have identical RDMs at every lower order. These results show that an extensive number of non-Gaussian blocks can be compatible with efficient state learning.

Related

  1. Efficient Learning of Structured Fermionic States under General Quadratic Evolution
    Erfan Amidi, Ali Asadian, Ali Hamed Moosavian
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. Quasi-bound states and late-time evolution of a massive fermion around a Reissner-Nordström black hole
    Guang-Shang Chen, Cheng-Bo Yang, Shou-Shan Bao +2
    arXivPreprintarXiv licenceFull textGravitation & general relativityarXiv
  3. Provably Efficient Learning of Fermionic Correlations under Particle-Number Symmetry
    Yuki Koizumi, Kaito Wada, Toshinori P. Takama +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Efficient Hamiltonian, structure and trace distance learning of Gaussian states.
    Marco Fanizza, Cambyse Rouzé, Daniel Stilck França
    Nature communicationsPeer-reviewedCC BYFull text24 citedQuantum physics & quantum informationEurope PMCOpenAlex
  5. Efficient Learning of Clifford-Scrambled Product States
    Tobias Haug
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{heo2026efficient,
  title = {{Efficient Learning of Fermionic Magic States under Free-Fermion Evolution}},
  author = {Jiwon Heo and Myeongjin Shin and Changhun Oh},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.39372},
  eprint = {2609.39372},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.39372},
}
RIS
TY  - UNPB
TI  - Efficient Learning of Fermionic Magic States under Free-Fermion Evolution
AU  - Jiwon Heo
AU  - Myeongjin Shin
AU  - Changhun Oh
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.39372
UR  - https://arxiv.org/abs/2609.39372
AB  - We establish efficient learning for a family of fermionic magic states under unknown number-conserving free-fermion evolution. Each input block has a definite particle number and is a superposition of Fock states, with occupied mode sets disjoint both within and across blocks. The key idea is to exploit the spectral structure of particle reduced density matrices (RDMs) to separate contributions from individual blocks from those involving several blocks, allowing us to reconstruct the hidden block structure. For a fixed upper bound on the particle number per block, our algorithm uses single-copy measurements and polynomial sample and classical computational complexity to recover a compact description of the state with prescribed fidelity and high probability, without prior knowledge of the block decomposition or the evolution. RDMs up to this upper bound suffice for reconstruction. We further show that this RDM order is necessary in general: two orthogonal states in the family can have identical RDMs at every lower order. These results show that an extensive number of non-Gaussian blocks can be compatible with efficient state learning.
ER  -