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 …

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

We describe and benchmark a new quantum charge-coupled device (QCCD) trapped-ion
quantum computer based on a linear trap with periodic boundary conditions, which …

Gate-model quantum computers promise to solve currently intractable computational
problems if they can be operated at scale with long coherence times and high-fidelity logic …

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

Scaling up to a large number of qubits with high-precision control is essential in the
demonstrations of quantum computational advantage to exponentially outpace the classical …

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 …

To ensure a long-term quantum computational advantage, the quantum hardware should be
upgraded to withstand the competition of continuously improved classical algorithms and …

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 …