Search

The interaction of multipetawatt lasers with plasma is a complex multiparameter problem, providing a wide field for fundamental research and opening up great opportunities for creating unique sources of high-energy electrons and positrons, dense pair plasma, and $\gamma$-photons. However, to achieve high efficiency of such a source, it is necessary to use targets with optimized parameters, primarily density and size, for the given laser parameters. With the use of 3D QED-PIC modeling it is shown that, when targets whose size is comparable with the laser wavelength are irradiated by laser beams with a total power of several tens of PW, the total initial number of target electrons may be regarded to be the similarity parameter of laser-plasma interaction. In practice, this can significantly simplify the selection of the targets needed for controlling the interaction and, accordingly, for achieving the specified parameters of the developed electron-positron plasma and $\gamma$-photon sources. Based on the similarity parameter, various laser-plasma interaction modes are identified, the necessary conditions for their launch are determined, and the properties of the pair particle and $\gamma$-photon source are revealed. Moreover, qualitative estimates of the quantitative and energy characteristics of such a source are obtained, allowing it to be optimized for various laser beam configurations., Comment: 22 pages, 10 figures

The autoencoder model typically uses an encoder to map data to a lower dimensional latent space and a decoder to reconstruct it. However, relying on an encoder for inversion can lead to suboptimal representations, particularly limiting in physical sciences where precision is key. We introduce a decoder-only method using gradient flow to directly encode data into the latent space, defined by ordinary differential equations (ODEs). This approach eliminates the need for approximate encoder inversion. We train the decoder via the adjoint method and show that costly integrals can be avoided with minimal accuracy loss. Additionally, we propose a $2^{nd}$ order ODE variant, approximating Nesterov's accelerated gradient descent for faster convergence. To handle stiff ODEs, we use an adaptive solver that prioritizes loss minimization, improving robustness. Compared to traditional autoencoders, our method demonstrates explicit encoding and superior data efficiency, which is crucial for data-scarce scenarios in the physical sciences. Furthermore, this work paves the way for integrating machine learning into scientific workflows, where precise and efficient encoding is critical. \footnote{The code for this work is available at \url{https://github.com/k-flouris/gfe}.}, Comment: Machine Learning and the Physical Sciences Workshop, NeurIPS 2024

Numerical simulation of strong-field quantum electrodynamics (SFQED) processes is an essential step towards current and future high-intensity laser experiments. The complexity of SFQED phenomena and their stochastic nature make them extremely computationally challenging, requiring the use of supercomputers for realistic simulations. Recently, we have presented a novel approach to numerical simulation of SFQED processes based on an accurate approximation of precomputed rates, which minimizes the number of rate calculations per QED event. The current paper is focused on the high-performance implementation of this method, including vectorization of resource-intensive kernels and improvement of parallel computing efficiency. Using two codes, PICADOR and hi-$\chi$ (the latter being free and publicly available), we demonstrate significant reduction in computation time due to these improvements. We hope that the proposed approach can be applied in other codes for the numerical simulation of SFQED processes.

We construct a sphere-homeomorphic flexible self-intersection free polyhedron in Euclidean 3-space such that all its dihedral angles change during some flex of this polyhedron. The constructed polyhedron has 26 vertices, 72 edges and 48 faces. To study its properties, we use symbolic computations in the Wolfram Mathematica software system., Comment: 19 pages, 6 figures; this v2 is an English translation of v1, which is in Russian

The emergence and rapid development of the open RISC-V instruction set architecture opens up new horizons on the way to efficient devices, ranging from existing low-power IoT boards to future high-performance servers. The effective use of RISC-V CPUs requires software optimization for the target platform. In this paper, we focus on the RISC-V-specific optimization of the CatBoost library, one of the widely used implementations of gradient boosting for decision trees. The CatBoost library is deeply optimized for commodity CPUs and GPUs. However, vectorization is required to effectively utilize the resources of RISC-V CPUs with the RVV 0.7.1 vector extension, which cannot be done automatically with a C++ compiler yet. The paper reports on our experience in benchmarking CatBoost on the Lichee Pi 4a, RISC-V-based board, and shows how manual vectorization of computationally intensive loops with intrinsics can speed up the use of decision trees several times, depending on the specific workload. The developed codes are publicly available on GitHub.

