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

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 …

Abstract Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on
Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise …

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 …

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 …

This article outlines our point of view regarding the applicability, state-of-the-art, and
potential of quantum computing for problems in finance. We provide an introduction to …

Abstract Variational Quantum Algorithms (VQAs) have received considerable attention due
to their potential for achieving near-term quantum advantage. However, more work is …

Quantum computers offer an intriguing path for a paradigmatic change of computing in the
natural sciences and beyond, with the potential for achieving a so-called quantum …

Digital quantum computers provide a computational framework for solving the Schrödinger
equation for a variety of many‐particle systems. Quantum computing algorithms for the …

Variational quantum algorithms rely on gradient based optimization to iteratively minimize a
cost function evaluated by measuring output (s) of a quantum processor. A barren plateau is …