Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B

Combinatorics and fermion algebra

A. M. Navon

Published Aug 1, 1973• 40 citations
Publisher
DOI
10.1007/bf02828687

Related papers

Entanglement of Free-Fermion Systems, Signal Processing and Algebraic Combinatorics

Pierre-Antoine Bernard, Nicolas Crampé, Rafael I. Nepomechie +2 more

arXiv:2401.07150•Springer eBooks•Jan 1, 2025•5 citations

Combinatorics of a strongly coupled boson system

N. M. Bogoliubov

Theoretical and Mathematical Physics•Oct 1, 2014•0 citations

Combinatorial solution of the free-fermion model

F.W. Wiegel

Physics Letters A•Sep 1, 1972•11 citations

Algebra for fermions with a new exclusion principle

A K Mishra, G. Rajasekaran

Pramana•May 1, 1991•33 citations

Quantum Spin Chains and Symmetric Functions

Marcos Crichigno, Prakash, Anupam

We consider the question of what quantum spin chains naturally encode in their Hilbert space. It turns out that quantum spin chains are rather rich systems, naturally encoding solutions to various problems in combinatorics, group theory, and algebraic geometry. In the case of the XX Heisenberg spin chain these are given by skew Kostka numbers, skew characters of the symmetric group, and Littlewood-Richardson coefficients. As we show, this is revealed by a fermionic representation of the theory of "quantized" symmetric functions formulated by Fomin and Greene, which provides a powerful framework for constructing operators extracting this data from the Hilbert space of quantum spin chains. Furthermore, these operators are diagonalized by the Bethe basis of the quantum spin chain. Underlying this is the fact that quantum spin chains are examples of "quantum integrable systems." This is somewhat analogous to bosons encoding permanents and fermions encoding determinants. This points towards considering quantum integrable systems, and the combinatorics associated with them, as potentially interesting targets for quantum computers.

arXiv:2404.04322•Apr 5, 2024•1 citation

Quantum codes from finite geometry and combinatorial designs (Finite groups, vertex operator algebras and combinatorics)

Vladimir D. Tonchev

数理解析研究所講究録•Jul 1, 2009•1 citation
We consider the question of what quantum spin chains naturally encode in their Hilbert space. It turns out that quantum spin chains are rather rich systems, naturally encoding solutions to various problems in combinatorics, group theory, and algebraic geometry. In the case of the XX Heisenberg spin chain these are given by skew Kostka numbers, skew characters of the symmetric group, and Littlewood-Richardson coefficients. As we show, this is revealed by a fermionic representation of the theory of "quantized" symmetric functions formulated by Fomin and Greene, which provides a powerful framework for constructing operators extracting this data from the Hilbert space of quantum spin chains. Furthermore, these operators are diagonalized by the Bethe basis of the quantum spin chain. Underlying this is the fact that quantum spin chains are examples of "quantum integrable systems." This is somewhat analogous to bosons encoding permanents and fermions encoding determinants. This points towards considering quantum integrable systems, and the combinatorics associated with them, as potentially interesting targets for quantum computers.