A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

Applications such as simulating complicated quantum systems or solving large-scale linear
algebra problems are very challenging for classical computers, owing to the extremely high …

The simulation of fermionic systems is among the most anticipated applications of quantum
computing. We performed several quantum simulations of chemistry with up to one dozen …

Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a
competitive physical platform for quantum simulation and computing, where high-fidelity …

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 …

High-fidelity two-qubit gates at scale are a key requirement to realize the full promise of
quantum computation and simulation. The advent and use of coupler elements to tunably …

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

We describe quantum circuits with only O~(N) Toffoli complexity that block encode the
spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (eg, molecular) orbitals …

Parameterized quantum circuits (PQCs) play an essential role in the performance of many
variational quantum algorithms. One challenge in implementing such algorithms is choosing …

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