⚛️ quantum physics

A constructive solution to the $n$ -representability problem

This paper presents a constructive solution to the fermionic $n$ -representability problem by developing a systematic algebraic framework using positive-semidefinite Gram matrices and linear nullspace constraints to generate a complete family of two-body witnesses, which is numerically validated by recovering the exact ground-state energy of a Richardson Hamiltonian.

Original authors: Nicholas C. Rubin, A. Eugene DePrince III

Published 2026-10-16

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Nicholas C. Rubin, A. Eugene DePrince III

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the microscopic world of atoms and molecules, the behavior of electrons is governed by the strange rules of quantum mechanics. To understand how a molecule holds together or how it reacts, scientists traditionally try to calculate the exact state of every single electron at once. However, as the number of electrons grows, the mathematical complexity explodes, making a direct calculation impossible for anything but the smallest systems. To get around this, researchers focus on a smaller, more manageable piece of information: the two-particle reduced density matrix. Think of this as a detailed map that describes how any two electrons in the system are likely to be found relative to one another, without needing to track the entire crowd. This map contains all the necessary information to calculate the energy of the molecule and its most important properties.

The central challenge, known as the $n$ -representability problem, is ensuring that this two-electron map actually corresponds to a real, physical system of $n$ electrons. Not every mathematical pattern that looks like a map of two electrons can be built from a real group of $n$ particles. For decades, scientists have tried to find a set of rules, or "witnesses," to verify if a proposed map is valid. If a map fails even one of these rules, it is physically impossible. While many such rules have been discovered, they have often been incomplete, leaving gaps where unphysical maps could slip through undetected, leading to inaccurate predictions of energy and behavior.

A team of researchers at Google Quantum AI and Florida State University has now provided a complete solution to this long-standing problem. They have constructed a systematic method to generate every possible rule needed to verify if a two-electron map is physically real for a specific number of electrons. Their approach builds a mathematical structure that acts as a comprehensive filter, catching every invalid map while allowing only the true physical ones to pass. By combining two powerful mathematical ideas—positive matrices that guarantee non-negative values and specific linear constraints that cancel out impossible higher-order effects—they created a framework that is both exhaustive and constructive. This means they didn't just prove such rules exist; they showed exactly how to build them.

The researchers demonstrated the power of their method by applying it to a specific model of interacting electrons known as the Richardson Hamiltonian. In this test case, involving three electrons, they used their new framework to calculate the lowest possible energy state of the system. Previous methods, which relied on partial sets of rules, produced an energy estimate that was slightly too high, failing to reach the true ground state. In contrast, the researchers' complete framework recovered the exact ground-state energy with high precision. This result confirms that their method captures the full physical reality of the system, whereas older, incomplete methods leave a gap between the calculated answer and the truth.

A key insight from their work is that the complexity of the rules does not need to grow indefinitely to achieve perfect accuracy. They proved that for a system with a fixed number of electrons, a specific, relatively simple set of rules is sufficient to guarantee the validity of the two-electron map. Even though the mathematical machinery involves high-degree terms, the researchers showed that these can be absorbed or simplified without losing any accuracy. This finding is crucial because it suggests that the most rigorous verification of physical systems can be achieved without requiring computationally impossible resources. It establishes a unified path forward for simulating complex chemical systems, ensuring that the mathematical models used in chemistry and materials science are grounded in physical reality.

The solution relies on a hierarchy of checks that become more stringent as one moves up the ladder of complexity. The researchers showed that by using a weighted sum-of-squares approach, they could generate a complete family of these checks. This method effectively cancels out any contributions from higher numbers of particles that would otherwise make the two-electron map invalid. They demonstrated that this cancellation is exact and that the resulting set of conditions is the only set needed to define the space of valid maps. By solving the associated mathematical optimization problems, they verified that their construction works in practice, not just in theory.

This work bridges the gap between abstract mathematical proofs and practical computational chemistry. For years, the field has been organized around finding efficient, necessary conditions to check if a map is valid, but the question of whether these conditions were ever truly complete remained open. The researchers have now closed that door, proving that their construction exhausts all possibilities. They have replaced the search for individual conditions with a systematic algebraic procedure that generates the entire family of valid rules. This provides a solid foundation for future simulations, allowing scientists to trust that their calculations of molecular energy and properties are based on a mathematically complete description of the physical world.

The implications extend beyond just getting the right number for energy. By having a complete characterization of all valid two-particle maps, researchers can now design better algorithms for quantum computers and classical simulations alike. The method is general enough to be applied to various types of quantum particles and can be adapted to include other physical constraints like spin or spatial symmetry. The researchers have also made their software available, allowing others to generate these rules for different systems. This transparency and accessibility ensure that the scientific community can build upon this complete framework, accelerating the discovery of new materials and the understanding of complex chemical reactions.

In the end, this paper offers a definitive answer to a problem that has puzzled scientists since the 1960s. It transforms the $n$ -representability problem from a collection of partial guesses into a rigorous, complete science. The researchers have shown that with the right mathematical tools, it is possible to fully characterize the physical limits of quantum systems. Their work does not just improve existing methods; it redefines the standard for what it means to verify a quantum state, ensuring that the maps we use to understand the universe are as real as the atoms they describe.

Technical Summary: A Constructive Solution to the n-Representability Problem

