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 …

A quantum computer can solve hard problems, such as prime factoring,, database
searching, and quantum simulation, at the cost of needing to protect fragile quantum states …

We report the first electronic structure calculation performed on a quantum computer without
exponentially costly precompilation. We use a programmable array of superconducting …

Quantum computing becomes viable when a quantum state can be protected from
environment-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse …

We demonstrate a planar, tunable superconducting qubit with energy relaxation times up to
44 μ s. This is achieved by using a geometry designed to both minimize radiative loss and …

Faster algorithms for combinatorial optimization could prove transformative for diverse areas
such as logistics, finance and machine learning. Accordingly, the possibility of quantum …

Quantum mechanics can help to solve complex problems in physics and chemistry, provided
they can be programmed in a physical device. In adiabatic quantum computing,,, a system is …

We describe the fabrication and measurement of microwave coplanar waveguide resonators
with internal quality factors above 10 7 at high microwave powers and over 10 6 at low …

The intriguing many-body phases of quantum matter arise from the interplay of particle
interactions, spatial symmetries, and external fields. Generating these phases in an …

Quantum algorithms offer a dramatic speedup for computational problems in material
science and chemistry. However, any near-term realizations of these algorithms will need to …