Quantum-mechanical effects at the macroscopic level were first explored in Josephson-
junction-based superconducting circuits in the 1980s. In recent decades, the emergence of …

Quantum computers have made extraordinary progress over the past decade, and
significant milestones have been achieved along the path of pursuing universal fault-tolerant …

Quantum computers hold the promise of solving computational problems that are intractable
using conventional methods. For fault-tolerant operation, quantum computers must correct …

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 …

High-fidelity two-qubit gates at scale are a key requirement to realize the full promise of
quantum computation and simulation. The advent and use of coupler elements to tunably …

The generation of high-fidelity distributed multi-qubit entanglement is a challenging task for
large-scale quantum communication and computational networks,,–. The deterministic …

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 …

Driving a quantum system periodically in time can profoundly alter its long-time dynamics
and trigger topological order. Such schemes are particularly promising for generating …

Certain algorithms for quantum computers are able to outperform their classical
counterparts. In 1994, Peter Shor came up with a quantum algorithm that calculates the …

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 …