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 …

Ising machines are hardware solvers that aim to find the absolute or approximate ground
states of the Ising model. The Ising model is of fundamental computational interest because …

Realizing quantum speedup for practically relevant, computationally hard problems is a
central challenge in quantum information science. Using Rydberg atom arrays with up to …

The aim of this review is to provide quantum engineers with an introductory guide to the
central concepts and challenges in the rapidly accelerating field of superconducting …

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

For the first time in history, we are seeing a branching point in computing paradigms with the
emergence of quantum processing units (QPUs). Extracting the full potential of computation …

Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …

We introduce a quantum algorithm that produces approximate solutions for combinatorial
optimization problems. The algorithm depends on a positive integer p and the quality of the …

Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to
solve combinatorial optimization problems. In recent years, advances in quantum …