An official website of the United States government
A<sc>bstract</sc> Ab-initio simulations of multiple heavy quarks propagating in a Quark-Gluon Plasma are computationally difficult to perform due to the large dimension of the space of density matrices. This work develops machine learning algorithms to overcome this difficulty by approximating exact quantum states with neural network parametrisations, specifically Neural Density Operators. As a proof of principle demonstration in a QCD-like theory, the approach is applied to solve the Lindblad master equation in the 1 + 1d lattice Schwinger Model as an open quantum system. Neural Density Operators enable the study of in-medium dynamics on large lattice volumes, where multiple-string interactions and their effects on string-breaking and recombination phenomena can be studied. Thermal properties of the system at equilibrium can also be probed with these methods by variationally constructing the steady state of the Lindblad master equation. Scaling of this approach with system size is studied, and numerical demonstrations on up to 32 spatial lattice sites and with up to 3 interacting strings are performed.
more »
« less
Aspects of scaling and scalability for flow-based sampling of lattice QCD
Abstract Recent applications of machine-learned normalizing flows to sampling in lattice field theory suggest that such methods may be able to mitigate critical slowing down and topological freezing. However, these demonstrations have been at the scale of toy models, and it remains to be determined whether they can be applied to state-of-the-art lattice quantum chromodynamics calculations. Assessing the viability of sampling algorithms for lattice field theory at scale has traditionally been accomplished using simple cost scaling laws, but as we discuss in this work, their utility is limited for flow-based approaches. We conclude that flow-based approaches to sampling are better thought of as a broad family of algorithms with different scaling properties, and that scalability must be assessed experimentally.
more »
« less
- PAR ID:
- 10472660
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- The European Physical Journal A
- Volume:
- 59
- Issue:
- 11
- ISSN:
- 1434-601X
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Dynamos driven by rotating convection in the plane layer geometry are investigated numerically for a range of Ekman number ( $$E$$ ), magnetic Prandtl number ( $Pm$ ) and Rayleigh number ( $Ra$ ). The primary purpose of the investigation is to compare results of the simulations with previously developed asymptotic theory that is applicable in the limit of rapid rotation. We find that all of the simulations are in the quasi-geostrophic regime in which the Coriolis and pressure gradient forces are approximately balanced at leading order, whereas all other forces, including the Lorentz force, act as perturbations. Agreement between simulation output and asymptotic scalings for the energetics, flow speeds, magnetic field amplitude and length scales is found. The transition from large-scale dynamos to small-scale dynamos is well described by the magnetic Reynolds number based on the small convective length scale, $$\widetilde {Rm}$$ , with large-scale dynamos preferred when $$\widetilde {Rm} \lesssim O(1)$$ . The magnitude of the large-scale magnetic field is observed to saturate and become approximately constant with increasing Rayleigh number. Energy spectra show that all length scales present in the flow field and the small-scale magnetic field are consistent with a scaling of $$E^{1/3}$$ , even in the turbulent regime. For a fixed value of $$E$$ , we find that the viscous dissipation length scale is approximately constant over a broad range of $Ra$ ; the ohmic dissipation length scale is approximately constant within the large-scale dynamo regime, but transitions to a $$\widetilde {Rm}^{-1/2}$$ scaling in the small-scale dynamo regime.more » « less
-
In this work, we introduce a scalable and efficient GPU-accelerated methodology for volumetric particle advection and finite-time Lyapunov exponent (FTLE) calculation, focusing on the analysis of Lagrangian coherent structures (LCS) in large-scale direct numerical simulation (DNS) datasets across incompressible, supersonic, and hypersonic flow regimes. LCS play a significant role in turbulent boundary layer analysis, and our proposed methodology offers valuable insights into their behavior in various flow conditions. Our novel owning-cell locator method enables efficient constant-time cell search, and the algorithm draws inspiration from classical search algorithms and modern multi-level approaches in numerical linear algebra. The proposed method is implemented for both multi-core CPUs and Nvidia GPUs, demonstrating strong scaling up to 32,768 CPU cores and up to 62 Nvidia V100 GPUs. By decoupling particle advection from other problems, we achieve modularity and extensibility, resulting in consistent parallel efficiency across different architectures. Our methodology was applied to calculate and visualize the FTLE on four turbulent boundary layers at different Reynolds and Mach numbers, revealing that coherent structures grow more isotropic proportional to the Mach number, and their inclination angle varies along the streamwise direction. We also observed increased anisotropy and FTLE organization at lower Reynolds numbers, with structures retaining coherency along both spanwise and streamwise directions. Additionally, we demonstrated the impact of lower temporal frequency sampling by upscaling with an efficient linear upsampler, preserving general trends with only 10% of the required storage. In summary, we present a particle search scheme for particle advection workloads in the context of visualizing LCS via FTLE that exhibits strong scaling performance and efficiency at scale. Our proposed algorithm is applicable across various domains, requiring efficient search algorithms in large, structured domains. While this article focuses on the methodology and its application to LCS, an in-depth study of the physics and compressibility effects in LCS candidates will be explored in a future publication.more » « less
-
Abstract The problem of global-in-time regularity for the 3D Navier-Stokes equations, i.e., the question of whether a smooth flow can exhibit spontaneous formation of singularities, is a fundamental open problem in mathematical physics. Due to the super-criticality of the equations, the problem has been super-critical in the sense that there has been a ‘scaling gap’ between any regularity criterion and the corresponding a priori bound (regardless of the functional setup utilized). The purpose of this work is to present a mathematical framework-based on a suitably defined ‘scale of sparseness’ of the super-level sets of the positive and negative parts of the components of the higher-order spatial derivatives of the velocity field—in which the scaling gap between the regularity class and the corresponding a priori bound vanishes as the order of the derivative goes to infinity.more » « less
-
Abstract SummaryImprovements in nanopore sequencing necessitate efficient classification methods, including pre-filtering and adaptive sampling algorithms that enrich for reads of interest. Signal-based approaches circumvent the computational bottleneck of basecalling. But past methods for signal-based classification do not scale efficiently to large, repetitive references like pangenomes, limiting their utility to partial references or individual genomes. We introduce Sigmoni: a rapid, multiclass classification method based on the r-index that scales to references of hundreds of Gbps. Sigmoni quantizes nanopore signal into a discrete alphabet of picoamp ranges. It performs rapid, approximate matching using matching statistics, classifying reads based on distributions of picoamp matching statistics and co-linearity statistics, all in linear query time without the need for seed-chain-extend. Sigmoni is 10–100× faster than previous methods for adaptive sampling in host depletion experiments with improved accuracy, and can query reads against large microbial or human pangenomes. Sigmoni is the first signal-based tool to scale to a complete human genome and pangenome while remaining fast enough for adaptive sampling applications. Availability and implementationSigmoni is implemented in Python, and is available open-source at https://github.com/vshiv18/sigmoni.more » « less
