Juan Pablo Bonilla Ataides

Juan Pablo Bonilla Ataides

Auto-generated profile, based on publicly available information

Juan Pablo Bonilla Ataides

Department of Physics, Harvard University, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
DTDavid K. Tuckett
David K. Tuckett
SBStephen D. Bartlett
Stephen D. Bartlett
SFSteven T. Flammia
Steven T. Flammia
BBBenjamin J. Brown
Benjamin J. Brown
Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes. The challenge is to design practical quantum error-correcting codes that perform well against realistic noise using modest resources. Here we show that a variant of the surface code—the XZZX code—offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel; it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favourable sub-threshold resource scaling that can be obtained by specialising a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.

29 April 2024 in Nature Physics
Verified
Journal Article
Closed access
PDF file
QXQian Xu
Qian Xu
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
CPChristopher A. Pattison
Christopher A. Pattison
NRNithin Raveendran
Nithin Raveendran
DBDolev Bluvstein
Dolev Bluvstein
HZHengyun Zhou
Hengyun Zhou

10 November 2025 in Nature
Verified
Journal Article
Open access
PDF file
DBDolev Bluvstein
Dolev Bluvstein
AGAlexandra A. Geim
Alexandra A. Geim
SLSophie H. Li
Sophie H. Li
SESimon J. Evered
Simon J. Evered
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
MLMikhail D. Lukin
Mikhail D. Lukin
Quantum error correction (QEC) [1,2] is essential for the realization of large-scale quantum computers [3,4]. However, due to the complexity of operating on the encoded ‘logical’ qubits [5,6], understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we utilize reconfigurable arrays of up to 448 neutral atoms to implement the key elements of a universal, fault-tolerant quantum processing architecture and experimentally explore their underlying working mechanisms. We first employ surface codes to study how repeated QEC suppresses errors [6,7], demonstrating 2.14(13)x below-threshold performance in a four-round characterization circuit by leveraging atom loss detection and machine learning decoding [8,9]. We then investigate logical entanglement using transversal gates and lattice surgery [10–12], and extend it to universal logic through transversal teleportation with 3D [[15,1,3]] codes [13,14], enabling arbitrary-angle synthesis with polylogarithmic overhead [5,15]. Finally, we develop mid-circuit qubit re-use [16], increasing experimental cycle rates by two orders of magnitude and enabling deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations [17–20] with [[7,1,3]] and high-rate [[16,6,4]] codes while maintaining constant internal entropy. Our experiments reveal key principles for efficient architecture design, involving the interplay between quantum logic & entropy removal, judiciously using physical entanglement in logic gates & magic state generation, and leveraging teleportations for universality & physical qubit reset. These results establish foundations for scalable, universal error-corrected processing and its practical implementation with neutral atom systems.

11 December 2024 in Physical Review Letters
Verified
Journal Article
Closed access
MCMadelyn Cain
Madelyn Cain
CZChen Zhao
Chen Zhao
HZHengyun Zhou
Hengyun Zhou
NMNadine Meister
Nadine Meister
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
MLMikhail D. Lukin
Mikhail D. Lukin
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates [Bluvstein et al., Nature (London) 626, 58 (2024)NATUAS0028-083610.1038/s41586-023-06927-3], we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Clifford transversal entangling gates, and explore two decoders offering different computational runtimes and accuracies. In particular, by leveraging the deterministic propagation of stabilizer measurement errors, we find that correlated decoding enables the number of noisy syndrome extraction rounds between gates to be reduced from O(d) to O(1) in transversal Clifford circuits, where d is the code distance. We verify numerically that this approach substantially reduces the space-time cost of deep logical Clifford circuits. These results demonstrate that correlated decoding provides a major advantage in early fault-tolerant computation, as realized in recent experiments, and further indicate it has considerable potential to reduce the space-time cost in large-scale logical algorithms.

22 May 2025 in Physical Review X
Verified
Journal Article
Open access
QXQian Xu
Qian Xu
HZHengyun Zhou
Hengyun Zhou
GZGuo Zheng
Guo Zheng
DBDolev Bluvstein
Dolev Bluvstein
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
LJLiang Jiang
Liang Jiang
Quantum error correction is necessary to perform large-scale quantum computation but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical s between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing k -qubit Greenberger-Horne-Zeilinger states and distilling or teleporting k magic states with O ( 1 ) space overhead in O ( 1 ) and O ( k log k ) logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads.

25 September 2025 in Physical Review Letters
Verified
Journal Article
Open access
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
HZHengyun Zhou
Hengyun Zhou
QXQian Xu
Qian Xu
GBGefen Baranes
Gefen Baranes
BLBikun Li
Bikun Li
LJLiang Jiang
Liang Jiang
We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a constant distillation rate equal to the code rate while requiring no additional overhead beyond the physical qubits of the code. Full circuit-level analysis demonstrates fault-tolerance for input Bell-pair infidelities below a threshold ∼ 10 % , readily achievable with near-term capabilities. Unlike previous proposals, our scheme keeps the output Bell pairs encoded in qLDPC codes at each node, eliminating unencoding overhead and enabling direct use in distributed quantum applications through recent advances in qLDPC computation. These results establish qLDPC-based distillation as a practical route toward resource-efficient quantum networks and distributed quantum computing.