Pith. sign in

REVIEW 1 cited by

An extension of the generator coordinate method with basis optimization

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 2308.13233 v2 pith:7FTZT36X submitted 2023-08-25 nucl-th

classification nucl-th
keywords methodcollectivecoordinatebasisbeenextensiongeneratormotions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The generator coordinate method (GCM) has been a well-known method to describe nuclear collective motions. In this method, one specifies {\it a priori} the relevant collective degrees of freedom as input of the method, based on empirical and/or phenomenological assumptions. We here propose a new extension of the GCM, in which both the basis Slater determinants and weight factors are optimized according to the variational principle. Applying this method to $^{16}$O and $^{28}$Si nuclei with the Skyrme functional, we demonstrate that the optimized bases correspond to excited states along a collective path, unlike the conventional GCM which superposes only the local ground states. This implies that a collective coordinate for large amplitude collective motions is determined in a much more complex way than what has been assumed so far.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion

    quant-ph 2025-06 conditional novelty 6.0 of 10

    QAOA plus quantum subspace expansion systematically improves MIS solutions on small random graphs, with a fitted gate-count crossover extrapolated to about 75 nodes.

Pith tools