Related papers: New algorithm for classical gauge theory simulatio…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
Stochastic quantisation is applied to the problem of calculating real-time evolution on a Minkowskian space-time lattice. We employ optimized updating using reweighting, or gauge fixing, respectively. These procedures do not affect the…
Bayesian Optimization using Gaussian Processes is a popular approach to deal with the optimization of expensive black-box functions. However, because of the a priori on the stationarity of the covariance matrix of classic Gaussian…
Gauge field theories play a central role in modern physics and are at the heart of the Standard Model of elementary particles and interactions. Despite significant progress in applying classical computational techniques to simulate gauge…
Lattice Gauge Theories form a very successful framework for studying nonperturbative gauge field physics, in particular in Quantum Chromodynamics. Recently, their quantum simulation on atomic and solid-state platforms has been discussed,…
We introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios, capable of simulating universal measurement-based quantum computation with single-qubit Pauli measurements. In our model, the…
Any quasi-probability representation of a no-signaling system -- including quantum systems -- can be simulated via a purely classical scheme by allowing signed events and a cancellation procedure. This raises a fundamental question: What…
We consider generalizations of the classical inverse problem to Bayesien type estimators, where the result is not one optimal parameter but an optimal probability distribution in parameter space. The practical computational tool to compute…
Quantum computers have the potential to explore the vast Hilbert space of entangled states that play an important role in the behavior of strongly interacting matter. This opportunity motivates reconsidering the Hamiltonian formulation of…
The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity, and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for…
Scalar lattice gauge theories are models for scalar fields with local gauge symmetries. No fundamental gauge fields, or link variables in a lattice regularization, are introduced. The latter rather emerge as collective excitations composed…
We propose a computational method to obtain series expansions in powers of time for general dynamical systems described by a set of hierarchical rate equations. The method is generally applicable to problems in both equilibrium and…
We present a singularity excision algorithm appropriate for numerical simulations of black holes moving throughout the computational domain. The method is an extension of the excision procedure previously used to obtain stable simulations…
Quantum simulation is one of the major applications of quantum devices. In the noisy intermediate-scale quantum era, however, the general quantum simulation is not yet feasible, such as that of lattice gauge theories, which is likely…
Variational quantum algorithms have been proposed to solve static and dynamic problems of closed many-body quantum systems. Here we investigate variational quantum simulation of three general types of tasks---generalised time evolution with…
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection…
Real time evolution of a scalar field theory is investigated. The severe sign problem is circumvented using the Complex Langevin equation. The naive application of the method breaks down for extended real times due to the appearance of…
We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian…