Related papers: Improved Quantum Computing with the Higher-order T…

We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…

We describe an improved version of the quantum simulation method based on the implementation of a truncated Taylor series of the evolution operator. The idea is to add an extra step to the previously known algorithm which implements an…

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of…

Implementing time-evolution operators in shallow quantum circuits is important for quantum simulations. The standard method of Trotterization requires a large number of gates to achieve practical accuracy. Variational Quantum Simulation…

This work discusses a variational approach to determining the time evolution operator. We directly see a glimpse of how a generalization of the quantum geometric tensor for unitary operators plays a central role in parameter evolution. We…

Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding…

We develop an hybrid quantum-classical algorithm to solve an optimal population transfer problem for a molecule subject to a laser pulse. The evolution of the molecular wavefunction under the laser pulse is simulated on a quantum computer,…

In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…

Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…

Trotterization is a standard approach for simulating quantum time evolution on quantum computers, where the Hamiltonian is split into local terms and each term is applied in sequence. The order of these terms affects the fidelity of the…

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps…

Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…

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…

The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual…

A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal…

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…

We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…

The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…

As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small,…