Related papers: Direct computational approach to lattice supersymm…
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…
We construct a lattice model for two-dimensional N=(2,2) supersymmetric QCD (SQCD), with the matter multiplets belonging to the fundamental or anti-fundamental representation of the gauge group U(N) or SU(N). The construction is based on…
In this paper we introduce a new class of integrable 3D lattice models, possessing continuous families of commuting layer-to-layer transfer matrices. Algebraically, this commutativity is based on a very special construction of local…
Numerical simulations based on electronic structure calculations are finding ever growing applications in many areas of physics. A major limiting factor is however the cubic scaling of the algorithms used. Building on previous work [F. R.…
When approximating the expectations of a functional of a solution to a stochastic differential equation, the numerical performance of deterministic quadrature methods, such as sparse grid quadrature and quasi-Monte Carlo (QMC) methods, may…
We investigate a Hamiltonian lattice version of the two-dimensional Wess-Zumino model by Quantum Monte Carlo simulations. In order to study the pattern of supersymmetry breaking, we measure the ground state energy and the correlation length…
A central question in Quantum Computing is how matrices in $SU(2)$ can be approximated by products over a small set of generators. A topology will be defined on $SU(2)$ so as to introduce the notion of a covering exponent which compares the…
Lattice gauge theories describe fundamental phenomena in nature, but calculating their real-time dynamics on classical computers is notoriously difficult. In a recent publication [Nature 534, 516 (2016)], we proposed and experimentally…
After a brief introduction to the statistical description of data, these lecture notes focus on quantum field theories as they emerge from lattice models in the critical limit. For the simulation of these lattice models, Markov chain…
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables…
We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its…
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based…
Semiclassical methods are essential in analyzing quantum mechanical systems. Although they generally produce approximate results, relatively rare potentials exist for which these methods are exact. Such intriguing potentials serve as…
We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed…
Scattering processes are fundamental for understanding the structure of matter, yet simulating their real-time dynamics remains challenging for classical computers. Quantum computing and quantum-inspired methods offer a promising avenue for…
One loop correction to the SUSY Ward-Takahashi identity is calculated on lattice with Wilson fermion. The supersymmetry on lattice is broken explicitly by the gluino mass and the lattice artifact. We should fine tune parameters in the…
We review the ideas of how random matrix theory has to be properly applied to quantum physics; particularly we focus on how the spectrum has to be properly prepared and the random matrix correctly identified before the random matrix and the…
In this paper will be presented methodology of encoding information in valuations of discrete lattice with some translational invariant constrains in asymptotically optimal way. The method is based on finding statistical description of such…
Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…