Related papers: Time-Dependent Hamiltonian Simulation in the Low-E…
Recent studies have shown that Trotter errors are highly initial-state dependent and that standard upper bounds often substantially overestimate them. However, the mechanism underlying anomalously small Trotter errors and a systematic route…
We present a quantum computational framework using Hamiltonian Truncation (HT) for simulating real-time scattering processes in $(1+1)$-dimensional scalar $\phi^4$ theory. Unlike traditional lattice discretisation methods, HT approximates…
Simulating vibrational dynamics is essential for understanding molecular structure, unlocking useful applications such as vibrational spectroscopy for high-fidelity chemical detection. Quantum algorithms for vibrational dynamics are…
Adiabatic evolution is a central paradigm in quantum physics. Digital simulations of adiabatic processes are generally viewed as costly, since algorithmic errors typically accumulate over the long evolution time, requiring exceptionally…
We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search…
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…
Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. In this work, we analyze…
We apply the method of transitionless quantum driving for time-dependent quantum systems to spin systems. For a given Hamiltonian, the driving Hamiltonian is constructed so that the adiabatic states of the original system obey the…
In recent years quantum simulation has made great strides culminating in experiments that operate in a regime that existing supercomputers cannot easily simulate. Although this raises the possibility that special purpose analog quantum…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
Relativistic spin effects drive subtle molecular phenomena ranging from intersystem crossing in photodynamic therapy to spin-mediated catalysis and high-resolution spectroscopy. These effects are described by the Pauli-Breit Hamiltonian,…
The adiabatic theorem is a fundamental result established in the early days of quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time…
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
In a quantum system with a smoothly and slowly varying Hamiltonian, which approaches a constant operator at times $t\to \pm \infty$, the transition probabilities between adiabatic states are exponentially small. They are characterized by an…
We propose an iterative variational quantum algorithm to simulate the time evolution of arbitrary initial states within a given subspace. The algorithm compresses the Trotter circuit into a shorter-depth parameterized circuit, which is…
Quantum computers offer the potential to efficiently simulate the dynamics of quantum systems, a task whose difficulty scales exponentially with system size on classical devices. To assess the potential for near-term quantum computers to…
Hamiltonian formulation of lattice gauge theories (LGTs) is the most natural framework for the purpose of quantum simulation, an area of research that is growing with advances in quantum-computing algorithms and hardware. It, therefore,…
Hamiltonian simulation is one of the most promising applications of quantum computers, and the product formula is one of the most important methods for this purpose. Previous related work has mainly focused on the worst$-$case or…
We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity of the target Hamiltonian, sparsity of interactions, and…