An effective solution to convex $1$-body $N$-representability

Federico Castillo, Jean‐Philippe Labbé, Julia Liebert, Arnau Padrol, Eva Philippe, Christian SchillingarXiv 2021 · DOI · arXiv

This paper, titled "An effective solution to convex 1-body $N$-representability," bridges the worlds of quantum chemistry and discrete geometry. It provides a practical, scalable way to determine if a simplified description of a quantum system (a 1-body reduced density matrix) is physically valid for an ensemble of particles.

TL;DR

The authors provide a complete mathematical solution to the "convex relaxation" of the 1-body $N$-representability problem for both fermions and bosons. By identifying these systems' allowed states as a new class of geometric objects called "lineup polytopes," they derive a hierarchy of generalized exclusion principles that remain valid even as system sizes grow to infinity.

What Problem Does This Paper Address?

In quantum mechanics, describing a system of $N$ interacting particles is computationally impossible for large $N$ because the "wave function" grows exponentially. To simplify this, researchers use Reduced Density Matrices (RDMs), which describe only one or two particles at a time.

However, this leads to the $N$-representability problem: Given a 1-body RDM, does it actually correspond to a valid $N$-particle state? For pure fermion states, the answer is the famous Pauli Exclusion Principle (eigenvalues must be between 0 and 1). But for ensembles—mixtures of states used to describe systems at finite temperatures—the constraints are much more complex. Previous theoretical solutions (like Klyachko’s) were mathematically beautiful but practically useless for large systems because they were too complex to compute. This paper seeks a "convex relaxation"—a slightly simplified but much more manageable set of rules—that works for ensembles.

Methods

The authors combine quantum variational principles with advanced combinatorial geometry. Key techniques include:

  • Gross–Oliviera–Kohn Variational Principle: Used to compute the "support function" of the set of representable matrices, turning a physics problem into a geometry problem.
  • Lineup Polytopes: The authors introduce this new class of polytopes to characterize the spectra of RDMs. These are related to "sweep polytopes" and "fiber polytopes."
  • Algorithm F: A recursive algorithm developed by the authors to generate the minimal set of linear inequalities (the "H-representation") that define these polytopes.
  • Stability Theorem: A core proof showing that once a system reaches a certain size, adding more particles ($N$) or increasing the number of available states ($d$) doesn't create new inequalities. The constraints "stabilize."

Datasets

Not discussed in the paper. As a theoretical work in mathematical physics, it does not use external datasets. Instead, the authors used computational geometry tools like SageMath, ppl, and normaliz to generate and verify their results for small to medium-sized systems.

Key Insights and Ideas

  • The Geometry of Exclusion: The paper shows that Pauli’s principle is just the simplest case ($r=1$) of a much deeper hierarchy. For ensembles with $r$ different weights, there are "generalized exclusion principles" that act as a more sophisticated version of Pauli's rule.
  • Stability is Key: The most important "aha moment" is the Stability Theorem. It means we don't need to re-solve the problem for every new molecule or material. A constraint found for a small system remains a fundamental law for a system with a billion particles.
  • Bosons Aren't Lawless: While bosons don't follow the Pauli Exclusion Principle (they can pile into the same state), the authors discovered that mixed bosonic states still obey specific geometric constraints, which they characterized for the first time.
  • Lineup Polytopes: By framing the problem through "lineups" (ordered configurations of points), the authors simplified a high-dimensional problem into something that can be solved using the combinatorics of "Gale orders."

Key Results

  • Complete Inequality Sets: The authors successfully generated the full list of inequalities for ensembles with up to $r=13$ distinct weights. For example, at $r=13$, they found 2,132 fundamental inequalities for fermions.
  • Scalability: Because of the Stability Theorem, these 2,132 inequalities are valid for any number of fermions $N$ and any number of orbitals $d$, provided they are sufficiently large.
  • Computational Efficiency: Unlike previous methods that exploded in complexity, "Algorithm F" allows for the efficient membership testing of RDMs, which is a crucial step for Reduced Density Matrix Functional Theory (RDMFT).

Limitations and Future Work

The primary limitation is that this work focuses on the convex relaxation of the problem. While this is exactly what is needed for ensemble-based functional theories (like RDMFT), it doesn't capture the "pure state" constraints, which are non-convex and much more "jagged."

The authors suggest several future directions:

  • The Minkowski Conjecture: They conjecture that the complex "pure state" polytope is actually a component (a Minkowski summand) of their smoother "ensemble" polytope.
  • Bosonic Threshold Complexes: The authors uncovered new combinatorial structures for bosons that they believe deserve further study by mathematicians.
  • Practical RDMFT: The next step is to implement these new inequalities into actual quantum chemistry software to see how much they improve the accuracy of ground-state and excited-state energy calculations.

Summary updated

Abstract

From a geometric point of view, Pauli's exclusion principle defines a hypersimplex. This convex polytope describes the compatibility of $1$-fermion and $N$-fermion density matrices, therefore it coincides with the convex hull of the pure $N$-representable $1$-fermion density matrices. Consequently, the description of ground state physics through $1$-fermion density matrices may not necessitate the intricate pure state generalized Pauli constraints. In this article, we study the generalization of the $1$-body $N$-representability problem to ensemble states with fixed spectrum $\mathbf{w}$, in order to describe finite-temperature states and distinctive mixtures of excited states. By employing ideas from convex analysis and combinatorics, we present a comprehensive solution to the corresponding convex relaxation, thus circumventing the complexity of generalized Pauli constraints. In particular, we adapt and further develop tools such as symmetric polytopes, sweep polytopes, and Gale order. For both fermions and bosons, generalized exclusion principles are discovered, which we determine for any number of particles and dimension of the $1$-particle Hilbert space. These exclusion principles are expressed as linear inequalities satisfying hierarchies determined by the non-zero entries of $\mathbf{w}$. The two families of polytopes resulting from these inequalities are part of the new class of so-called lineup polytopes.
BibTeX
@misc{castillo2021effective,
  author = {Federico Castillo and Jean‐Philippe Labbé and Julia Liebert and Arnau Padrol and Eva Philippe and Christian Schilling},
  title = {{An effective solution to convex $1$-body $N$-representability}},
  year = {2021},
  eprint = {2105.06459},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2105.06459},
}
Figure