Related papers: A simple efficient algorithm in frustration-free o…
Quantum state processing is one of the main tools of quantum technologies. While real systems are complicated and/or may be driven by non-ideal control they may nevertheless exhibit simple dynamics approximately confined to a low-energy…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
An introduction to the application of combinatorial optimization methods to ground state calculations of frustrated, disordered systems is given. We discuss the interface problem in the random bond Ising ferromagnet, the random field Ising…
An exact result for the reduced density matrix on a finite interval for a $1+1$ dimensional free real scalar field in the ground state is presented. In the massless case, the Williamson decomposition of the appearing kernels is explicitly…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
We present a method for explicit leapfrog integration of inseparable Hamiltonian systems by means of an extended phase space. A suitably defined new Hamiltonian on the extended phase space leads to equations of motion that can be…
Long-term stability studies of nonlinear Hamiltonian systems require symplectic integration algorithms which are both fast and accurate. In this paper, we study a symplectic integration method wherein the symplectic map representing the…
A numerical method is proposed in order to track field lines of three-dimensional divergence free fields. Field lines are computed by a locally valid Hamiltonian mapping, which is computed using a symplectic scheme. The method is…
This work deals with planar dynamical systems with and without noise. In the first part, we seek to gain a refined understanding of such systems by studying their differential-geometric transformation properties under an arbitrary smooth…
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…
It is shown that a given non-autonomous system of two first-order ordinary differential equations can be expressed in Hamiltonian form. The derivation presented here allow us to obtain previously known results such as the infinite number of…
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…
We propose and test several tensor network based algorithms for reconstructing the ground state of an (unknown) local Hamiltonian starting from a random sample of the wavefunction amplitudes. These algorithms, which are based on completing…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
We present explicit expressions for the central piece of a variational method developed by Shi et al. which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian…
In this paper we develop a straightforward procedure to construct higher dimensional isochronous Hamiltonian systems. We first show that a class of singular Hamiltonian systems obtained through the $\Omega$-modified procedure is equivalent…
In this work, to efficiently help escape the stationary and saddle points, we propose, analyze, and generalize a stochastic strategy performed as an operator for a first-order gradient descent algorithm in order to increase the target…
While reduced-order models (ROMs) have been popular for efficiently solving large systems of differential equations, the stability of reduced models over long-time integration is of present challenges. We present a greedy approach for ROM…
This paper presents a distributed algorithm for controlling the deployment of a team of mobile agents in formations whose shapes can be characterized by a broad class of polygons, including regular ones, where each agent occupies a corner…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…