Generalized Pauli Constraints

• Generalized Pauli Constraints (GPC) are additional linear inequalities on natural occupation numbers that stem from the antisymmetry of fermionic pure states.
• They carve out a convex polytope within the conventional Pauli simplex, exemplified by explicit cases like the Borland–Dennis scenario and derived via representation theory.
• GPCs impact quantum chemistry and quantum information by enabling pinning and quasipinning effects, which can simplify configuration interaction and improve computational models.

Generalized Pauli Constraints (GPC) are linear inequalities on the natural occupation numbers (NONs)—i.e., the ordered eigenvalues of the one-body reduced density matrix—arising from the full antisymmetry of N-fermion pure states in a finite one-particle Hilbert space. These constraints refine the standard Pauli exclusion principle, which states only that $0 \leq \lambda_i \leq 1$, and provide a more complete characterization of which NON spectra are physically realizable. The discovery and mathematical structure of GPCs, particularly via work of Klyachko, Coleman's theory, and subsequent explicit classification, has led to renewed foundational and practical interest in electronic structure theory, quantum information, and the marginal problem for fermionic systems (Reuvers, 2019, Schilling, 2015, Chakraborty et al., 2014, Smart et al., 2020).

1. Formal Definition and Mathematical Structure

For an N-fermion pure state in a $d$-dimensional one-body Hilbert space $\mathbb{C}^d$, let the ordered NONs be $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$, with normalization $\sum_{i=1}^d \lambda_i = N$. Beyond the Pauli exclusion principle ($0 \leq \lambda_i \leq 1$), GPCs are additional homogeneous linear inequalities:

$c_1 \lambda_1 + \ldots + c_d \lambda_d \leq b$

with integer ($c_i$) or half-integer coefficients, and integer $b$ determined by the antisymmetric structure of $\wedge^N \mathbb{C}^d$ (Reuvers, 2019). The set of all physically allowed spectra forms a convex polytope, $d$0, carved out of the "Pauli simplex" $d$1:

• Pauli simplex: $d$2
• Fermionic polytope: $d$3, defined by the additional GPCs.

The precise enumeration of GPC facets is algorithmically generated via U(d) representation theory and moment polytope analysis (Horn–Klyachko inequalities) (Schilling, 2015).

2. Explicit Examples and the Borland–Dennis Case

The smallest nontrivial instance illustrating GPCs is three electrons ($d$4) in six spin-orbitals ($d$5), the so-called Borland–Dennis case. The constraints are: $d$6 along with the trivial ordering and normalization (Reuvers, 2019, Smart et al., 2020, Chakraborty et al., 2014, Theophilou et al., 2017). For $d$7, there are 6 nontrivial GPCs such as $d$8, all of similarly explicit form.

3. Geometric and Volumetric Properties

Both the Pauli simplex and the fermionic GPC polytope are $d$9-dimensional. The volume of $\mathbb{C}^d$0 denotes the physical region allowed by all GPCs, while $\mathbb{C}^d$1 corresponds to enforcing only $\mathbb{C}^d$2. A key asymptotic result is that for fixed $\mathbb{C}^d$3: $\mathbb{C}^d$4 with the "volume gap" $\mathbb{C}^d$5 decaying super-exponentially: $\mathbb{C}^d$6 Hence, for moderate or large $\mathbb{C}^d$7, the corrections to Pauli's principle provided by GPCs become negligible (Reuvers, 2019).

4. Physical Regimes of Relevance: Pinning and Quasipinning

GPCs are most restrictive in few-fermion, low-dimensional Hilbert spaces. "Pinning" refers to exact saturation of a GPC (i.e., a spectrum lies exactly on a facet), leading to strong constraints on the wavefunction structure. More typically, one finds "quasipinning," where saturation is nearly achieved ($\mathbb{C}^d$8). For systems like small atoms or artificial few-fermion traps, such nontrivial quasipinning has been observed numerically and experimentally (Schilling et al., 2017, Legeza et al., 2017, Chakraborty et al., 2014, Smart et al., 2020).

Quasipinning is quantified by the minimum $\mathbb{C}^d$9-distance to any facet, $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$0, and a "Q-parameter" distinguishing genuine GPC saturation from trivial proximity due to the original exclusion bounds (Schilling et al., 2017, Tennie et al., 2016). Nontrivial quasipinning (large Q) typically induces selection rules on the CI expansion, leading to a drastic reduction in contributing Slater determinants (Schilling, 2015, Theophilou et al., 2017, Liebert et al., 21 Feb 2025).

5. Algorithmic Generation and Spin-Adapted GPCs

Klyachko’s algorithm generates all GPCs for given $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$1 using representation theory: one identifies Young diagrams corresponding to highest-weight states of $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$2 and translates branching rules into explicit inequalities. Spin-adapted GPCs use SU(2) symmetry to reduce the dimension of the problem, yielding far fewer constraints—this allows for explicit GPC lists for larger system sizes, with the number of facets decreasing by orders of magnitude compared to the spin-blind case (Liebert et al., 21 Feb 2025).

When a spin-adapted GPC is (quasi) pinned, a superselection rule is triggered: the wavefunction must be a superposition only of those configuration state functions for which the corresponding operator has eigenvalue zero, leading to significant CI structure simplification.

6. Implications in Quantum Chemistry and Computation

In reduced density-matrix functional theory (RDMFT), standard minimization under Coleman's ensemble N-representability constraints does not guarantee GPC satisfaction; occupation number spectra may violate pure-state constraints significantly. Enforcing GPCs can raise the computed correlation energy by 30–100% and suppress unphysical features, but the associated computational complexity grows rapidly with system size (Theophilou et al., 2015). In large basis quantum-chemical computations with $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$3, satisfaction of Pauli's principle is almost always sufficient—GPC corrections are exponentially unimportant (Reuvers, 2019).

Experimental verification on quantum computers has demonstrated the strict validity of GPCs in synthesized fermionic states, confirming no violation to within parts in $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$4 for the $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$5 Borland–Dennis scenario (Smart et al., 2020).

7. Research Outlook and Limitations

Although GPC-induced pinning is rare in typical many-electron systems, nontrivial quasipinning has notable implications for the structure of small and intermediate-size quantum systems. Open directions include:

• Extending enumeration and fast computation of GPCs to larger $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_d \geq 0$$6.
• Development of selective GPC enforcement strategies for practical quantum chemistry.
• Investigation of the dynamical and entanglement-theoretic consequences of GPC quasipinning.
• Exploration of spin and point-group symmetries to further reduce redundant constraints (Liebert et al., 21 Feb 2025, Schilling et al., 2017, Chakraborty et al., 2014).

In summary, GPCs embody deep kinematic restrictions beyond the exclusion principle, with significant structural and conceptual consequences in few-body fermionic settings, while their effect vanishes in the large-system limit (Reuvers, 2019, Liebert et al., 21 Feb 2025, Smart et al., 2020).