The development of an open and free RISC-V architecture is of great interest for a wide range of areas, including high-performance computing and numerical simulation in mathematics, physics, chemistry and other problem domains. In this paper, we discuss the possibilities of accelerating computations on available RISC-V processors by improving the vectorization of several computer vision and machine learning algorithms in the widely used OpenCV library. It is shown that improved vectorization speeds up computations on existing prototypes of RISC-V devices by tens of percent.

We study the global behavior of the trajectories of the polynomial system $\dot x = x - x^2 y+p x y^2+ y^3, \ \dot y=y+p y^3 , \ \ p\in \mathbb{R}$. Our study is related to the paper {\it Alarcon B., Castro S.B.S.D., Labouriau I.S.} Glodal planar dynamics with star nodes: beyond Hilbert's 16th problem//arXiv:2106/07516v2 [math.DS]., Comment: 8 pages, 4 figures, in Russian

The emergence of a new, open, and free instruction set architecture, RISC-V, has heralded a new era in microprocessor architectures. Starting with low-power, low-performance prototypes, the RISC-V community has a good chance of moving towards fully functional high-end microprocessors suitable for high-performance computing. Achieving progress in this direction requires comprehensive development of the software environment, namely operating systems, compilers, mathematical libraries, and approaches to performance analysis and optimization. In this paper, we analyze the performance of two available RISC-V devices when executing three memory-bound applications: a widely used STREAM benchmark, an in-place dense matrix transposition algorithm, and a Gaussian Blur algorithm. We show that, compared to x86 and ARM CPUs, RISC-V devices are still expected to be inferior in terms of computation time but are very good in resource utilization. We also demonstrate that well-developed memory optimization techniques for x86 CPUs improve the performance on RISC-V CPUs. Overall, the paper shows the potential of RISC-V as an alternative architecture for high-performance computing.

Accurately estimating human body shape from photos can enable innovative applications in fashion, from mass customization, to size and fit recommendations and virtual try-on. Body silhouettes calculated from user pictures are effective representations of the body shape for downstream tasks. Smartphones provide a convenient way for users to capture images of their body, and on-device image processing allows predicting body segmentation while protecting users privacy. Existing off-the-shelf methods for human segmentation are closed source and cannot be specialized for our application of body shape and measurement estimation. Therefore, we create a new segmentation model by simplifying Semantic FPN with PointRend, an existing accurate model. We finetune this model on a high-quality dataset of humans in a restricted set of poses relevant for our application. We obtain our final model, ALiSNet, with a size of 4MB and 97.6$\pm$1.0$\%$ mIoU, compared to Apple Person Segmentation, which has an accuracy of 94.4$\pm$5.7$\%$ mIoU on our dataset.

Probabilistic generation of photons and electron-positron pairs due to the processes of strong-field quantum electrodynamics (SFQED) is often the most resource-intensive part of the kinetic simulations required in order to model current and future experimental studies at high-intensity laser facilities. To reduce its computational demands one can exploit tabulation of the precomputed rates, time-step sub-cycling, dynamic down-sampling of particle/photon ensembles and other approaches. As the culmination of previous improvements, the method described here provides the opportunity to make the minimal possible number of rate computations per QED event and, therefore, this method can increase performance by more than an order of magnitude. The computational routine is publicly available as a part of the open-source framework hi-$\chi$ designed as a Python-controlled toolbox for collaborative development.

Currently, machine learning (ML) methods are widely used to process the results of physical experiments. In some cases, due to the limited amount of experimental data, ML-models can be pre-trained on synthetic data simulated based on the analytical theory and then fine-tuned using experimental data. A limitation of this approach is the presence of the latent parameters of the analytical model, which values are difficult or impossible to estimate. Setting these parameters incorrectly may induce a dataset shift even when applied to synthetic data. To overcome this problem, we train the ML-model on a dataset with randomly varied latent parameters of the analythical model to force the ML-model to concentrate on more general patterns that depend weakly on the latent parameters. We applied this approach to the problem of tight focusing of a laser pulse with the complex structure of the wavefront. We observed good accuracy of reconstructing of the tilt parameters when training and testing the ML-model on datasets generated for different values of the latent parameters. This confirms that the ML-model was able to select relevant information without over-fitting for specific features inherent in certain values of the latent parameters. We believe that this approach will enrich possible applications of ML-methods to an experimental diagnostics of laser pulses.

