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 variational quantum eigensolver (or VQE), first developed by Peruzzo et al.(2014), has
received significant attention from the research community in recent years. It uses the …

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 …

For quantum computers to successfully solve real-world problems, it is necessary to tackle
the challenge of noise: the errors that occur in elementary physical components due to …

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 …

Quantum computers can exploit a Hilbert space whose dimension increases exponentially
with the number of qubits. In experiment, quantum supremacy has recently been achieved …

As we begin to reach the limits of classical computing, quantum computing has emerged as
a technology that has captured the imagination of the scientific world. While for many years …

Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …

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 …