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

International Journal of Quantum Chemistry

Inequalities for fermion density matrices

Claude Garrod, James Michael Hannon

Published Jan 1, 1978• 4 citations
Publisher

Abstract

Abstract A partial trace over the occupation numbers of all but k states in the density matrix of an ensemble with an arbitrary number of single‐particle states is defined as the (reduced) k‐state density matrix. This matrix is used to obtain a complete, practical solution to the problem of determining the representability of the diagonal elements of the one‐ and two‐particle (reduced) density matrices. This solution is expressed as a series of linear inequalities involving the density‐matrix elements; the inequalities are identical with those derived previously by Davidson and McCrae by a different method. In addition, our method is used to obtain nonlinear, matrix inequalities on the off‐diagonal elements of the density matrices.

DOI
10.1002/qua.560130109

Related papers

Linear inequalities for density matrices: III

Ernest R. Davidson

Abstract Diagonal linear inequalities are derived for three‐ and four‐body reduced density matrices. These give a different insight into the previous derivations of linear inequalities for the two‐body reduced density matrix. © 2002 Wiley Periodicals, Inc. Int J Quantum Chem, 2003

International Journal of Quantum Chemistry•Aug 13, 2002•23 citations

Linear Inequalities for Density Matrices

Ernest R. Davidson

A set of linear inequalities for the reduced two-body density matrix is presented. The general problem of finding all such inequalities is discussed. It is shown that all of the linear inequalities found so far for ensemble representability may be written as a single family of inequalities.

Journal of Mathematical Physics•Apr 1, 1969•79 citations

Diagonal N-representability as a method for solving the representability problem

M. M. Mestechkin

The latest results of density matrix theory are summarized in terms of analysis of off-diagonal components. For a given reduced density matrix (RDM) of arbitrary order, the full density matrix is explicitly constructed, from which the RDM is derived by means of the corresponding reduction procedure. Both the matrices satisfy all the necessary conditions, such antisymmetry, normalization, hermiticity, except that the non-negative definiteness of the full DM is not guaranteed. If an RDM satisfies the necessary inequalities with the same number of indices as it has itself, then, as proved here, there is an additive correction to the full DM matrix that turns it into a non-negative definite matrix leading to the same RDM and satisfying the other requirements. This establishes a fundamental fact that these inequalities are sufficient as well, providing the N-representability of the given RDM. The construction is based on the classification, introduced in the article, of the multi-index elements of the RDM and full DM according to their degree of off-diagonality. RDM elements with a predetermined degree of off-diagonality are expressed through full DM elements with the same off-diagonality. This shows that the conventional variational approach to calculating the energy of the system by convex programming methods under the conditions of N-representability (before and even after reaching the minimum energy) generally does not lead to constructing a mixed quantum state composed of solutions to the Schrödinger equation. Therefore, except for the energy, it does not guarantee a correct description of the other properties so long as the conditions of correctness for each particular property are not expressed in terms of the RDM and not incorporated into the specific conditions of N-representability (regardless of the requirement of energy minimization).

Russian Journal of Physical Chemistry B•Mar 1, 2017•0 citations

Refining ensemble N -representability of one-body density matrices from partial information

Julia Liebert, Anna O. Schouten, Irma Avdic +2 more

Abstract The N -representability problem places fundamental constraints on reduced density matrices (RDMs) that originate from physical many-fermion quantum states. Motivated by recent developments in functional theories, we introduce a hierarchy of ensemble one-body N -representability problems that incorporate partial knowledge of the one-body RDMs (1RDMs) within an ensemble of N -fermion states with fixed weights w i . Specifically, we propose a systematic relaxation that reduces the refined problem—where full 1RDMs are fixed for certain ensemble elements—to a more tractable form involving only natural occupation number vectors. Remarkably, we show that this relaxed problem is related to a generalization of Horn’s problem, enabling an explicit solution by combining its constraints with those of the weighted ensemble N -representability conditions. An additional convex relaxation yields a convex polytope that provides physically meaningful restrictions on lattice site occupations in ensemble density functional theory for excited states.

arXiv:2506.09960•New Journal of Physics•Dec 1, 2025•1 citation

Linear Inequalities for Density Matrices. II

Walter B. McRae, Ernest R. Davidson

A general method is described for finding linear inequalities relating physical properties of an ensemble which can exist only in a finite number of states. This algorithm is used to solve a few examples of the fixed-N and variable-N Slater hull problem and the fixed-N Boson hull problem. Interpretations of the results are made in terms of boundary conditions for fermion and boson reduced density matrices, pair distributions of lattice vacancies, and pair distributions of spins in an Ising model.