The Black-Scholes option pricing problem is one of the widely used financial benchmarks. We explore the possibility of developing a high-performance portable code using the SYCL (Data Parallel C++) programming language. We start from a C++ code parallelized with OpenMP and show optimization techniques that are beneficial on modern Intel Xeon CPUs. Then, we port the code to SYCL and consider important optimization aspects on CPUs and GPUs (device-friendly memory access patterns, relevant data management, employing vector data types). We show that the developed SYCL code is only 10% inferior to the optimized C++ code when running on CPUs while achieving reasonable performance on Intel GPUs. We hope that our experience of developing and optimizing the code on SYCL can be useful to other researchers who plan to port their high-performance C++ codes to SYCL to get all the benefits of single-source programming., Comment: 15 pages, 2 figures

Recent advances in deep generative models led to the development of neural face video compression codecs that use an order of magnitude less bandwidth than engineered codecs. These neural codecs reconstruct the current frame by warping a source frame and using a generative model to compensate for imperfections in the warped source frame. Thereby, the warp is encoded and transmitted using a small number of keypoints rather than a dense flow field, which leads to massive savings compared to traditional codecs. However, by relying on a single source frame only, these methods lead to inaccurate reconstructions (e.g. one side of the head becomes unoccluded when turning the head and has to be synthesized). Here, we aim to tackle this issue by relying on multiple source frames (views of the face) and present encouraging results.

Similar to its classical version, quantum Markovian evolution can be either time-discrete or time-continuous. Discrete quantum Markovian evolution is usually modeled with completely-positive trace-preserving maps while time-continuous evolution is often specified with superoperators referred to as "Lindbladians". Here we address the following question: Being given a quantum map, can we find a Lindbladian which generates an evolution identical -- when monitored at discrete instances of time -- to the one induced by the map? It was demonstrated that the problem of getting the answer to this question can be reduced to an NP-complete (in the dimension $N$ of the Hilbert space the evolution takes place in) problem. We approach this question from a different perspective by considering a variety of Machine Learning (ML) methods and trying to estimate their potential ability to give the correct answer. Complimentary, we use the performance of different ML methods as a tool to check the hypothesis that the answer to the question is encoded in spectral properties of the so-called Choi matrix, which can be constructed from the given quantum map. As a test bed, we use two single-qubit models for which the answer can be obtained by using the reduction procedure. The outcome of our experiment is that, for a given map, the property of being generated by a time-independent Lindbladian is encoded both in the eigenvalues and the eigenstates of the corresponding Choi matrix.

Calculations of friction and heat transfer at the water-multilayer graphene interface using the theories of phononic and radiative friction and heat transfer are presented. The phononic contributions to friction and heat transfer are many orders of magnitude larger than the radiative contributions. Phononic friction and heat transfer slightly increase with an increase in the number of graphene layers $N$ and reach saturation at $N>5$, which is associated with an increase in the phonon transmission coefficient through the interface and a finite phonon mean free path in the direction perpendicular to the surface. The radiative contributions are almost independent on $N$, since for distance between water and graphene of the order of the interlayer distance in graphene the interaction of evanescent waves with multilayer graphene is limited by the first graphene layer. The results for the phonon contributions agree with the results obtained for the Kapitsa resistance using MD simulation and with the experimental data obtained for the friction coefficients at the water-monolayer graphene interface. The potential difference leads to a strong increase in the radiative contributions to friction and heat transfer, which become approximately an order of magnitude greater than the phononic contributions at a potential difference of $\sim 10$V., Comment: 13 pages, 6 figures

