ﻻ يوجد ملخص باللغة العربية
We describe and implement a family of entangling gates activated by radio-frequency flux modulation applied to a tunable transmon that is statically coupled to a neighboring transmon. The effect of this modulation is the resonant exchange of photons directly between levels of the two-transmon system, obviating the need for mediating qubits or resonator modes and allowing for the full utilization of all qubits in a scalable architecture. The resonance condition is selective in both the frequency and amplitude of modulation and thus alleviates frequency crowding. We demonstrate the use of three such resonances to produce entangling gates that enable universal quantum computation: one iSWAP gate and two distinct controlled Z gates. We report interleaved randomized benchmarking results indicating gate error rates of 6% for the iSWAP (duration 135ns) and 9% for the controlled Z gates (durations 175 ns and 270 ns), limited largely by qubit coherence.
Building a scalable quantum computer requires developing appropriate models to understand and verify its complex quantum dynamics. We focus on superconducting quantum processors based on transmons for which full numerical simulations are already chal
In state-of-the-art quantum computing platforms, including superconducting qubits and trapped ions, imperfections in the 2-qubit entangling gates are the dominant contributions of error to system-wide performance. Recently, a novel 2-qubit parametric
Superconducting transmon qubits comprise one of the most promising platforms for quantum information processing due to their long coherence times and to their scalability into larger qubit networks. However, their weakly anharmonic spectrum leads to
We propose a protocol to implement multi-qubit geometric gates (i.e., the M{o}lmer-S{o}rensen gate) using photonic cat qubits. These cat qubits stored in high-$Q$ resonators are promising for hardware-efficient universal quantum computing. Specifical
Superconducting transmon qubits are of great interest for quantum computing and quantum simulation. A key component of quantum chemistry simulation algorithms is breaking up the evolution into small steps, which naturally leads to the need for non-ma