Logical computation demonstrated with a neutral atom quantum processor

• URL: http://arxiv.org/abs/2411.11822v2
• Date: Tue, 19 Nov 2024 18:55:32 GMT
• Title: Logical computation demonstrated with a neutral atom quantum processor
• Authors: Ben W. Reichardt, Adam Paetznick, David Aasen, Ivan Basov, Juan M. Bello-Rivas, Parsa Bonderson, Rui Chao, Wim van Dam, Matthew B. Hastings, Andres Paz, Marcus P. da Silva, Aarthi Sundaram, Krysta M. Svore, Alexander Vaschillo, Zhenghan Wang, Matt Zanner, William B. Cairncross, Cheng-An Chen, Daniel Crow, Hyosub Kim, Jonathan M. Kindem, Jonathan King, Michael McDonald, Matthew A. Norcia, Albert Ryou, Mark Stone, Laura Wadleigh, Katrina Barnes, Peter Battaglino, Thomas C. Bohdanowicz, Graham Booth, Andrew Brown, Mark O. Brown, Kayleigh Cassella, Robin Coxe, Jeffrey M. Epstein, Max Feldkamp, Christopher Griger, Eli Halperin, Andre Heinz, Frederic Hummel, Matthew Jaffe, Antonia M. W. Jones, Eliot Kapit, Krish Kotru, Joseph Lauigan, Ming Li, Jan Marjanovic, Eli Megidish, Matthew Meredith, Ryan Morshead, Juan A. Muniz, Sandeep Narayanaswami, Ciro Nishiguchi, Timothy Paule, Kelly A. Pawlak, Kristen L. Pudenz, David Rodríguez Pérez, Jon Simon, Aaron Smull, Daniel Stack, Miroslav Urbanek, René J. M. van de Veerdonk, Zachary Vendeiro, Robert T. Weverka, Thomas Wilkason, Tsung-Yao Wu, Xin Xie, Evan Zalys-Geller, Xiaogang Zhang, Benjamin J. Bloom,
• Abstract summary: We show the entanglement of 24 logical qubits using the distance-two code, simultaneously detecting errors and correcting for lost qubits. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded in the [[4,1,2]] code, showing better-than-physical error rates. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.
• Score: 26.395934835344015
• License:
• Abstract: Transitioning from quantum computation on physical qubits to quantum computation on encoded, logical qubits can improve the error rate of operations, and will be essential for realizing valuable quantum computational advantages. Using a neutral atom quantum processor with 256 qubits, each an individual Ytterbium atom, we demonstrate the entanglement of 24 logical qubits using the distance-two [[4,2,2]] code, simultaneously detecting errors and correcting for lost qubits. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded in the [[4,1,2]] code, showing better-than-physical error rates. We demonstrate fault-tolerant quantum computation in our approach, guided by the proposal of Gottesman (2016), by performing repeated loss correction for both structured and random circuits encoded in the [[4,2,2]] code. Finally, since distance-two codes can correct qubit loss, but not other errors, we show repeated loss and error correction using the distance-three [[9,1,3]] Bacon-Shor code. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.

Related papers

• Demonstration of quantum computation and error correction with a tesseract code [2.5843915259402834]
  The tesseract subsystem color code protects four logical qubits in 16 physical qubits, to distance four. We prepare high-fidelity encoded graph states on up to 12 logical qubits, beneficially combining for the first time fault-tolerant error correction and computation.
  arXiv  Detail & Related papers  (2024-09-06T21:36:49Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Entangling four logical qubits beyond break-even in a nonlocal code [0.0]
  Quantum error correction protects logical quantum information against environmental decoherence. We encode the GHZ state in four logical qubits with fidelity $ 99.5 pm 0.15 % le F le 99.7 pm 0.1% $ (after postselecting on over 98% of outcomes) Our results are a first step towards realizing fault-tolerant quantum computation with logical qubits encoded in geometrically nonlocal quantum low-density parity check codes.
  arXiv  Detail & Related papers  (2024-06-04T18:00:00Z)
• Logical quantum processor based on reconfigurable atom arrays [27.489364850707926]
  We report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Results herald the advent of early error-corrected quantum computation.
  arXiv  Detail & Related papers  (2023-12-07T01:54:45Z)
• Optimal Qubit Reuse for Near-Term Quantum Computers [0.18188255328029254]
  Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse. We introduce a formal model for qubit reuse optimization that delivers provably optimal solutions. We show improvements in the number of qubits and swap gate insertions, estimated success probability, and Hellinger fidelity of the investigated quantum circuits.
  arXiv  Detail & Related papers  (2023-07-31T23:15:45Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
  We report the measurement of logical qubit performance scaling across multiple code sizes. Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
  arXiv  Detail & Related papers  (2022-07-13T18:00:02Z)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• 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)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.