Repeated Ancilla Reuse for Logical Computation on a Neutral Atom Quantum Computer

Quantum processors based on neutral atoms trapped in arrays of optical tweezers have appealing properties, including relatively easy qubit number scaling and the ability to engineer arbitrary gate connectivity with atom movement. However, these platforms are inherently prone to atom loss, and the ability to replace lost atoms during a quantum computation is an important but previously elusive capability. Here, we demonstrate the ability to measure and reinitialize, and if necessary replace, a subset of atoms while maintaining coherence in other atoms. This allows us to perform logical circuits that include single- and two-qubit gates as well as repeated midcircuit measurement while compensating for atom loss. We highlight this capability by performing up to 41 rounds of syndrome extraction in a repetition code, and combine midcircuit measurement and atom replacement with real-time conditional branching to demonstrate heralded state preparation of a logically encoded Bell state. Finally, we demonstrate the ability to replenish atoms in a tweezer array from an atomic beam while maintaining coherence of existing atoms—a key step toward execution of logical computations that last longer than the lifetime of an atom in the system.

Authors

Institutions

Publication Details

Journal
Physical Review X
Published
2025-10-16
DOI
https://doi.org/10.1103/v7ny-fg31
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
7.44
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Repeated Ancilla Reuse for Logical Computation on a Neutral Atom Quantum Computer

M. Sorensen, Juan M. Bello‐Rivas, Kristen L. Pudenz, E. Megidish et al.
3 citations
Physical Review X
Quantum Computing Algorithms and Architecture
7.44
article

Repeated Ancilla Reuse for Logical Computation on a Neutral Atom Quantum Computer

M. Sorensen, Juan M. Bello‐Rivas, Kristen L. Pudenz, E. Megidish, Daniel Crow, Kayleigh Cassella, Mark O. Brown, Genevieve Booth, A. Heinz, David Rodríguez Pérez, Jonathan P. King, Xin Xie, S. Narayanaswami, K. White, Jonathan M. Kindem, Miroslav Urbánek, Hyosub Kim, Frederic Hummel, Kelly Ann Pawlak, Laura Wadleigh, Lavanya Taneja, E. Zalys-Geller, C. Nishiguchi, Zachary Vendeiro, Thomas C. Bohdanowicz, William B. Cairncross, Parth Sabharwal, Edward C. Halperin, Mickey McDonald, M. Meredith, Benjamin Bloom, X. Zhang, I. Bloomfield, Youssef S. Hassan, Yan Ji, Glenn Cowan, Jonathan Simon, D. T. Stack, Matthew A. Norcia, M. B. Stone, Rosaleen Morshead, Juan A. Muniz, David Aasen, M. Feldkamp, Robert T. Weverka, Thomas Wilkason, Krish Kotru, J. Lauigan, Tsung-Yao Wu, Albert Ryou, J. Epstein, Eliot Kapit, C. Griger, A. Smull, A. M. W. Jones, Alexander L. Brown, Chi‐An Chen, R. J. M. van de Veerdonk, M. Jaffé, Katrina Barnes, J. Marjanovic, T. Hofler
article en
3 citations

Abstract

Quantum processors based on neutral atoms trapped in arrays of optical tweezers have appealing properties, including relatively easy qubit number scaling and the ability to engineer arbitrary gate connectivity with atom movement. However, these platforms are inherently prone to atom loss, and the ability to replace lost atoms during a quantum computation is an important but previously elusive capability. Here, we demonstrate the ability to measure and reinitialize, and if necessary replace, a subset of atoms while maintaining coherence in other atoms. This allows us to perform logical circuits that include single- and two-qubit gates as well as repeated midcircuit measurement while compensating for atom loss. We highlight this capability by performing up to 41 rounds of syndrome extraction in a repetition code, and combine midcircuit measurement and atom replacement with real-time conditional branching to demonstrate heralded state preparation of a logically encoded Bell state. Finally, we demonstrate the ability to replenish atoms in a tweezer array from an atomic beam while maintaining coherence of existing atoms—a key step toward execution of logical computations that last longer than the lifetime of an atom in the system.

Physical Review XVol. 15(4)
Microsoft (United States) (US), Colorado School of Mines (US), Microsoft (Norway) (NO), Atom Computing (United States) (US), Stanford University (US)
Openalex Percentile: Top 3%
Quantum Computing Algorithms and Architecture
7.44
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.