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

Communications in Mathematical Physics

Characterization of states of infinite boson systems: II. On the existence of the conditional reduced density matrix

Wolfgang Freudenberg

Published Apr 1, 1991• 15 citations
Publisher
DOI
10.1007/bf02100273

Related papers

Characterization of states of infinite boson systems

Karl‐Heinz Fichtner, Wolfgang Freudenberg

Communications in Mathematical Physics•Apr 1, 1991•44 citations

Structure of Fermionic Density Matrices: Complete N -Representability Conditions

David A. Mazziotti

We present a constructive solution to the N-representability problem: a full characterization of the conditions for constraining the two-electron reduced density matrix to represent an N-electron density matrix. Previously known conditions, while rigorous, were incomplete. Here, we derive a hierarchy of constraints built upon (i) the bipolar theorem and (ii) tensor decompositions of model Hamiltonians. Existing conditions D, Q, G, T1, and T2, known classical conditions, and new conditions appear naturally. Subsets of the conditions are amenable to polynomial-time computations of strongly correlated systems.

arXiv:1112.5866•Physical Review Letters•Jun 27, 2012•224 citations

Coherent states for boson systems in quantum field theory and statistical mechanics

F. Rocca

Springer eBooks•Apr 6, 2008•1 citation

Many-body density matrices on a two-dimensional square lattice: Noninteracting and strongly interacting spinless fermions

Siew Ann Cheong, Christopher L. Henley

The reduced density matrix of an interacting system can be used as the basis for a truncation scheme, or in an unbiased method to discover the strongest kind of correlation in the ground state. In this paper, we investigate the structure of the many-body fermion density matrix of a small cluster in a square lattice. The cluster density matrix is evaluated numerically over a set of finite systems, subject to nonsquare periodic boundary conditions given by the lattice vectors ${\mathbf{R}}_{1}\ensuremath{\equiv}({R}_{1x},{R}_{1y})$ and ${\mathbf{R}}_{2}\ensuremath{\equiv}({R}_{2x},{R}_{2y})$. We then approximate the infinite-system cluster density-matrix spectrum by averaging the finite-system cluster density matrix (i) over degeneracies in the ground state, and orientations of the system relative to the cluster, to ensure it has the proper point-group symmetry; and (ii) over various twist boundary conditions to reduce finite size effects. We then compare the eigenvalue structure of the averaged cluster density matrix for noninteracting and strongly interacting spinless fermions, as a function of the filling fraction $\overline{n}$, and discuss whether it can be approximated as being built up from a truncated set of single-particle operators.

arXiv:cond-mat/0508750•Physical Review B•Oct 31, 2006•5 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

A characterization of Gibbs states of lattice boson systems

Yong‐Moon Park, Hyun Jae Yoo

Journal of Statistical Physics•Apr 1, 1994•29 citations
We present a constructive solution to the N-representability problem: a full characterization of the conditions for constraining the two-electron reduced density matrix to represent an N-electron density matrix. Previously known conditions, while rigorous, were incomplete. Here, we derive a hierarchy of constraints built upon (i) the bipolar theorem and (ii) tensor decompositions of model Hamiltonians. Existing conditions D, Q, G, T1, and T2, known classical conditions, and new conditions appear naturally. Subsets of the conditions are amenable to polynomial-time computations of strongly correlated systems.
The reduced density matrix of an interacting system can be used as the basis for a truncation scheme, or in an unbiased method to discover the strongest kind of correlation in the ground state. In this paper, we investigate the structure of the many-body fermion density matrix of a small cluster in a square lattice. The cluster density matrix is evaluated numerically over a set of finite systems, subject to nonsquare periodic boundary conditions given by the lattice vectors ${\mathbf{R}}_{1}\ensuremath{\equiv}({R}_{1x},{R}_{1y})$ and ${\mathbf{R}}_{2}\ensuremath{\equiv}({R}_{2x},{R}_{2y})$. We then approximate the infinite-system cluster density-matrix spectrum by averaging the finite-system cluster density matrix (i) over degeneracies in the ground state, and orientations of the system relative to the cluster, to ensure it has the proper point-group symmetry; and (ii) over various twist boundary conditions to reduce finite size effects. We then compare the eigenvalue structure of the averaged cluster density matrix for noninteracting and strongly interacting spinless fermions, as a function of the filling fraction n‾\overline{n}n, and discuss whether it can be approximated as being built up from a truncated set of single-particle operators.
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.