Novel Algorithms for Computing Correlation Functions of Nuclei

  title={Novel Algorithms for Computing Correlation Functions of Nuclei},
  author={Nabil Humphrey and William Detmold and Ross D. Young and James Zanotti},
  journal={Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021)},
  • Nabil Humphrey, W. Detmold, J. Zanotti
  • Published 12 January 2022
  • Computer Science
  • Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021)
Factor Tree ←→ E = 5 T (1) 122T (2) 232 + T (1) 123T (2) 232 − T (1) 123T (2) 323 = 5 T (1) 122T (2) 232 + T (1) 123 ( T (2) 232 − T (2) 323 ) Figure 3: Abstract Factor Tree example (left) with corresponding tensor expression E (right). T (1) i jk , T (2) i jk are rank-3 tensors. C, we can expect a high degree of both term-wise and factor-wise ‘compression’ in multiplicity accumulation and factorisation. To target expressions of this type we construct factor trees, in which the sum of all root… 

Figures from this paper

Study of three-flavored heavy dibaryons using lattice QCD
We present results of the first lattice QCD calculation of three-flavored heavy dibaryons both in the flavor-symmetric and in the antisymmetric channels. These dibaryons have spin zero, and the


Classifications and canonical forms of tensor product expressions in the presence of permutation symmetries
This work has provided a general solution to the tensor canonicalization problem, which is potentially of exponential cost in the number of indices in the collection of tensor product terms.
Recursive approach to determine correlation functions in multibaryon systems
We propose a recursive algorithm for the calculation of multi-baryon correlation functions that combines the advantages of a recursive approach with those of the recently proposed unified contraction
Unified contraction algorithm for multi-baryon correlators on the lattice
High Statistics Analysis using Anisotropic Clover Lattices: (II) Three-Baryon Systems
We present the results of an exploratory lattice QCD calculation of three-baryon systems through a high statistics study of one ensemble of anisotropic clover gauge-field configurations with a pion
Efficiency of a Good But Not Linear Set Union Algorithm
It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing.
Helium nuclei in quenched lattice QCD
We present results for the binding energies for {sup 4}He and {sup 3}He nuclei calculated in quenched lattice QCD at the lattice spacing of a=0.128 fm with a heavy quark mass corresponding to m{sub
A Fast Algorithm for Lattice Hyperonic Potentials
We describe an efficient algorithm to compute a large number of baryon-baryon interactions from $NN$ to $\Xi\Xi$ by means of HAL QCD method, which lays the groundwork for the nearly physical point
Nuclear correlation functions in lattice QCD
We consider the problem of calculating the large number of Wick contractions necessary to compute states with the quantum numbers of many baryons in lattice QCD. We consider a constructive approach
Multipion states in lattice QCD and the charged-pion condensate
The ground-state energies of systems containing up to twelve $$\pi^+$$'s in a spatial volume V ~ (2.5 fm)^3 are computed in dynamical, mixed-action lattice QCD at a lattice spacing of ~ 0.125 fm for
egg: Fast and extensible equality saturation
A new amortized invariant restoration technique called rebuilding takes advantage of equality saturation's distinct workload, providing asymptotic speedups over current techniques in practice, and is implemented in a new open-source library called egg.