Related papers: Time-dependent unbounded Hamiltonian simulation wi…
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…
Quantum metrology enhances the sensitivity of parameter estimation using the distinctive resources of quantum mechanics such as entanglement. It has been shown that the precision of estimating an overall multiplicative factor of a…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
Product formulas are one of the main approaches for quantum simulation of the Hamiltonian dynamics of a quantum system. Their implementation cost is computed based on error bounds which are often pessimistic, resulting in overestimating the…
We obtain the complexity geometry associated with the Hamiltonian of a quantum mechanical system, specifically in cases where the Hamiltonian is explicitly time-dependent. Using Nielsen's geometric formulation of circuit complexity, we…
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global…
A fundamental challenge in digital quantum simulation (DQS) is the control of inherent errors. These appear when discretizing the time evolution generated by the Hamiltonian of a quantum many-body system as a sequence of quantum gates,…
As quantum computers and simulators begin to produce results that cannot be verified classically, it becomes imperative to develop a variety of tools to detect and diagnose experimental errors on these devices. While state or process…
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation…
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…
We develop a fourth-order Magnus expansion based quantum algorithm for the simulation of many-body problems involving two-level quantum systems with time-dependent Hamiltonians, $\mathcal{H}(t)$. A major hurdle in the utilization of the…
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…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Stochastic methods offer an effective way to suppress coherent errors in quantum simulation. In particular, the randomized compilation protocol may reduce circuit depth by randomly sampling Hamiltonian terms rather than following the…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
Quantum simulation is a promising way toward practical quantum advantage, but noise in current quantum hardware poses a significant obstacle. We prove that not only the physical error but also the algorithmic error in a single Trotter step…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…
Quantum phase estimation requires simulating the evolution of the Hamiltonian, for which product formulas are attractive due to their smaller qubit cost and ease of implementation. However, the estimation of the error incurred by product…
The goal of digital quantum simulation is to approximate the dynamics of a given target Hamiltonian via a sequence of quantum gates, a procedure known as Trotterization. The quality of this approximation can be controlled by the so called…