Related papers: Using evolutionary algorithms to extract field the…
Progress on the calculation of the spectrum from lattice calculations is reviewed. Particular emphasis is placed on discussing our ability to control possible systematic errors coming from finite volume, and extrapolations in quark mass and…
Quantum computing promises to speed up some of the most challenging problems in science and engineering. Quantum algorithms have been proposed showing theoretical advantages in applications ranging from chemistry to logistics optimization.…
A review of the mechanisms of speciation is performed. The mechanisms of the evolution of species, taking into account the feedback of the state of the environment and mechanisms of the emergence of complexity, are considered. It is shown…
As mathematical model for the evolutionary equations of species the masterequation is choiced. Two formulations will be demonstrated to include the changes of parameters into the masterequation - that is, on the one hand, the formation of a…
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…
The development of Monte Carlo algorithms for generating gauge field configurations with dynamical fermions and methods for extracting the most information from ensembles are summarised.
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
Because of the mass gap, lattice QCD simulations exhibit stochastic locality: distant regions of the lattice fluctuate independently. There is a long history of exploiting this to increase statistics by obtaining multiple…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
We discuss the simulation of a complex dynamical system, the so-called quantum sawtooth map model, on a quantum computer. We show that a quantum computer can be used to efficiently extract relevant physical information for this model. It is…
Quantum state diffusion (QSD) as a tool to solve quantum-optical master equations by stochastic simulation can be made several orders of magnitude more efficient if states in Hilbert space are represented in a moving basis of excited…
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adaptation Evolution Strategy is one of the most efficient algorithms…
The computation of dynamical properties of nuclear matter, ranging from parton distribution functions of nucleons and nuclei to transport properties in the quark-gluon plasma, constitutes a central goal of modern theoretical physics. This…
We present a new algorithm to analytically continue the self-energy of quantum many-body systems from Matsubara frequencies to the real axis. The method allows straightforward, unambiguous computation of electronic spectra for lattice…
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great…
We analyse the meson spectrum in quenched QCD using lattice gauge theory. By studying hadron propagation with a variety of operators (both smeared and local), we are able to extract the ground state and first excited state masses with…
There is a class of statistical problems that arises in several contexts, the Lattice QCD problem of particle physics being one that has attracted the most attention. In essence, the problem boils down to the estimation of an infinite…
Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in HMC simulations. The use of a multiple time-scale integration scheme allows the filtered pseudofermions to be…
The mathematical runtime analysis of evolutionary algorithms traditionally regards the time an algorithm needs to find a solution of a certain quality when initialized with a random population. In practical applications it may be possible…
These notes are inspired by the theory of cellular automata. A linear cellular automaton on a lattice of finite rank or on a toric grid is a discrete dinamical system generated by a convolution operator with kernel concentrated in the…