Problem Statement
The $n$ -representability problem seeks to characterize the space of fermionic two-particle reduced density matrices (2-RDMs) that can be derived from an ensemble state of $n$ fermions. While the 2-RDM offers a compact representation of quantum systems containing all necessary information for energy and equilibrium property calculations, determining the necessary and sufficient conditions for a candidate 2-RDM to be $n$ -representable remains a central challenge in quantum chemistry and quantum information. Historically, progress has focused on finding computationally efficient necessary conditions (e.g., D, Q, G, T conditions) or establishing the problem's complexity (QMA-complete). Previous constructive approaches, such as those utilizing nonnegative combinations of fermionic operator squares, claimed completeness but failed to rigorously establish that their explicit constraint-generation rules exhaust the cone of two-body witnesses for a fixed particle number. A critical gap exists between global positivity (valid across the entire Fock space) and the specific requirement of positivity on the fixed- $n$ subspace.

Methodology
The authors present a constructive framework based on a weighted sum-of-squares (wSOS) hierarchy to generate all valid two-body witnesses. The methodology proceeds in two primary stages:

Nullspace Construction for SOS Witnesses:
The authors define a degree- $d$ SOS cone, $\Sigma_d$ , generated by products of fermionic ladder operators up to degree $d$ . To ensure these operators act as valid two-body witnesses, they must contain no terms of ladder degree greater than four. The authors construct a linear nullspace condition, $A_{\text{trunc}}(d)\text{vec}(G) = 0$ , where $G$ is the Gram matrix of the SOS. This condition ensures that all high-degree terms cancel exactly. They prove that this nullspace construction captures every at-most-two-body Hermitian operator admitting a degree- $d$ SOS representation.
Weighted SOS and Particle-Number Constraints:
Recognizing that valid $n$ -representability witnesses need only be non-negative on the $n$ -particle subspace (not globally), the authors extend the framework to weighted SOS (wSOS). This involves adding a congruence term, $fr + rf^\dagger$ , where $r = N - \eta \mathbb{1}$ is the particle-number deviation operator and $f$ is a polynomial multiplier.
- Augmented Nullspace: The authors derive an augmented nullspace condition, $[A_{\text{SOS}} \quad A_{\text{sym}}] (\text{vec}(G), \text{vec}(f))^T = 0$ , which ensures the high-degree terms of the SOS part and the multiplier part cancel jointly.
- Completeness Proof: They prove that at level $d = \eta$ (where $\eta$ is the particle number), the weighted SOS cone $w_n\Sigma_{\eta, \le 2}$ contains every Hermitian, particle-conserving, at-most-two-body operator that is non-negative on the $\eta$ -particle subspace. This establishes that the wSOS hierarchy provides a complete characterization of $n$ -representability.
Primal-Dual Formulation:
The construction is translated into a semidefinite program (SDP). In the dual formulation, the nullspace constraints introduce Lagrange multipliers (auxiliary higher-degree moments) that shape the feasible space of the primal 2-RDM. The authors demonstrate that the standard v2RDM constraints (DQG, T1, T2', etc.) are recovered as restricted subsets of this general framework.

Key Contributions

Constructive Completeness: The paper provides a rigorous proof that the weighted SOS hierarchy at level $d=n$ is complete for the $n$ -representability problem, generating all physical two-body witnesses.
Unified Framework: It unifies existing necessary conditions (D, Q, G, T1, T2', (2,4) conditions) under a single algebraic procedure based on the cancellation of higher-body contributions via linear nullspace constraints.
Multiplier Sufficiency: A significant theoretical contribution is the proof that degree-at-most-two particle-number multipliers are sufficient to preserve the supremal energy bound at every level $d \ge 2$ of the complete fermionic SOS hierarchy. Higher-degree multipliers can be absorbed into the SOS part and lower-degree multipliers with an arbitrarily small decrease in the energy certificate.
Software Implementation: The authors provide a software component within the $p^\dagger q$ fermionic computer algebra library to generate these degree- $d$ weighted SOS witnesses symbolically.

Results
The authors numerically verify their theory using a Richardson-type pairing Hamiltonian in the three-fermion sector:

Exact Recovery: The complete degree-three weighted SOS formulation recovers the exact ground-state energy within solver accuracy.
Limitations of Traditional Methods: Standard v2RDM constraints (DQG) and even partial 3-positivity conditions (DQGT1T2') fail to reach the exact energy, providing lower bounds that fall short of the true ground state.
Multiplier Analysis: Numerical experiments confirm that while degree-0 (scalar) multipliers offer some improvement over Fock-space bounds, degree-2 and degree-4 multipliers are required to recover the exact energy. However, the theoretical proof confirms that degree-2 multipliers are sufficient when the full generator algebra is utilized.

Significance
The paper establishes a unified constructive framework for verifying the physicality of a candidate 2-RDM. By replacing the search for individual representability conditions with a systematic algebraic procedure based on weighted SOS and nullspace constraints, the authors provide a complete characterization of all two-body witnesses. This work bridges the gap between the theoretical structure of quantum marginal problems and practical computational methods, offering a path toward rigorous lower-bound certificates for energy in chemistry and condensed matter simulations without relying on incomplete sets of necessary conditions. The demonstration that lower-degree multipliers suffice suggests that the computational overhead of these complete methods may be more manageable than previously assumed, provided the full SOS generator algebra is employed.

More like this