Related papers: A simple efficient algorithm in frustration-free o…

We propose a variant formulation of Hamiltonian systems by the use of variables including redundant degrees of freedom. We show that Hamiltonian systems can be described by extended dynamics whose master equation is the Nambu equation or…

We propose a new Monte Carlo algorithm for the numerical study of general lattice models in Hamiltonian form. The algorithm is based on an initial Ansatz for the ground state wave function depending on a set of free parameters which are…

We consider a quantum fully packed loop model on the square lattice with a frustration-free projector Hamiltonian and ring-exchange interactions acting on plaquettes. A boundary Hamiltonian is added to favour domain-wall boundary conditions…

We introduce a method for the search of parent Hamiltonians of input wave-functions based on the structure of their reduced density matrix. The two key elements of our recipe are an ansatz on the relation between reduced density matrix and…

I describe a simple algorithm for numerically finding the ground state and low-lying excited states of a quantum system. The algorithm is an adaptation of the relaxation method for solving Poisson's equation, and is fundamentally based on…

We describe a novel algorithm that learns a Hamiltonian from local expectations of its Gibbs state using the free energy variational principle. The algorithm avoids the need to compute the free energy directly, instead using efficient…

We present a numerical method based on real-space renormalization that outputs the exact ground space of "frustration-free" Hamiltonians. The complexity of our method is polynomial in the degeneracy of the ground spaces of the Hamiltonians…

We develop an efficient and robust approach to Hamiltonian identification for multipartite quantum systems based on the method of compressed sensing. This work demonstrates that with only O(s log(d)) experimental configurations, consisting…

We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

State space subspace algorithms for input-output systems have been widely applied but also have a reasonably well-developedasymptotic theory dealing with consistency. However, guaranteeing the stability of the estimated system matrix is a…

Standandard Hamiltonian mechanics in its homogeneous formulation is applied to the study of discontinuities representing rapid changes of Hamiltonians. Different formulations of Hamiltonian mechanics are reviewed. An original representation…

A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were…

We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel…

For an underactuated (simple) Hamiltonian system with two degrees of freedom and one degree of underactuation, a rather general condition that ensures its stabilizability, by means of the existence of a (simple) Lyapunov function, was found…

Preparing thermal and ground states is an essential quantum algorithmic task for quantum simulation. In this work, we construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary…

Predicting properties across system parameters is an important task in quantum physics, with applications ranging from molecular dynamics to variational quantum algorithms. Recently, provably efficient algorithms to solve this task for…

In this paper, a simple field function is presented for facilitating the solution of complex and dynamic fluid-solid systems on Cartesian grids with interface-resolved fluid-fluid, fluid-solid, and solid-solid interactions. For a…

We present an implementation of an efficient algorithm for the calculation of the spectrum of one-dimensional quantum systems with periodic boundary conditions. This algorithm is based on a matrix product representation for quantum states…

We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…