Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons

• URL: http://arxiv.org/abs/2307.08737v3
• Date: Wed, 20 Mar 2024 16:46:25 GMT
• Title: Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons
• Authors: Harry Levine, Arbel Haim, Jimmy S. C. Hung, Nasser Alidoust, Mahmoud Kalaee, Laura DeLorenzo, E. Alex Wollack, Patricio Arrangoiz-Arriola, Amirhossein Khalajhedayati, Rohan Sanil, Hesam Moradinejad, Yotam Vaknin, Aleksander Kubica, David Hover, Shahriar Aghaeimeibodi, Joshua Ari Alcid, Christopher Baek, James Barnett, Kaustubh Bawdekar, Przemyslaw Bienias, Hugh Carson, Cliff Chen, Li Chen, Harut Chinkezian, Eric M. Chisholm, Andrew Clifford, R. Cosmic, Nicole Crisosto, Alexander M. Dalzell, Erik Davis, J. Mitch D'Ewart, Sandra Diez, Nathan D'Souza, Philipp T. Dumitrescu, Essam Elkhouly, Michael Fang, Yawen Fang, Steven T. Flammia, Matthew J. Fling, Gabriel Garcia, M. Kabeer Gharzai, Alexey V. Gorshkov, Mason J. Gray, Sebastian Grimberg, Arne L. Grimsmo, Connor T. Hann, Yuan He, Steven Heidel, Sean Howell, Matthew Hunt, Joseph K. Iverson, Ignace Jarrige, Liang Jiang, William M. Jones, Rassul Karabalin, Peter J. Karalekas, Andrew J. Keller, Davide Lasi, Menyoung Lee, Victor Ly, Gregory S. MacCabe, Neha Mahuli, Guillaume Marcaud, Matthew H. Matheny, Sam McArdle, Gavin McCabe, Gabe Merton, Cody Miles, Ashley Milsted, Anurag Mishra, Lorenzo Moncelsi, Mahdi Naghiloo, Kyungjoo Noh, Eric Oblepias, Gerson Ortuno, John Clai Owens, Jason Pagdilao, Ashley Panduro, J. -P. Paquette, Rishi N. Patel, Gregory A. Peairs, David J. Perello, Eric C. Peterson, Sophia Ponte, Harald Putterman, Gil Refael, Philip Reinhold, Rachel Resnick, Omar A. Reyna, Roberto Rodriguez, Jefferson Rose, Alex H. Rubin, Marc Runyan, Colm A. Ryan, Abdulrahman Sahmoud, Thomas Scaffidi, Bhavik Shah, Salome Siavoshi, Prasahnt Sivarajah, Trenton Skogland, Chun-Ju Su, Loren J. Swenson, Jared Sylvia, Stephanie M. Teo, Astrid Tomada, Giacomo Torlai, Mark Wistrom, Kailing Zhang, Ido Zuk, Aashish A. Clerk, Fernando G. S. L. Brandão, Alex Retzker, Oskar Painter,
• Abstract summary: We show that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit. We demonstrate mid-circuit detection of erasure errors while introducing $ 0.1%$ dephasing error per check. This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.
• Score: 59.63080344946083
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction with erasure qubits promises significant advantages over standard error correction due to favorable thresholds for erasure errors. To realize this advantage in practice requires a qubit for which nearly all errors are such erasure errors, and the ability to check for erasure errors without dephasing the qubit. We demonstrate that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit, where transmon $T_1$ errors are converted into erasure errors and residual dephasing is strongly suppressed, leading to millisecond-scale coherence within the qubit subspace. We show that single-qubit gates are limited primarily by erasure errors, with erasure probability $p_\text{erasure} = 2.19(2)\times 10^{-3}$ per gate while the residual errors are $\sim 40$ times lower. We further demonstrate mid-circuit detection of erasure errors while introducing $< 0.1\%$ dephasing error per check. Finally, we show that the suppression of transmon noise allows this dual-rail qubit to preserve high coherence over a broad tunable operating range, offering an improved capacity to avoid frequency collisions. This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.

Related papers

• High-fidelity gates in a transmon using bath engineering for passive leakage reset [65.46249968484794]
  Leakage, the occupation of any state not used in the computation, is one of the most devastating errors in quantum error correction. We demonstrate a device which reduces the lifetimes of the leakage states in the transmon by three orders of magnitude.
  arXiv  Detail & Related papers  (2024-11-06T18:28:49Z)
• Surface Code with Imperfect Erasure Checks [0.0]
  We investigate the consequences of using an imperfect but overhead-efficient erasure check for fault-tolerant quantum error correction with the surface code. We show that, under physically reasonable assumptions, the threshold error rate is still at least over twice that for Pauli noise.
  arXiv  Detail & Related papers  (2024-08-01T18:00:37Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Demonstrating a superconducting dual-rail cavity qubit with erasure-detected logical measurements [1.8914818474995836]
  We demonstrate a projective logical measurement with integrated erasure detection and use it to measure dual-rail qubit idling errors. We measure logical state preparation and measurement errors at the $0.01%$-level and detect over $99%$ of cavity decay events as erasures. These findings represent the first confirmation of the expected error hierarchy necessary to dual-rail erasure qubits into a highly efficient erasure code.
  arXiv  Detail & Related papers  (2023-07-06T17:52:00Z)
• Construction of Bias-preserving Operations for Pair-cat Code [17.34207569961146]
  Multi-level systems can achieve a desirable set of bias-preserving quantum operations. Cat codes are not compatible with continuous quantum error correction against excitation loss error. We generalize the bias-preserving operations to pair-cat codes to be compatible with continuous quantum error correction against both bosonic loss and dephasing errors.
  arXiv  Detail & Related papers  (2022-08-14T20:45:26Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Experimental demonstration of continuous quantum error correction [0.0]
  We implement a continuous quantum bit-flip correction code in a multi-qubit architecture. We achieve an average bit-flip detection efficiency of up to 91%. Our results showcase resource-efficient stabilizer measurements in a multi-qubit architecture.
  arXiv  Detail & Related papers  (2021-07-23T18:00:55Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.