Projective purification of correlated reduced density matrices

In the search for accurate approximate solutions of the many-body Schrödinger equation, reduced density matrices play an important role, as they allow one to formulate approximate methods with polynomial scaling in the number of particles. However, these methods frequently encounter the issue of <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mi>N</a:mi></a:math>-representability, whereby in self-consistent applications of the methods, the reduced density matrices become unphysical. A number of algorithms have been proposed in the past to restore a given set of <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"><b:mi>N</b:mi></b:math>-representability conditions once the reduced density matrices become defective. However, these purification algorithms either have ignored symmetries of the Hamiltonian related to conserved quantities or have not incorporated them in an efficient way, thereby modifying the reduced density matrix to a greater extent than is necessary. In this paper, we present an algorithm capable of efficiently performing all of the following tasks in the least invasive manner: restoring a given set of <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:mi>N</c:mi></c:math>-representability conditions, maintaining contraction consistency between successive orders of reduced density matrices, and preserving all conserved quantities. We demonstrate the superiority of the present purification algorithm over previous ones in the context of the time-dependent two-particle reduced density matrix method applied to the quench dynamics of the Fermi-Hubbard model.

Authors

Institutions

Publication Details

Journal
Physical Review Research
Published
2025-02-26
DOI
https://doi.org/10.1103/physrevresearch.7.013211
Citations
3
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
4.51

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Projective purification of correlated reduced density matrices

Iva Březinová, Elias Pescoller, Marie Eder
3 citations
Physical Review Research
Matrix Theory and Algorithms
4.51
article

Projective purification of correlated reduced density matrices

Iva Březinová, Elias Pescoller, Marie Eder
article en
3 citations

Abstract

In the search for accurate approximate solutions of the many-body Schrödinger equation, reduced density matrices play an important role, as they allow one to formulate approximate methods with polynomial scaling in the number of particles. However, these methods frequently encounter the issue of <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mi>N</a:mi></a:math>-representability, whereby in self-consistent applications of the methods, the reduced density matrices become unphysical. A number of algorithms have been proposed in the past to restore a given set of <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"><b:mi>N</b:mi></b:math>-representability conditions once the reduced density matrices become defective. However, these purification algorithms either have ignored symmetries of the Hamiltonian related to conserved quantities or have not incorporated them in an efficient way, thereby modifying the reduced density matrix to a greater extent than is necessary. In this paper, we present an algorithm capable of efficiently performing all of the following tasks in the least invasive manner: restoring a given set of <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:mi>N</c:mi></c:math>-representability conditions, maintaining contraction consistency between successive orders of reduced density matrices, and preserving all conserved quantities. We demonstrate the superiority of the present purification algorithm over previous ones in the context of the time-dependent two-particle reduced density matrix method applied to the quench dynamics of the Fermi-Hubbard model.

Physical Review ResearchVol. 7(1)
TU Wien (AT)
Austrian Science Fund
Openalex Percentile: Top 6%
Matrix Theory and Algorithms
4.51
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.