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

Springer eBooks

Reduced Density Matrix

Published May 19, 2008• 5 citations
Publisher
DOI
10.1007/978-3-540-77304-7_10

Related papers

Reduced Density Matrices

Elsevier eBooks•Jan 1, 1978•2 citations

Reduced Density Matrix Cumulants: The Combinatorics of Size-Consistency and Generalized Normal Ordering

Jonathon P. Misiewicz, Justin M. Turney, Henry F. Schaefer

Reduced density matrix cumulants play key roles in the theory of both reduced density matrices and multiconfigurational normal ordering. We present a new, simpler generating function for reduced density matrix cumulants that is formally identical with equating the coupled cluster and configuration interaction ansätze. This is shown to be a general mechanism to convert between a multiplicatively separable quantity and an additively separable quantity, as defined by a set of axioms. It is shown that both the cumulants of probability theory and the reduced density matrices are entirely combinatorial constructions, where the differences can be associated with changes in the notion of "multiplicative separability" for expectation values of random variables compared to reduced density matrices. We compare our generating function to that of previous works and criticize previous claims of probabilistic significance of the reduced density matrix cumulants. Finally, we present a simple proof of the generalized normal ordering formalism to explore the role of reduced density matrix cumulants therein. While the formalism can be used without cumulants, the combinatorial structure of expressing RDMs in terms of cumulants is the same combinatorial structure on cumulants that allows for a simple extended generalized Wick's theorem.

Journal of Chemical Theory and Computation•Aug 31, 2020•19 citations

Determining the N-Representability of a Reduced Density Matrix via Unitary Evolution and Stochastic Sampling

Gustavo E. Massaccesi, Ofelia B. Oña, P. Capuzzi +6 more

High Resolution Image Download MS PowerPoint Slide The N -representability problem consists in determining whether, for a given p -body matrix, there exists at least one N -body density matrix from which the p -body matrix can be obtained by contraction, that is, if the given matrix is a p -body reduced density matrix ( p -RDM). The knowledge of all necessary and sufficient conditions for a p -body matrix to be N -representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p -body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N -representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N -representability conditions. The algorithm consists of applying to an initial N -body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p -body subsystem, represented by a p -RDM, to a target p -body matrix, potentially a p -RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p -body matrix is N -representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.

arXiv:2503.17303•Journal of Chemical Theory and Computation•Nov 14, 2024•5 citations

Reduced Density Matrices

Theoretical chemistry•Jan 1, 1976•4 citations

Controlling the N - and S -representability of the second-order reduced density matrix: The doublet-state case

Diego R. Alcoba, Carmela Valdemoro, Luis M. Tel +1 more

A purification procedure that simultaneously corrects the $N$- and $S$-representability main defects of a second-order reduced density matrix (2RDM), second-order hole reduced density matrix (2HRDM), and second-order $\mathcal{G}$ matrix is presented here. In this purifying procedure, the generalized unitarily invariant second-order matrix decomposition [D. R. Alcoba, Int. J. Quantum Chem. 97, 776 (2004)] for the 2RDM and the 2HRDM as well as for the $\mathcal{G}$ matrix is combined with the $S$-representability conditions. In particular, here we will focus our attention on the RDMs corresponding to doublet states. We will thus explicitly give the $S$-representability conditions that a two-body correlation matrix has to satisfy when an $N$-electron system is in a doublet spin-state in the spin-component of maximum projection. Furthermore, as a consequence of the $\mathcal{G}$-matrix spin properties (which directly affect the $S$-representability of the 2RDM), we show that a different contracting form for the 2RDM is possible. The numerical results presented in this work confirm the efficiency of our purifying procedure.

Physical Review A•Apr 17, 2008•13 citations

Is the matrix completion of reduced density matrices unique?

Gustavo E. Massaccesi, Ofelia B. Oña, Luis Lain +4 more

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina's theorem [M. Rosina, Queen's Papers on Pure and Applied Mathematics No. 11, 369 (1968)], we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum-stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi-Hubbard model.

quant-pharXiv:2603.13087•The Journal of Physical Chemistry Letters•Mar 16, 2026•0 citations
Reduced density matrix cumulants play key roles in the theory of both reduced density matrices and multiconfigurational normal ordering. We present a new, simpler generating function for reduced density matrix cumulants that is formally identical with equating the coupled cluster and configuration interaction ansätze. This is shown to be a general mechanism to convert between a multiplicatively separable quantity and an additively separable quantity, as defined by a set of axioms. It is shown that both the cumulants of probability theory and the reduced density matrices are entirely combinatorial constructions, where the differences can be associated with changes in the notion of "multiplicative separability" for expectation values of random variables compared to reduced density matrices. We compare our generating function to that of previous works and criticize previous claims of probabilistic significance of the reduced density matrix cumulants. Finally, we present a simple proof of the generalized normal ordering formalism to explore the role of reduced density matrix cumulants therein. While the formalism can be used without cumulants, the combinatorial structure of expressing RDMs in terms of cumulants is the same combinatorial structure on cumulants that allows for a simple extended generalized Wick's theorem.
High Resolution Image Download MS PowerPoint Slide The N -representability problem consists in determining whether, for a given p -body matrix, there exists at least one N -body density matrix from which the p -body matrix can be obtained by contraction, that is, if the given matrix is a p -body reduced density matrix ( p -RDM). The knowledge of all necessary and sufficient conditions for a p -body matrix to be N -representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p -body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N -representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N -representability conditions. The algorithm consists of applying to an initial N -body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p -body subsystem, represented by a p -RDM, to a target p -body matrix, potentially a p -RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p -body matrix is N -representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.
A purification procedure that simultaneously corrects the NNN- and SSS-representability main defects of a second-order reduced density matrix (2RDM), second-order hole reduced density matrix (2HRDM), and second-order G\mathcal{G}G matrix is presented here. In this purifying procedure, the generalized unitarily invariant second-order matrix decomposition [D. R. Alcoba, Int. J. Quantum Chem. 97, 776 (2004)] for the 2RDM and the 2HRDM as well as for the G\mathcal{G}G matrix is combined with the SSS-representability conditions. In particular, here we will focus our attention on the RDMs corresponding to doublet states. We will thus explicitly give the SSS-representability conditions that a two-body correlation matrix has to satisfy when an NNN-electron system is in a doublet spin-state in the spin-component of maximum projection. Furthermore, as a consequence of the G\mathcal{G}G-matrix spin properties (which directly affect the SSS-representability of the 2RDM), we show that a different contracting form for the 2RDM is possible. The numerical results presented in this work confirm the efficiency of our purifying procedure.
Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina's theorem [M. Rosina, Queen's Papers on Pure and Applied Mathematics No. 11, 369 (1968)], we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum-stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi-Hubbard model.