Novel Algorithms for Computing Correlation Functions of Large Nuclei

28 Jul 2021, 22:45
15m
Oral presentation Algorithms (including Machine Learning, Quantum Computing, Tensor Networks) Algorithms (including Machine Learning, Quantum Computing, Tensor Networks)

Speaker

Nabil Humphrey (University of Adelaide)

Description

This work seeks to enable more detailed numerical probes into nuclear structure using the standard model through lattice QCD. The computational cost required to compute nuclear correlations functions grows exponentially in the number of quarks, leaving the study of many large nuclear bound states inaccessible. However, these tensor expressions exhibit a high degree of permutation symmetry that can be exploited either a priori or ad hoc to reduce computational work. After outlining the novel aspects of two new algorithms, we present a cost comparison and find promising speeds-ups for certain choices of interpolating operators. We further present a pathway to apply the new approaches to systems of current and future interest.

Author

Nabil Humphrey (University of Adelaide)

Co-authors

Ross Young James Zanotti (University of Adelaide)

Presentation materials