Related papers: Multi-product Hamiltonian simulation with explicit…
A multi-product formula (MPF) is a promising approach for Hamiltonian simulation efficiently both in the system size $N$ and the inverse allowable error $1/\varepsilon$ by combining Trotterization and the linear combination of unitaries…
Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product…
Simulating the time-evolution of a Hamiltonian is one of the most promising applications of quantum computers. Multi-Product Formulas (MPFs) are well suited to replace standard product formulas since they scale better with respect to time…
Multi-product formulas (MPF) are linear combinations of Trotter circuits offering high-quality simulation of Hamiltonian time evolution with fewer Trotter steps. Here we report two contributions aimed at making multi-product formulas more…
Product-formula (PF) based quantum simulation is a promising approach for simulating quantum systems on near-term quantum computers. Achieving a desired simulation precision typically requires a polynomially increasing number of Trotter…
Product formula (PF), which approximates the time evolution under a many-body Hamiltonian by the product of local time evolution operators, is one of the central approaches for simulating quantum dynamics by quantum computers. It has been…
Hamiltonian simulation using product formulas is arguably the most straightforward and practical approach for algorithmic simulation of a quantum system's dynamics on a quantum computer. Here we present corrected product formulas (CPFs), a…
Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area. In this work, we construct…
This work provides a rigorous and self-contained introduction to numerical methods for Hamiltonian simulation in quantum computing, with a focus on high-order product formulas for efficiently approximating the time evolution of quantum…
Efficient simulation of quantum dynamics with time-dependent Hamiltonians is important not only for time-varying systems but also for time-independent Hamiltonians in the interaction picture. Such simulations are more challenging than their…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the…
We introduce a systematic construction of higher-order matrix product operator (MPO) approximations of the time evolution operator for generic (short and long range) one-dimensional Hamiltonians. We demonstrate the utility of our…
Compared with time independent Hamiltonians, the dynamics of generic quantum Hamiltonians $H(t)$ are complicated by the presence of time ordering in the evolution operator. In the context of digital quantum simulation, this difficulty…
We construct product formulas for exponentials of commutators and explore their applications. First, we directly construct a third-order product formula with six exponentials by solving polynomial equations obtained using the operator…
We provide a recursive method for constructing product formula approximations to exponentials of commutators, giving the first approximations that are accurate to arbitrarily high order. Using these formulas, we show how to approximate…
Hamiltonian simulation becomes more challenging as the underlying unitary becomes more oscillatory. In such cases, an algorithm with commutator scaling and a weak dependence, such as logarithmic, on the derivatives of the Hamiltonian is…
We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = \sum_{i=1}^m H_i$ where each $H_i$ can be efficiently simulated. Approaches relying on product formula generally work by splitting…
Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We…
A matrix product state formulation of the multiconfiguration time-dependent Hartree (MPS-MCTDH) theory is presented. The Hilbert space that is spanned by the direct products of the phonon degree of freedoms, which is linearly parameterized…