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 …

The Jaynes–Cummings Model (JCM) has recently been receiving increased attention as
one of the simplest, yet intricately nonlinear, models of quantum physics. Emphasising the …

Improving two-qubit gate performance and suppressing cross talk are major, but often
competing, challenges to achieving scalable quantum computation. In particular, increasing …

Quantum computing crucially relies on the ability to efficiently characterize the quantum
states output by quantum hardware. Conventional methods which probe these states …

Generating high-fidelity, tunable entanglement between qubits is crucial for realizing gate-
based quantum computation. In superconducting circuits, tunable interactions are often …

Transforming stand-alone qubits into a functional, general-purpose quantum processing unit
requires an architecture where many-body quantum entanglement can be generated and …

We demonstrate a controlled-Z gate between capacitively coupled fluxonium qubits with
transition frequencies 72.3 and 136.3 MHz. The gate is activated by a 61.6-ns-long pulse at …

Fixed-frequency superconducting quantum processors are one of the most mature quantum
computing architectures with high-coherence qubits and simple controls. However, high …

The ability to perform fast, high-fidelity entangling gates is a requirement for a viable
quantum processor. In practice, achieving fast gates often comes with the penalty of strong …

Large scale quantum computing motivates the invention of two-qubit gate schemes that not
only maximize the gate fidelity but also draw minimal resources. In the case of …