Related papers: Simulating Hamiltonian dynamics with a truncated T…
Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been…
We present an efficient and precise framework to quantum simulate the dynamics of the ultra-relativistic quark-nucleus scattering. This framework employs the eigenbasis of the asymptotic scattering system and implements a compact scheme for…
Truncated Taylor expansions of smooth flow maps are used in Hamilton's principle to derive a multiscale Lagrangian particle representation of ideal fluid dynamics. Numerical simulations for scattering of solutions at one level of truncation…
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…
Before we proposed an algebraic technics for the Hamiltonian approach to the evolution systems of partial differential equations, including systems with constraints. Here we further develop this approach and present the defining system of…
We develop a computational method to learn a molecular Hamiltonian matrix from matrix-valued time series of the electron density. As we demonstrate for three small molecules, the resulting Hamiltonians can be used for electron density…
We propose a simple method for simulating a general class of non-unitary dynamics as a linear combination of Hamiltonian simulation (LCHS) problems. LCHS does not rely on converting the problem into a dilated linear system problem, or on…
The time evolution of a closed quantum system is connected to its Hamiltonian through Schroedinger's equation. The ability to estimate the Hamiltonian is critical to our understanding of quantum systems, and allows optimization of control.…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
Nonperturbative dynamics of quantum fields out of equilibrium is often described by the time evolution of a hierarchy of correlation functions, using approximation methods such as Hartree, large N, and nPI-effective action techniques. These…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
Hamiltonian simulation is a central task in quantum computing, with wide-ranging applications in quantum chemistry, condensed matter physics, and combinatorial optimization. A fundamental challenge lies in approximating the unitary…
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial…
On the basis of the closed-time path formalism of non-equilibrium quantum field theory, we derive the real-time quantum dynamics of heavy quark systems. Even though our primary goal is the description of heavy quarkonia, our method allows a…
Digital quantum simulators provide a diversified tool for solving the evolution of quantum systems with complicated Hamiltonians and hold great potential for a wide range of applications. Although much attention is paid to the unitary…
Quantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources to realize this potential, we employ state-of-the-art…
Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…
We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider "space-like cuts" where an entangling unitary is…
In this paper we develop an analogue of Hamilton-Jacobi theory for the time-evolution operator of a quantum many-particle system. The theory offers a useful approach to develop approximations to the time-evolution operator, and also…