In studies of interaction of matter with laser fields of extreme intensity there are two limiting cases of a multi-beam setup maximizing either the electric field or the magnetic field. In this work attention is paid to the optimal configuration of laser beams in the form of an m-dipole wave, which maximizes the magnetic field. We consider in such highly inhomogeneous fields the advantages and specific features of laser-matter interaction, which stem from individual particle trajectories that are strongly affected by gamma photon emission. It is shown that in this field mode qualitatively different scenarios of particle dynamics take place in comparison with the mode that maximizes the electric field. A detailed map of possible regimes of particle motion (ponderomotive trapping, normal radiative trapping, radial and axial anomalous radiative trapping), as well as angular and energy distributions of particles and gamma photons, is obtained in a wide range of laser powers up to 300 PW and reveals signatures of radiation losses experimentally detectable even with subpetawatt lasers.

The autoencoder model uses an encoder to map data samples to a lower dimensional latent space and then a decoder to map the latent space representations back to the data space. Implicitly, it relies on the encoder to approximate the inverse of the decoder network, so that samples can be mapped to and back from the latent space faithfully. This approximation may lead to sub-optimal latent space representations. In this work, we investigate a decoder-only method that uses gradient flow to encode data samples in the latent space. The gradient flow is defined based on a given decoder and aims to find the optimal latent space representation for any given sample through optimisation, eliminating the need of an approximate inversion through an encoder. Implementing gradient flow through ordinary differential equations (ODE), we leverage the adjoint method to train a given decoder. We further show empirically that the costly integrals in the adjoint method may not be entirely necessary. Additionally, we propose a $2^{nd}$ order ODE variant to the method, which approximates Nesterov's accelerated gradient descent, with faster convergence per iteration. Commonly used ODE solvers can be quite sensitive to the integration step-size depending on the stiffness of the ODE. To overcome the sensitivity for gradient flow encoding, we use an adaptive solver that prioritises minimising loss at each integration step. We assess the proposed method in comparison to the autoencoding model. In our experiments, GFE showed a much higher data-efficiency than the autoencoding model, which can be crucial for data scarce applications.

New hardware architectures open up immense opportunities for supercomputer simulations. However, programming techniques for different architectures vary significantly, which leads to the necessity of developing and supporting multiple code versions, each being optimized for specific hardware features. The oneAPI framework, recently introduced by Intel, contains a set of programming tools for the development of portable codes that can be compiled and fine-tuned for CPUs, GPUs, FPGAs, and accelerators. In this paper, we report on the experience of porting the implementation of Boris particle pusher to oneAPI. Boris particle pusher is one of the most demanding computational stages of the Particle-in-Cell method, which, in particular, is used for supercomputer simulations of laser-plasma interactions. We show how to adapt the C++ implementation of the particle push algorithm from the Hi-Chi project to the DPC++ programming language and report the performance of the code on high-end Intel CPUs (Xeon Platinum 8260L) and Intel GPUs (P630 and Iris Xe Max). It turned out that our C++ code can be easily ported to DPC++. We found that on CPUs the resulting DPC++ code is only ~10% on average inferior to the optimized C++ code. Moreover, the code is compiled and run on new Intel GPUs without any specific optimizations and shows the expected performance, taking into account the parameters of the hardware.

When studying the interaction of matter with extreme fields using multipetawatt lasers, there are two limiting cases maximizing either the electric field or the magnetic field. Here, the main attention is paid to the optimal configuration of laser beams in the form of an m-dipole wave, which maximizes the magnetic field, and the corresponding production of pair plasma via a QED cascade using 10-PW class lasers. We show that the threshold of vacuum breakdown with respect to avalanche-like pair generation is about 10 PW. Using 3D PIC modeling in the specified fields, we go deeper into the physics of vacuum breakdown, i.e. we examined in detail the individual trajectories of particles produced in inhomogeneous electric and magnetic fields, the space-time distributions of pair densities on the avalanche stage, and the energy distributions of charged particles and gamma photons. The forming plasma structures represent concentric rings around the central magnetic axis, which can result in significant change of laser-plasma interaction in comparison with the case of an e-dipole wave.

