Related papers: Study of a new simulation algorithm for dynamical …
For over twenty years, ultra-cold atomic systems have formed an almost perfect arena for simulating different quantum many-body phenomena and exposing their non-obvious and very often counterintuitive features. Thanks to extremely precise…
Multi-bosonic fermion simulation algorithms are reviewed, with particular emphasis on a recent application in SU(2) Yang-Mills theory with light gluinos.
Simulating interactions between fermions and bosons is central to understanding correlated phenomena, yet these systems are inherently difficult to treat classically. Previous quantum algorithms for fermion-boson models exhibit computation…
We employ quantum variational methods to investigate a single-site interacting fermion-boson system -- an example of a minimal supersymmetric model that can exhibit spontaneous supersymmetry breaking. Our study addresses the challenges…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
I discuss the behaviour of algorithms for dynamical fermions as the sea-quark mass decreases. I focus on the Hybrid-Monte-Carlo (HMC) algorithm applied to two degenerate flavours of Wilson fermions. First, I briefly review the performance…
We introduce a new method for representing the low energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In…
Dynamic properties of fermionic systems, like contollability, reachability, and simulability, are investigated in a general Lie-theoretical frame for quantum systems theory. Observing the parity superselection rule, we treat the fully…
We present a simple derivation of a Feynman-Kac type formula to study fermionic systems. In this approach the real time or the imaginary time dynamics is expressed in terms of the evolution of a collection of Poisson processes. A computer…
Classical simulations of time-dependent quantum systems are widely used in quantum control research. In particular, these simulations are commonly used to host iterative optimal control algorithms. This is convenient for algorithms that are…
Many parallel and distributed computing research results are obtained in simulation, using simulators that mimic real-world executions on some target system. Each such simulator is configured by picking values for parameters that define the…
We study the systematic errors of L\"uscher's formulation of dynamical Wilson quarks and some of its variants, in the weak and strong coupling limits, and on a sample of small configurations at finite $\beta$. We confirm the existence of an…
In this talk I propose a new computational scheme with overlap fermions and a fast algorithm to invert the corresponding Dirac operator.
Ab-initio studies of strongly interacting bosonic and fermionic systems is greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement, and outlines the ideas behind the construction of the cluster…
A random search algorithm intended to solve discrete optimization problems is considered. We outline the main components of the algorithm, and then describe it in more detail. We show how the algorithm can be implemented on parallel…
Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most…
Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical…
Parallel algorithms for ab initio calculations of vibrations modes of solids are presented and implemented under PVM. Load balancing and communication problems are dealt with in order to increase parallelism efficiency. For accurate time…