Andi Gu

Andi Gu

Auto-generated profile, based on publicly available information

Andi Gu

Harvard University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
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.

26 March 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
HHHong-Ye Hu
Hong-Ye Hu
AGAndi Gu
Andi Gu
SMSwarnadeep Majumder
Swarnadeep Majumder
HRHang Ren
Hang Ren
YZYipei Zhang
Yipei Zhang
ASAlireza Seif
Alireza Seif
Extracting information efficiently from quantum systems is crucial for quantum information processing. Classical shadows enable predicting many properties of arbitrary quantum states using few measurements. While random single-qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Introducing a shallow random quantum circuit before measurements improves sample efficiency for high-weight Pauli observables and low-rank properties. However, in practice, these circuits can be noisy and bias the measurement results. Here, we propose the robust shallow shadows, which employs Bayesian inference to learn and mitigate noise in postprocessing. We analyze noise effects on sample complexity and the optimal circuit depth. We provide theoretical guarantees for the success of error mitigation under a wide class of noise processes. Experimental validation on a superconducting quantum processor confirms the advantage of our method, even in the presence of realistic noise, over single-qubit measurements for predicting diverse state properties, such as fidelity and entanglement entropy. Our protocol thus offers a scalable, robust, and sample-efficient method for quantum state characterization on near-term quantum devices.

8 January 2024 in Nature Communications
Verified
Journal Article
Open access
PDF file
AGAndi Gu
Andi Gu
LCLukasz Cincio
Lukasz Cincio
PCPatrick J. Coles
Patrick J. Coles
We study the problem of learning the parameters for the Hamiltonian of a quantum many-body system, given limited access to the system. In this work, we build upon recent approaches to Hamiltonian learning via derivative estimation. We propose a protocol that improves the scaling dependence of prior works, particularly with respect to parameters relating to the structure of the Hamiltonian (e.g., its locality k). Furthermore, by deriving exact bounds on the performance of our protocol, we are able to provide a precise numerical prescription for theoretically optimal settings of hyperparameters in our learning protocol, such as the maximum evolution time (when learning with unitary dynamics) or minimum temperature (when learning with Gibbs states). Thanks to these improvements, our protocol has practical scaling for large problems: we demonstrate this with a numerical simulation of our protocol on an 80-qubit system.

5 May 2025 in PRX Quantum
Verified
Journal Article
Open access
AGAndi Gu
Andi Gu
SOSalvatore Francesco Emanuele Oliviero
Salvatore Francesco Emanuele Oliviero
LLLorenzo Leone
Lorenzo Leone
Entanglement serves as a foundational pillar in quantum information theory, delineating the boundary between what is classical and what is quantum. The common assumption is that a higher degree of entanglement corresponds to a greater degree of “quantumness.” However, this folk belief is challenged by the fact that classically simulable operations, such as Clifford circuits, can create highly entangled states. The simulability of these states raises the question: What are the differences between “low-magic” entanglement and “high-magic” entanglement? To understand this interplay between entanglement and magic, we take an operational approach by studying tasks such as entanglement estimation, distillation, and dilution. We uncover a separation of Hilbert space into two distinct regimes: the entanglement-dominated (ED) phase, where entanglement surpasses magic, and the magic-dominated (MD) phase, where magic dominates entanglement. This separation induces a computational phase transition: entanglement-related tasks are efficiently solvable in the ED phase, but become intractable in the MD phase. Our results find applications in diverse areas such as quantum error correction, many-body physics, and the study of quantum chaos, providing a unifying framework for understanding the behavior of quantum systems. We also offer theoretical explanations for previous numerical observations, highlighting the broad implications of the ED-MD distinction across various subfields of physics. Published by the American Physical Society 2025

24 May 2024 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
AGAndi Gu
Andi Gu
LLLorenzo Leone
Lorenzo Leone
SGSoumik Ghosh
Soumik Ghosh
JEJens Eisert
Jens Eisert
SYSusanne F. Yelin
Susanne F. Yelin
YQYihui Quek
Yihui Quek
Notions of nonstabilizerness, or “magic,” quantify how nonclassical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce “pseudomagic” ensembles of quantum states that, despite low nonstabilizerness, are computationally indistinguishable from those with high nonstabilizerness. Previously, such computational indistinguishability has been studied with respect to entanglement, introducing the concept of pseudoentanglement. However, we demonstrate that pseudomagic neither follows from pseudoentanglement nor implies it. In terms of applications, the study of pseudomagic offers fresh insights into the theory of quantum scrambling: it uncovers states that, even though they originate from nonscrambling unitaries, remain indistinguishable from scrambled states to any physical observer. Additional applications include new lower bounds on state synthesis problems, property testing protocols, and implications for quantum cryptography. Our Letter is driven by the observation that only quantities measurable by a computationally bounded observer—intrinsically limited by finite-time computational constraints—hold physical significance. Ultimately, our findings suggest that nonstabilizerness is a “hide-able” characteristic of quantum states: some states are much more magical than is apparent to a computationally bounded observer.

1 August 2022 in The Astrophysical Journal
Verified
Journal Article
Open access
AGA. Gu
A. Gu
XHX. Huang
X. Huang
WSW. Sheu
W. Sheu
GAG. Aldering
G. Aldering
ABA. S. Bolton
A. S. Bolton
SSS. H. Suyu
S. H. Suyu
We present GIGA-Lens: a gradient-informed, GPU-accelerated Bayesian framework for modeling strong gravitational lensing systems, implemented in TensorFlow and JAX. The three components, optimization using multistart gradient descent, posterior covariance estimation with variational inference, and sampling via Hamiltonian Monte Carlo, all take advantage of gradient information through automatic differentiation and massive parallelization on graphics processing units (GPUs). We test our pipeline on a large set of simulated systems and demonstrate in detail its high level of performance. The average time to model a single system on four Nvidia A100 GPUs is 105 s. The robustness, speed, and scalability offered by this framework make it possible to model the large number of strong lenses found in current surveys and present a very promising prospect for the modeling of ( 10 5 ) lensing systems expected to be discovered in the era of the Vera C. Rubin Observatory, Euclid, and the Nancy Grace Roman Space Telescope.