Casimir and electrostatic non-contact friction between two gold plates, and a gold tip and a gold plate, are calculated taking into account the contribution of the electrical double layer. It is shown that in an extreme-near field ($d<10$nm) the contribution from the electrical double layer leads to the enhancement of non-contact friction by many orders of magnitude in comparison to the result of the conventional theory without this contribution. Casimir and electrostatic friction dominate for short and large separations, respectively. The calculated electrostatic friction is in good agreement with experimental data. The results obtained open the way to detect the Casimir friction using Atomic Force Microscope., Comment: 8 pages, 4 figures

When a pulsed, few-cycle electromagnetic wave is focused by optics with f-number smaller than two, the frequency components it contains are focused to different regions of space, building up a complex electromagnetic field structure. Accurate numerical computation of this structure is essential for many applications such as the analysis, diagnostics, and control of high-intensity laser-matter interactions. However, straightforward use of finite-difference methods can impose unacceptably high demands on computational resources, owing to the necessity of resolving far-field and near-field zones at sufficiently high resolution to overcome numerical dispersion effects. Here, we present a procedure for fast computation of tight focusing by mapping a spherically curved far-field region to periodic space, where the field can be advanced by a dispersion-free spectral solver. In many cases of interest, the mapping reduces both run time and memory requirements by a factor of order 10, making it possible to carry out simulations on a desktop machine or a single node of a supercomputer. We provide an open-source C++ implementation with Python bindings and demonstrate its use for a desktop machine, where the routine provides the opportunity to use the resolution sufficient for handling the pulses with spectra spanning over several octaves. The described approach can facilitate the stability analysis of theoretical proposals, the studies based on statistical inferences, as well as the overall development and analysis of experiments with tightly-focused short laser pulses., Comment: 27 pages, 8 figures

