The Lie-Trotter formula, together with its higher-order generalizations, provides a direct
approach to decomposing the exponential of a sum of operators. Despite significant effort …

We present a quantum-classical algorithm to study the dynamics of the two-spatial-site
Schwinger model on IBM's quantum computers. Using rotational symmetries, total charge …

We consider simulating an n-qubit Hamiltonian with nearest-neighbor interactions evolving
for time t on a quantum computer. We show that this simulation has gate complexity (nt) 1+ o …

We present a low-space overhead simulation algorithm based on the truncated Dyson
series for time-dependent quantum dynamics. This algorithm is applied to simulating time …

We consider simulating quantum systems on digital quantum computers. We show that the
performance of quantum simulation can be improved by simultaneously exploiting …

Quantum machine learning (QML) is an emerging research field, which is devoted to
devising and implementing quantum algorithms that could enable machine learning faster …

Simulating quantum dynamics beyond the reach of classical computers is one of the main
envisioned applications of quantum computers. The most promising quantum algorithms to …

Quantum computation appears to offer significant advantages over classical computation
and this has generated a tremendous interest in the field. In this thesis we study the …

We provide an explicit recursive divide-and-conquer approach for simulating quantum
dynamics and derive a discrete first-quantized nonrelativistic QED Hamiltonian based on the …

We derive higher-order error bounds with small prefactors for a general Trotter product
formula, generalizing a result given by Childs et al.[Phys. Rev. X 11, 011020 (2021) 2160 …