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 dynamics due to the diagonal component of the Hamiltonian from the dynamics generated by its off-diagonal part, which we encode using the linear combination of unitaries technique. Our method has an optimal dependence on the desired precision and, as we illustrate, generally requires considerably fewer resources than the current state-of-the-art. We provide an analysis of resource costs for several sample models
We present a numerical method to simulate the time evolution, according to a generic Hamiltonian mad...
The Hamiltonian of a quantum system governs the dynamics of the system via the Schrodinger equation....
This thesis describes quantum algorithms for Hamiltonian simulation, ordinary differential equations...
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by ...
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinatio...
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by ...
We explicitly show how to simulate time-dependent sparse Hamiltonian evolution on a quantum computer...
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circ...
We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers...
Abstract We present an efficient quantum algorithm for simulating the evolution of a quantum state f...
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum syst...
With a focus on universal quantum computing for quantum simulation, and through the example of latti...
Imaginary-time evolution plays an important role in many areas of quantum physics and has been widel...
Simulating the Hamiltonian dynamics of quantum systems is one of the most promising applications of ...
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Name...
We present a numerical method to simulate the time evolution, according to a generic Hamiltonian mad...
The Hamiltonian of a quantum system governs the dynamics of the system via the Schrodinger equation....
This thesis describes quantum algorithms for Hamiltonian simulation, ordinary differential equations...
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by ...
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinatio...
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by ...
We explicitly show how to simulate time-dependent sparse Hamiltonian evolution on a quantum computer...
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circ...
We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers...
Abstract We present an efficient quantum algorithm for simulating the evolution of a quantum state f...
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum syst...
With a focus on universal quantum computing for quantum simulation, and through the example of latti...
Imaginary-time evolution plays an important role in many areas of quantum physics and has been widel...
Simulating the Hamiltonian dynamics of quantum systems is one of the most promising applications of ...
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Name...
We present a numerical method to simulate the time evolution, according to a generic Hamiltonian mad...
The Hamiltonian of a quantum system governs the dynamics of the system via the Schrodinger equation....
This thesis describes quantum algorithms for Hamiltonian simulation, ordinary differential equations...