In recent years, the prospects of performing fundamental and applied studies at the next-generation high-intensity laser facilities have greatly stimulated the interest in performing large-scale simulations of laser interaction with matter with the account for quantum electrodynamics (QED) processes such as emission of high energy photons and decay of such photons into electron-positron pairs. These processes can be modeled via probabilistic routines that include frequent computation of synchrotron functions and can constitute significant computational demands within accordingly extended Particle-in-Cell (QED-PIC) algorithms. In this regard, the optimization of these routines is of great interest. In this paper, we propose and describe two modifications. First, we derive a more accurate upper-bound estimate for the rate of QED events and use it to arrange local sub-stepping of the global time step in a significantly more efficient way than done previously. Second, we present a new high-performance implementation of synchrotron functions. Our optimizations made it possible to speed up the computations by a factor of up to 13.7 depending on the problem. Our implementation is integrated into the PICADOR and Hi-Chi codes, the latter of which is distributed publicly (https://github.com/hi-chi/pyHiChi).

Calculations of heat transfer between two plates of gold in an extreme near field is performed taking into account the existence of the electric double layer on metal surfaces. For d < 3nm the double layer contribution exceeds the predictions of the conversional theory of the heat transfer by several orders of magnitudes. This effect is due to a coupling between the radiation electric field and the double layer dipole moment. The results obtained can be used for the heat management at the nanoscale by intentionally changing the parameters of surface dipoles with the help of engineering., Comment: 7 pages, 3 Figures

Probabilistic modelling has been an essential tool in medical image analysis, especially for analyzing brain Magnetic Resonance Images (MRI). Recent deep learning techniques for estimating high-dimensional distributions, in particular Variational Autoencoders (VAEs), opened up new avenues for probabilistic modeling. Modelling of volumetric data has remained a challenge, however, because constraints on available computation and training data make it difficult effectively leverage VAEs, which are well-developed for 2D images. We propose a method to model 3D MR brain volumes distribution by combining a 2D slice VAE with a Gaussian model that captures the relationships between slices. We do so by estimating the sample mean and covariance in the latent space of the 2D model over the slice direction. This combined model lets us sample new coherent stacks of latent variables to decode into slices of a volume. We also introduce a novel evaluation method for generated volumes that quantifies how well their segmentations match those of true brain anatomy. We demonstrate that our proposed model is competitive in generating high quality volumes at high resolutions according to both traditional metrics and our proposed evaluation., Comment: accepted for publication at MICCAI 2020. Code available https://github.com/voanna/slices-to-3d-brain-vae/

In particle-in-cell simulations, excessive or even unfeasible computational demands can be caused by the growth of the number of particles in the course of prolific ionization or cascaded pair production due to the effects of quantum electrodynamics. Here we discuss how one can organize a dynamic rearrangement of the ensemble to reduce the number of macroparticles, while maintaining acceptable sampling of an arbitrary particle distribution. The approaches of merging and thinning as well as their variants are discussed and the aspects of use are considered.

With their constantly increasing peak performance and memory capacity, modern supercomputers offer new perspectives on numerical studies of open many-body quantum systems. These systems are often modeled by using Markovian quantum master equations describing the evolution of the system density operators. In this paper we address master equations of the Lindblad form, which are a popular theoretical tool in quantum optics, cavity quantum electrodynamics, and optomechanics. By using the generalized Gell-Mann matrices as a basis, any Lindblad equation can be transformed into a system of ordinary differential equations with real coefficients. This allows us to use standard high-performance parallel algorithms to integrate the equations and thus to emulate open quantum dynamics in a computationally efficient way. Recently we presented an implementation of the transform with the computational complexity scaling as $O(N^5 log N)$ for dense Lindbaldians and $O(N^3 log N)$ for sparse ones. However, infeasible memory costs remain a serious obstacle on the way to large models. Here we present a parallel cluster-based implementation of the algorithm and demonstrate that it allows us to integrate a sparse Lindbladian model of the dimension $N=2000$ and a dense random Lindbladian model of the dimension $N=200$ by using $25$ nodes with $64$ GB RAM per node.

We calculate heat transfer between a 2D sheet (e.g. graphene) and a dielectric in presence of a gate voltage. The gate potential induces surface charge densities on the sheet and dielectric, which results in electric field, which is coupled to the surface displacements and, as a consequence, resulting an additional contributions to the radiative heat transfer. The electrostatic and van der Waals interactions between the surface displacement result in the phonon heat transfer, which we calculate taking into account the nonlocality of these interactions. Numerical calculations are presented for heat transfer between graphene and a SiO$_2$ substrate., Comment: 10 pages, 2 figures

State-of-the-art numerical simulations of laser plasma by means of the Particle-in-Cell method are often extremely computationally intensive. Therefore there is a growing need for development of approaches for efficient utilization of resources of modern supercomputers. In this paper, we address the problem of a substantially non-uniform and dynamically varying distribution of macroparticles in a computational area in simulating quantum electrodynamic (QED) cascades. We propose and evaluate a load balancing scheme for shared memory systems, which allows subdividing individual cells of the computational domain into work portions with subsequent dynamic distribution of these portions between OpenMP threads. Computational experiments on 1D, 2D, and 3D QED simulations show that the proposed scheme outperforms the previously developed standard and custom schemes in the PICADOR code by 2.1 to 10 times when employing several Intel Cascade Lake CPUs., Comment: 11 pages, 5 figures. Submitted to PPAM-2019

Many-body quantum systems are subjected to the Curse of Dimensionality: The dimension of the Hilbert space $\mathcal{H}$, where these systems live in, grows exponentially with systems' 'size' (number of their components, "bodies"). It means that, in order to specify a state of a quantum system, we need a description whose length grows exponentially with the system size. However, with some systems it is possible to escape the curse by using low-rank tensor approximations known as `matrix-product state/operator (MPS/O) representation' in the quantum community and `tensor-train decomposition' among applied mathematicians. Motivated by recent advances in computational quantum physics, we consider chains of $N$ spins coupled by nearest-neighbor interactions. The spins are subjected to an action coming from the environment. Spatially disordered interaction and environment-induced decoherence drive systems into non-trivial asymptotic states. The dissipative evolution is modeled with a Markovian master equation in the Lindblad form. By implementing the MPO technique and propagating system states with the time-evolving block decimation (TEBD) scheme (which allows to keep the length of the state descriptions fixed), it is in principle possible to reach the corresponding steady states. We propose and realize a cluster implementation of this idea. The implementation on four nodes allowed us to resolve steady states of the model systems with $N = 128$ spins.