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

Chemical Physics Letters

Comment on: “Transforms for idempotency purification of density matrices in linear-scaling electronic-structure calculations” [Chem. Phys. Lett. 340 (2001) 552–558]

Scott Habershon, Frederick R. Manby

Published Mar 1, 2002• 4 citations
Publisher
DOI
10.1016/s0009-2614(02)00160-4

Related papers

Comment on “On the optimal symmetric purification scheme of the one-particle density matrix” [Chem. Phys. Lett. 511 (2011) 159–160]

Emanuel H. Rubensson

Chemical Physics Letters•Jan 20, 2012•1 citation

Comment on: “Entanglement purification via controlled–controlled-NOT operations” [Phys. Lett. A 271 (2000) 44]

Małgorzata Okrasa, Zbigniew Walczak

Physics Letters A•Feb 2, 2008•5 citations

Towards idempotent reduced density matrices via particle-hole duality: McWeeny’s purification and beyond

David A. Mazziotti

Generalizations of McWeeny's purification formula are developed within the formalism of the particle-hole duality from the theory of reduced density matrices. Each of the generalized purification formulas is expressed as a sum of the one-particle reduced density matrix (1-RDM) and a finite series in the product of the one-particle and the one-hole RDMs, a product which vanishes in the limit that the 1-RDM is idempotent. Two categories of purification formulas are explored: (i) formulas which treat the "occupied" and the "virtual" occupation numbers equivalently and (ii) formulas which treat these occupation numbers differently. The latter category includes and extends the purification formulas derived in the context of the 1,2-contracted Schrödinger equation [D. A. Mazziotti, J. Chem. Phys. 115, 8305 (2001)]. While the McWeeny purification minimizes the absolute error in the occupation numbers quadratically, the generalized purification formulas exhibit faster than quadratic convergence of the 1-RDM towards idempotency. Application of these purification formulas in existing algorithms for linear scaling will be explored and discussed including illustrative calculations on sodium wires of length 10, 20, 30, and 40 atoms.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Dec 3, 2003•45 citations

Reply to Comment on ‘On the optimal symmetric purification scheme of the one-particle density matrix’

Jaehoon Kim, Yousung Jung

Chemical Physics Letters•Jan 17, 2012•1 citation

Notes on density matrix perturbation theory

Lionel A. Truflandier, Rivo M. Dianzinga, David R. Bowler

Density matrix perturbation theory (DMPT) is known as a promising alternative to the Rayleigh-Schrödinger perturbation theory, in which the sum-over-states (SOS) is replaced by algorithms with perturbed density matrices as the input variables. In this article, we formulate and discuss three types of DMPT, with two of them based only on density matrices: the approach of Kussmann and Ochsenfeld [J. Chem. Phys. 127, 054103 (2007)] is reformulated via the Sylvester equation and the recursive DMPT of Niklasson and Challacombe [Phys. Rev. Lett. 92, 193001 (2004)] is extended to the hole-particle canonical purification (HPCP) from Truflandier et al. [J. Chem. Phys. 144, 091102 (2016)]. A comparison of the computational performances shows that the aforementioned methods outperform the standard SOS. The HPCP-DMPT demonstrates stable convergence profiles but at a higher computational cost when compared to the original recursive polynomial method.

arXiv:2007.04739•The Journal of Chemical Physics•Oct 23, 2020•6 citations

Methods for Electronic Structure Calculations: Overview from a Reduced‐Density‐Matrix Point of View

P. Ziesche, Ferenc Tasnádi

ChemInform•Feb 2, 2005•0 citations
Generalizations of McWeeny's purification formula are developed within the formalism of the particle-hole duality from the theory of reduced density matrices. Each of the generalized purification formulas is expressed as a sum of the one-particle reduced density matrix (1-RDM) and a finite series in the product of the one-particle and the one-hole RDMs, a product which vanishes in the limit that the 1-RDM is idempotent. Two categories of purification formulas are explored: (i) formulas which treat the "occupied" and the "virtual" occupation numbers equivalently and (ii) formulas which treat these occupation numbers differently. The latter category includes and extends the purification formulas derived in the context of the 1,2-contracted Schrödinger equation [D. A. Mazziotti, J. Chem. Phys. 115, 8305 (2001)]. While the McWeeny purification minimizes the absolute error in the occupation numbers quadratically, the generalized purification formulas exhibit faster than quadratic convergence of the 1-RDM towards idempotency. Application of these purification formulas in existing algorithms for linear scaling will be explored and discussed including illustrative calculations on sodium wires of length 10, 20, 30, and 40 atoms.
Density matrix perturbation theory (DMPT) is known as a promising alternative to the Rayleigh-Schrödinger perturbation theory, in which the sum-over-states (SOS) is replaced by algorithms with perturbed density matrices as the input variables. In this article, we formulate and discuss three types of DMPT, with two of them based only on density matrices: the approach of Kussmann and Ochsenfeld [J. Chem. Phys. 127, 054103 (2007)] is reformulated via the Sylvester equation and the recursive DMPT of Niklasson and Challacombe [Phys. Rev. Lett. 92, 193001 (2004)] is extended to the hole-particle canonical purification (HPCP) from Truflandier et al. [J. Chem. Phys. 144, 091102 (2016)]. A comparison of the computational performances shows that the aforementioned methods outperform the standard SOS. The HPCP-DMPT demonstrates stable convergence profiles but at a higher computational cost when compared to the original recursive polynomial method.