Pith. sign in

REVIEW 2 cited by

The Electronic Ground State Energy Problem: a New Reduced Density Matrix Approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0602042 v2 pith:X4KPYLIQ submitted 2006-02-03 quant-ph math-phmath.MP

The Electronic Ground State Energy Problem: a New Reduced Density Matrix Approach

classification quant-ph math-phmath.MP
keywords energyreducedapproachdensityelectronicground-statematrixsome
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present here a formulation of the electronic ground-state energy in terms of the second order reduced density matrix, using a duality argument. It is shown that the computation of the ground-state energy reduces to the search of the projection of some two-electron reduced Hamiltonian on the dual cone of $N$-representability conditions. Some numerical results validate the approach, both for equilibrium geometries and for the dissociation curve of N$_2$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Correlated Purification for Restoring $N$-Representability in Quantum Simulation

    quant-ph 2025-11 conditional novelty 6.0

    Correlated purification via bi-objective semidefinite programming restores N-representability to noisy 2-RDMs from fermionic shadow tomography and achieves chemical accuracy on hydrogen chain dissociation curves.

  2. Entanglement Complexity in Many-body Systems from Positivity Scaling Laws

    quant-ph 2025-09 unverdicted novelty 6.0

    Proves a general complexity bound: quantum systems solvable via size-independent level-p positivity have entanglement complexity scaling polynomially in p, linking RDM N-representability constraints to computational t...