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.

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.

The power of machine learning (ML) in feature identification can be harnessed for determining quantities in experiments that are difficult to measure directly. However, if an ML model is trained on simulated data, rather than experimental results, the differences between the two can pose an obstacle to reliable data extraction. Here we report on the development of ML-based diagnostics for experiments on high-intensity laser–matter interactions. With the intention to accentuate robust, physics-governed features, the presence of which is tolerant to such differences, we test the application of principal component analysis, data augmentation and training with data that has superimposed noise of gradually increasing amplitude. Using synthetic data of simulated experiments, we identify that the approach based on the noise of increasing amplitude yields the most accurate ML models and thus is likely to be useful in similar projects on ML-based diagnostics.

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 that 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. Complimentarily, we use the performance of different ML methods as a tool to validate a 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 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.