Papers
Topics
Authors
Recent
Search
2000 character limit reached

Three-mode tunable coupler for superconducting two-qubit gates

Published 17 May 2024 in quant-ph | (2405.10886v2)

Abstract: Building a scalable universal high-performance quantum processor is a formidable challenge. In particular, the problem of realizing fast high-perfomance two-qubit gates of high-fidelity remains needful. Here we propose a building block for a scalable quantum processor consisting of two transmons and a tunable three-mode coupler allowing for a ZZ interaction control. We experimentally demonstrate the native CZ gate with the pulse duration of 60 ns achieving the two-qubit gate fidelity above 98%, limited mostly by qubit coherence time. Numerical simulations show that by optimizing the gate duration the fidelity can be pushed over 99.97%.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (6)
  1. F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Phys. Rev. Lett. 129, 090502 (2022).
  2. K. Kubo and H. Goto, Fast parametric two-qubit gate for highly detuned fixed-frequency superconducting qubits using a double-transmon coupler, Applied Physics Letters 122 (2023).
  3. K. Kubo, Y. Ho, and H. Goto, High-performance multi-qubit system with double-transmon couplers towards scalable superconducting quantum computers (2024), arXiv:2402.05361 [quant-ph] .
  4. J. M. Martinis, Surface loss calculations and design of a superconducting transmon qubit with tapered wiring, npj Quantum Information 8, 26 (2022).
  5. E. Y. Egorova, A. S. Kazmina, and I. N. Moskalenko, A weakly-tunable transmon qubit with an optimized shape of the shunted capacitance, Technical Physics Letters 50 (2024).
  6. M. A. Nielsen, A simple formula for the average gate fidelity of a quantum dynamical operation, Physics Letters A 303, 249 (2002).

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.