Journal of Mathematical Physics•Oct 1, 1972•60 citations

A Combinatorial Approach to the Diagonal N-Representability Problem

Mark Laurance Yoseloff

The problem considered is that of the diagonal N -representability of a p th-order reduced density matrix, p ≥ 2 p \geq 2 , for a system of N identical fermions or bosons. A finite number M of allowable single particle states is assumed. The problem is divided into three cases, namely: Case I. M = N + p M = N + p ; Case II. M > N + p M > N + p ; Case III. M > N + p M > N + p . Using the theory of polyhedral convex cones, a complete set of necessary and sufficient conditions is first found for Case I. This solution is then employed to find such conditions for Case II. For Case III, two algorithms are developed to generate solutions for the problem, and examples of the usage of these algorithms are given.

Transactions of the American Mathematical Society•Jan 1, 1974•14 citations
Abstract A partial trace over the occupation numbers of all but k states in the density matrix of an ensemble with an arbitrary number of single‐particle states is defined as the (reduced) k‐state density matrix. This matrix is used to obtain a complete, practical solution to the problem of determining the representability of the diagonal elements of the one‐ and two‐particle (reduced) density matrices. This solution is expressed as a series of linear inequalities involving the density‐matrix elements; the inequalities are identical with those derived previously by Davidson and McCrae by a different method. In addition, our method is used to obtain nonlinear, matrix inequalities on the off‐diagonal elements of the density matrices.
The latest results of density matrix theory are summarized in terms of analysis of off-diagonal components. For a given reduced density matrix (RDM) of arbitrary order, the full density matrix is explicitly constructed, from which the RDM is derived by means of the corresponding reduction procedure. Both the matrices satisfy all the necessary conditions, such antisymmetry, normalization, hermiticity, except that the non-negative definiteness of the full DM is not guaranteed. If an RDM satisfies the necessary inequalities with the same number of indices as it has itself, then, as proved here, there is an additive correction to the full DM matrix that turns it into a non-negative definite matrix leading to the same RDM and satisfying the other requirements. This establishes a fundamental fact that these inequalities are sufficient as well, providing the N-representability of the given RDM. The construction is based on the classification, introduced in the article, of the multi-index elements of the RDM and full DM according to their degree of off-diagonality. RDM elements with a predetermined degree of off-diagonality are expressed through full DM elements with the same off-diagonality. This shows that the conventional variational approach to calculating the energy of the system by convex programming methods under the conditions of N-representability (before and even after reaching the minimum energy) generally does not lead to constructing a mixed quantum state composed of solutions to the Schrödinger equation. Therefore, except for the energy, it does not guarantee a correct description of the other properties so long as the conditions of correctness for each particular property are not expressed in terms of the RDM and not incorporated into the specific conditions of N-representability (regardless of the requirement of energy minimization).
Abstract The N -representability problem places fundamental constraints on reduced density matrices (RDMs) that originate from physical many-fermion quantum states. Motivated by recent developments in functional theories, we introduce a hierarchy of ensemble one-body N -representability problems that incorporate partial knowledge of the one-body RDMs (1RDMs) within an ensemble of N -fermion states with fixed weights w i . Specifically, we propose a systematic relaxation that reduces the refined problem—where full 1RDMs are fixed for certain ensemble elements—to a more tractable form involving only natural occupation number vectors. Remarkably, we show that this relaxed problem is related to a generalization of Horn’s problem, enabling an explicit solution by combining its constraints with those of the weighted ensemble N -representability conditions. An additional convex relaxation yields a convex polytope that provides physically meaningful restrictions on lattice site occupations in ensemble density functional theory for excited states.
A general method is described for finding linear inequalities relating physical properties of an ensemble which can exist only in a finite number of states. This algorithm is used to solve a few examples of the fixed-N and variable-N Slater hull problem and the fixed-N Boson hull problem. Interpretations of the results are made in terms of boundary conditions for fermion and boson reduced density matrices, pair distributions of lattice vacancies, and pair distributions of spins in an Ising model.
The problem considered is that of the diagonal N -representability of a p th-order reduced density matrix, p ≥ 2 p \geq 2 , for a system of N identical fermions or bosons. A finite number M of allowable single particle states is assumed. The problem is divided into three cases, namely: Case I. M = N + p M = N + p ; Case II. M > N + p M > N + p ; Case III. M > N + p M > N + p . Using the theory of polyhedral convex cones, a complete set of necessary and sufficient conditions is first found for Case I. This solution is then employed to find such conditions for Case II. For Case III, two algorithms are developed to generate solutions for the problem, and examples of the usage of these algorithms are given.