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

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 …

Matrix computation, as a fundamental building block of information processing in science
and technology, contributes most of the computational overheads in modern signal …

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

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

Modern computation based on von Neumann architecture is now a mature cutting-edge
science. In the von Neumann architecture, processing and memory units are implemented …

Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

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 …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

Recent decades have witnessed great developments in the field of quantum simulation—
where synthetic systems are built and studied to gain insight into complicated, many-body …