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 …

Quantum circuits—built from local unitary gates and local measurements—are a new
playground for quantum many-body physics and a tractable setting to explore universal …

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 …

The promise of quantum computers is that certain computational tasks might be executed
exponentially faster on a quantum processor than on a classical processor 1. A fundamental …

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 …

Superconducting qubits are leading candidates in the race to build a quantum computer
capable of realizing computations beyond the reach of modern supercomputers. The …

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical
variational algorithm designed to tackle combinatorial optimization problems. Despite its …

A critical question for quantum computing in the near future is whether quantum devices
without error correction can perform a well-defined computational task beyond the …

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

Scalable generation of genuine multipartite entanglement with an increasing number of
qubits is important for both fundamental interest and practical use in quantum-information …