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 tractability.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Reformulates PTA as a Green's function-free RDM theory cast as an over-constrained optimization problem with connections to variational methods.
citing papers explorer
-
Entanglement Complexity in Many-body Systems from Positivity Scaling Laws
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 tractability.
-
Green's Function-Free Formalism of Projective Truncation Approximation
Reformulates PTA as a Green's function-free RDM theory cast as an over-constrained optimization problem with connections to variational methods.