Related papers: Quantum algorithm for the Vlasov simulation of the…
Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…
This paper reviews Vlasov-based numerical methods used to model plasma in space physics and astrophysics. Plasma consists of collectively behaving charged particles that form the major part of baryonic matter in the Universe. Many concepts…
We propose a distinct approach to solving linear and nonlinear differential equations (DEs) on quantum computers by encoding the problem into ground states of effective Hamiltonian operators. Our algorithm relies on constructing such…
We present a mapping of the nonlinear, electrostatic Vlasov equation with Krook-type collision operators, discretized on a (1+1) dimensional grid, onto a recent Carleman linearization-based quantum algorithm for solving ordinary…
We explore the effects of massive neutrinos on the cosmic web using the FLAMINGO simulations. We classify the cosmic web into voids, sheets, filaments, and clusters, and find that massive neutrinos affect the environment by decreasing the…
Finding the solution to linear systems is at the heart of many applications in science and technology. Over the years a number of algorithms have been proposed to solve this problem on a digital quantum device, yet most of these are too…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
Constraining neutrino mass through cosmological observations relies on precise simulations to calibrate their effects on large scale structure, while these simulations must overcome computational challenges like dealing with large velocity…
Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions…
The Vlasov-Maxwell equations provide an \textit{ab-initio} description of collisionless plasmas, but solving them is often impractical because of the wide range of spatial and temporal scales that must be resolved and the high…
The main effect of massive neutrinos on the large-scale structure consists in a few percent suppression of matter perturbations on all scales below their free-streaming scale. Such effect is of particular importance as it allows to…
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently,…
We present a time-dependent quantum algorithm for nuclear inelastic scattering in the time-dependent basis function on qubits approach. This algorithm aims to quantum simulate a subset of the nuclear inelastic scattering problems that are…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…
We examine a macroscopic system in a quantum superposition of two spatially separated localized states as a detector for a stream of weakly interacting relativistic particles. We do this using the explicit example of neutrinos with…
Cosmic voids, the underdense regions in the universe, are particularly sensitive to diffuse density components such as cosmic neutrinos. This sensitivity is enhanced by the match between void sizes and the free-streaming scale of massive…
Cosmological neutrinos strongly affect the evolution of the largest structures in the Universe, i.e. galaxies and galaxy clusters. We use large box-size full hydrodynamic simulations to investigate the non-linear effects that massive…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
Using quantum algorithms to simulate complex physical processes and correlations in quantum matter has been a major direction of quantum computing research, towards the promise of a quantum advantage over classical approaches. In this work…
The Fokker-Planck equation models rare events across sciences, but its high-dimensional nature challenges classical computers. Quantum algorithms for such non-unitary dynamics often suffer from exponential {decay in} success probability. We…