quantum algorithms for computational nuclear physics revisited, particular case of second quantized formulation
Clicks: 100
ID: 248947
2017
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
29.7
/100
100 views
25 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #383 of 625 articles by views in utilitas mathematica
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 625 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
No core Full Configurational Interaction (NCFCI) calculations of Nuclear Bonding energy are resource demanding, in particular, computational time scales exponentially with the nucleon number A. In contrast to that, usage of quantum computers would allow an efficient (in polynomial time) NCFCI calculation and speed-up for other beyond-Mean-Field (correlation energy including) methods. To initiate feasibility studies of given quantum algorithms, we present an introduction to preliminary classicalcomputer simulation for the case of spherical nuclei (and 4He in particular) within NCFCI with realistic chiral NNLO_opt potential.
| Reference Key |
jakub2017epjquantum
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Višňák Jakub;Veselý Petr |
| Journal | utilitas mathematica |
| Year | 2017 |
| DOI |
10.1051/epjconf/201715401030
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.