Practical challenges in simulating quantum systems on classical computers have been
widely recognized in the quantum physics and quantum chemistry communities over the …

One of the most promising suggested applications of quantum computing is solving
classically intractable chemistry problems. This may help to answer unresolved questions …

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 …

Among the many computational challenges faced across different disciplines, quantum-
mechanical systems pose some of the hardest ones and offer a natural playground for the …

Quantum simulations of chemistry in first quantization offer some important advantages over
approaches in second quantization including faster convergence to the continuum limit and …

We study the problem of simulating the time evolution of a lattice Hamiltonian, where the
qubits are laid out on a lattice and the Hamiltonian only includes geometrically local …

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 …

Quantum materials exhibit a wide array of exotic phenomena and practically useful
properties. A better understanding of these materials can provide deeper insights into …

The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian.
When the Hamiltonian varies with time, the simulation complexity should only depend on …

Conventional methods of quantum simulation involve trade-offs that limit their applicability to
specific contexts where their use is optimal. In particular, the interaction picture simulation …