Related papers: Making Trotterization adaptive and energy-self-cor…
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in…
Quantum computers open the possibility of performing real-time calculations for quantum field theory scattering processes. We propose to use an index averaging the absolute value of the difference between the accurately calculated Trotter…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
Quantum simulation is a promising application of future quantum computers. Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. For an accurate product formula approximation,…
The extent to which quantum computers can simulate physical phenomena and solve the partial differential equations (PDEs) that govern them remains a central open question. In this work, one of the most fundamental PDEs is addressed: the…
Quantum systems have potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The…
As Noisy Intermediate-Scale Quantum (NISQ) devices grow in number of qubits, determining good or even adequate parameter configurations for a given application, or for device calibration, becomes a cumbersome task. An evolutionary algorithm…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
Fault-tolerant quantum computing is a promising tool for simulating molecules and materials, but frequently-considered applications require substantial resources, and the gap between hardware capabilities and requirements remains…
Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki…
One of the premier utilities of present day noisy quantum computers is simulation of many-body quantum systems. We study how long in time is such a discrete-time simulation representative of a continuous time Hamiltonian evolution, namely,…
Simulation of quantum many-body systems is a promising application of quantum computers. However, implementing the time-evolution operator as a quantum circuit efficiently on near-term devices with limited resources is challenging. Standard…
Quantum computers can efficiently simulate the dynamics of quantum systems. In this paper, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product formula algorithm. We…
Quantum dynamics simulation via Hamilton simulation algorithms is one of the most crucial applications in the quantum computing field. While this task has been relatively considered the target in the fault-tolerance era, the experiment for…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for…
The simulation of adiabatic evolution has deep connections with Adiabatic Quantum Computation, the Quantum Approximate Optimization Algorithm and adiabatic state preparation. Here we address the error analysis problem in quantum simulation…
We consider the extent to which a Trotterized time evolution implemented on a quantum computer is altered by the presence of decoherence. Given a specific set of assumptions regarding the manner in which noise processes acting on such a…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…