arXiv subjects

Soonwon Choi

Publications and source records attributed to Soonwon Choi.

At least 19 recordsLinked to original sources

arXiv2026

Quantum thermalization achieves optimal approximate quantum error correction

Quantum thermalization explains how an isolated many-body system naturally evolves towards a thermal state, rendering information about the initial conditions inaccessible to local measurements. This is precisely the mechanism utilized in quantum error correction, where information is protected by design through a nonlocal encoding. In this work, we leverage this connection to port the rigorous framework of (approximate) quantum error correction to the study of quantum thermalization. Treating typical late-time states as codewords, we characterize the error-correcting properties of generic thermalizing dynamics. We numerically uncover a universal relationship between the encoding rate, distance, and thermal entropy density of the emergent code. At infinite temperature, this universal curve saturates the quantum Singleton bound, achieving the same optimal limit as Haar-random codes. At finite temperature, we introduce a code family based on the Scrooge ensemble, the natural thermal analogue of the Haar ensemble, and prove it saturates the entropic quantum Singleton bound, establishing this family as optimal within entropic constraints. Our extracted universal curve independently saturates this same bound, revealing that finite-temperature thermalization is itself optimal. Finally, we show how conserved quantities limit the error-correcting behavior of thermalization: codewords with differing energies, or other conserved charges, leak only classical information, and correctability persists until the difference reaches the scale of thermal fluctuations. Our results reveal a universal optimal coding structure in thermalizing dynamics, while introducing new optimal codes that achieve fundamental limits of approximate quantum error correction.

quant-ph↗

arXiv2026

Robust Hamiltonian engineering with subensemble control

We present a robust protocol to reshape interactions in a spin ensemble based on global control pulse sequences applied to multiple subensembles in parallel. This setting arises naturally from ensembles of solid-state defects or multi-species atomic arrays. We show that it is provably computationally hard to find pulse sequences that simultaneously engineer interactions both within and between subensembles. Despite its formal hardness, we identify a set of necessary or sufficient conditions under which one can synthesize a target Hamiltonian from the native one. Moreover, we introduce efficient numerical strategies for designing pulse sequences that engineer target Hamiltonians robust against common control imperfections. As a specific application, we discuss the robust generation of two-mode spin squeezing in dual-species atomic ensembles, which is a challenging task without subensemble control. Our results provide a practical toolbox to design novel quantum simulation and sensing experiments with minimal control overhead.

quant-ph↗

arXiv2026

Strategic Plan for Neutral Atom Quantum Computation

We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements to achieve the goal of practical quantum advantage. The concept of practical quantum advantage is defined, along with how to verify claims of advantage, and approaches to designing quantum algorithms that deliver practical advantage. Future directions for neutral atom quantum processor hardware are described: scaling-up system size, Qubit encodings and atomic platforms, going further below threshold with neutral-atom logical-qubit performance, continuous reloading of qubits, and fast readout. We also explore opportunities for scalable integrated photonic control technologies. Alongside hardware advancements, new developments in quantum error correction and compilation of quantum circuits are proposed. Finally, we examine the opportunity of networking multiple neutral atom quantum processors together to perform distributed quantum computing and overcome possible limitations of a single system.

quant-ph↗

arXiv2026

Digital dissipative state preparation for frustration-free gapless quantum systems

Preparing algebraically correlated ground states of quantum many-body systems is an important, yet challenging task for quantum simulation. We introduce a protocol that employs local projective measurements and unitary feedback for frustration-free gapless systems. Our approach prepares a priori unknown ground states in time that scales polynomially with system size. We analytically show the performance our protocol for the dynamics of a single-particle; we argue the same mechanism generalizes to many-body systems based on the physics of quasiparticles. Our theory predicts that a transient cooling dynamics directly reveals the system's universal critical properties. In particular, the state preparation time is linear in the inverse of the finite-size gap (up to log correction) when the system's dynamical critical exponent is larger or equal the effective spatial dimension explored by the quasiparticles. We verify these predictions in numerical simulations of ferromagnetic Heisenberg models in one- and two dimensions, a Fredkin spin chain, and a two-dimensional model of resonating valence bond states. Our protocol stabilizes gapless many-body ground states fully digitally without requiring analog rotations, enabling access to high-fidelity states beyond conventional adiabatic approaches in near-term experiments.

quant-ph↗

arXiv2026

Unified Probe of Quantum Chaos and Ergodicity from Hamiltonian Learning

Developing measures of quantum ergodicity and chaos stands as a foundational task in the study of quantum many-body systems. In this work, we propose metrics for these effects based on Hamiltonian learning that unify multiple advantages of existing metrics. In particular, we show how ergodicity and chaos improve the robustness of Hamiltonian learning to small errors and furthermore demonstrate that this robustness can be used as a metric for such phenomena. We analytically and numerically show that our metrics not only distinguish between integrable and ergodic regimes in various spin chains but also quantify chaos and ergodicity, allowing us to locate regions of parameter space displaying maximal ergodicity and maximal sensitivity to local perturbations. Our approach not only provides conceptual ways to study quantum chaos and ergodicity but also presents viable experimental methods for quantum simulators.

quant-ph↗

arXiv2026

Entanglement in quantum spin chains is strictly finite at any temperature

Entanglement is the hallmark of quantum physics, yet its characterization in interacting many-body systems at thermal equilibrium remains one of the most important challenges in quantum statistical physics. We prove that the Gibbs state of any quantum spin chain can be exactly decomposed into a mixture of matrix product states with a bond dimension that is independent of the system size, at any finite temperature. As a consequence, the Schmidt number, arguably the most stringent measure of bipartite entanglement, is strictly finite for thermal states, even in the thermodynamic limit. Our decomposition is explicit and is accompanied by an efficient classical algorithm to sample the resulting matrix product states.

quant-ph↗

arXiv2026

Robust multiparameter estimation using quantum scrambling

We propose and analyze a versatile and efficient multiparameter quantum sensing protocol, which simultaneously estimates many non-commuting and time-dependent signals that are coherently or incoherently coupled to sensing particles. Even in the presence of control imperfections and readout errors, our approach can detect exponentially many parameters in the system size while maintaining the optimal scaling of sensitivity. To accomplish this, scrambling dynamics are leveraged to map distinct signals to unique patterns of bitstring measurements, which distinguishes a large number of signals without significant sensitivity loss. Based on this principle, we develop a computationally efficient protocol utilizing random global Clifford unitaries and evaluate its performance both analytically and numerically. Our protocol naturally extends to scrambling dynamics generated by random local Clifford circuits, local random unitary circuits (RUCs), and ergodic Hamiltonian evolution--commonly realized in near-term quantum hardware--and opens the door to applications ranging from precise noise benchmarking of quantum dynamics to learning time-dependent Hamiltonians.

quant-ph↗

arXiv2026

Controlling Rydberg atom-polariton interactions: from exceptional points to fast readout

Rydberg atoms represent a platform underpinning many recent developments in quantum computation, simulation, sensing, and metrology. They further facilitate optical nonlinearity at the single-photon level when coupled to photons propagating in atomic clouds, which form collective atomic excitations called Rydberg polaritons, strongly interacting with each other. Here, we experimentally explore interactions between a Rydberg polariton in an atomic ensemble and a single, adjacent, Rydberg atom. We discover three different regimes of quantum dynamics corresponding to polariton blockade, coherent exchange, and probabilistic hopping, which are defined by their distinct transmission characteristics, with a transition through an exceptional point occurring between blockade and coherent exchange. We investigate the applications of such interactions for fast, non-destructive detection of Rydberg atoms and present proof-of-principle demonstrations for their potential application in nonlinear photonic networks.

physics.atom-ph↗

arXiv2026

Rare-Event Quantum Sensing using Logical Qubits

We present a novel protocol to detect rare signals in a noisy environment using quantum error correction (QEC). The key feature of our protocol is the discrimination between signal and noise through distinct higher-order correlations, realized by the non-linear processing that occurs during syndrome extraction in QEC. In this scheme, QEC has two effects: First, it sacrifices part of the signal $\epsilon$ by recording a reduced, stochastic, logical phase $\phi_L = \mathcal{O}(\epsilon^3)$. Second, it corrects the physical noise and extends the (logical) coherence time for signal acquisition. For rare signals occurring at random times in the presence of local Markovian noise, we explicitly demonstrate an improved sensitivity of our approach over more conventional sensing strategies.

quant-ph↗

arXiv2025

Observation of ballistic plasma and memory in high-energy gauge theory dynamics

Gauge theories describe the fundamental forces of nature. However, high-energy dynamics, such as the formation of quark-gluon plasmas, is notoriously difficult to model with classical methods. Quantum simulation offers a promising alternative in this regime, yet experiments have mainly probed low energies. Here, we observe the formation of a ballistic plasma and long-time memory effects in high-energy gauge theory dynamics on a high-precision quantum simulator. Both observations are unexpected, as the initial state - fully filled with particle-antiparticle pairs - was thought to rapidly thermalize. Instead, we find correlations spreading ballistically to long distances and a memory of charge clusters. Our observations cannot be explained by many-body scars, but are captured by a new theory of plasma oscillations between electric field and current operators, persisting all the way to the continuum limit of the (1+1)D Schwinger model, of which we simulate a lattice version. Adapting techniques from quantum optics, we visualize plasma oscillations as rotations of Wigner distributions, leading to a novel set of predictions which we test in experiment and numerics. The new framework encompasses both our scenario and scars, which show up as coherent states of the plasma. The experimental surprises we observe in the high-energy dynamics of a simple gauge theory point to the potential of high-precision quantum simulations of gauge theories for general scientific discovery.

quant-ph↗

arXiv2025

How much can we learn from quantum random circuit sampling?

Benchmarking quantum devices is a foundational task for the sustained development of quantum technologies. However, accurate in situ characterization of large-scale quantum devices remains a formidable challenge: such systems experience many different sources of errors, and cannot be simulated on classical computers. Here, we introduce new benchmarking methods based on random circuit sampling (RCS), that substantially extend the scope of conventional approaches. Unlike existing benchmarks that report only a single quantity--the circuit fidelity--our framework extracts rich diagnostic information, including spatiotemporal error profiles, correlated and contextual errors, and biased readout errors, without requiring any modifications of the experiment. Furthermore, we develop techniques that achieve this task without classically intractable simulations of the quantum circuit, by leveraging side information, in the form of bitstring samples obtained from reference quantum devices. Our approach is based on advanced high-dimensional statistical modeling of RCS data. We sharply characterize the information-theoretic limits of error estimation, deriving matching upper and lower bounds on the sample complexity across all regimes of side information. We identify surprising phase transitions in learnability as the amount of side information varies. We demonstrate our methods using publicly available RCS data from a state-of-the-art superconducting processor, obtaining in situ characterizations that are qualitatively consistent yet quantitatively distinct from component-level calibrations. Our results establish both practical benchmarking protocols for current and future quantum computers and fundamental information-theoretic limits on how much can be learned from RCS data.

quant-ph↗

arXiv2025

Measuring gravitational lensing time delays with quantum information processing

The gravitational fields of astrophysical bodies bend the light around them, creating multiple paths along which light from a distant source can arrive at Earth. Measuring the difference in photon arrival time along these different paths provides a means of determining the mass of the lensing system, which is otherwise difficult to constrain. This is particularly challenging in the case of microlensing, where the images produced by lensing cannot be individually resolved; existing proposals for detecting time delays in microlensed systems are significantly constrained due to the need for large photon flux and the loss of signal coherence when the angular diameter of the light source becomes too large. In this work, we propose a novel approach to measuring astrophysical time delays. Our method uses exponentially fewer photons than previous schemes, enabling observations that would otherwise be impossible. Our approach, which combines a quantum-inspired algorithm and quantum information processing technologies, saturates a provable lower bound on the number of photons required to find the time delay. Our scheme has multiple applications: we explore its use both in calibrating optical interferometric telescopes and in making direct mass measurements of ongoing microlensing events. To demonstrate the latter, we present a fiducial example of microlensed stellar flares sources in the Galactic Bulge. Though the number of photons produced by such events is small, we show that our photon-efficient scheme opens the possibility of directly measuring microlensing time delays using existing and near-future ground-based telescopes.

quant-ph↗

arXiv2025

The vast world of quantum advantage

The quest to identify quantum advantages lies at the heart of quantum technology. While quantum devices promise extraordinary capabilities, from exponential computational speedups to unprecedented measurement precision, distinguishing genuine advantages from mere illusions remains a formidable challenge. In this endeavor, quantum theorists are like prophets attempting to foretell the future, yet the boundary between visionary insight and unfounded fantasy is perilously thin. In this perspective, we examine our mathematical tools for navigating the vast world of quantum advantages across computation, learning, sensing, and communication. We explore five keystone properties: predictability, typicality, robustness, verifiability, and usefulness that define an ideal quantum advantage, and envision what new quantum advantages could arise in a future with ubiquitous quantum technology. We prove that some quantum advantages are inherently unpredictable using classical resources alone, suggesting a landscape far richer than what we can currently foresee. While mathematical rigor remains our indispensable guide, the ultimate power of quantum technologies may emerge from advantages we cannot yet conceive.

quant-ph↗

arXiv2025

Fast computational deep thermalization

Deep thermalization refers to the emergence of Haar-like randomness from quantum systems upon partial measurements. As a generalization of quantum thermalization, it is often associated with high complexity and entanglement. Here, we introduce computational deep thermalization and construct the fastest possible dynamics exhibiting it at infinite effective temperature. Our circuit dynamics produce quantum states with low entanglement in polylogarithmic depth that are indistinguishable from Haar random states to any computationally bounded observer. Importantly, the observer is allowed to request many copies of the same residual state obtained from partial projective measurements on the state -- this condition is beyond the standard settings of quantum pseudorandomness, but natural for deep thermalization. In cryptographic terms, these states are pseudorandom, pseudoentangled, and crucially, retain these properties under local measurements. Our results demonstrate a new form of computational thermalization, where thermal-like behavior arises from structured quantum states endowed with cryptographic properties, instead of from highly unstructured ensembles. The low resource complexity of preparing these states suggests scalable simulations of deep thermalization using quantum computers. Our work also motivates the study of computational quantum pseudorandomness beyond BQP observers.

quant-ph↗

arXiv2025

2D Quon Language: Unifying Framework for Cliffords, Matchgates, and Beyond

Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- permit efficient computation. They provide invaluable tools for studying many-body physics, quantum chemistry, and quantum computation. While both play foundational roles across multiple disciplines, the origins of their tractability seem disparate, and their relationship remain unclear. A deeper understanding of such tractable classes could expand their scope and enable a wide range of new applications. In this work, we make progress toward the unified understanding of the Clifford and matchgate -- these two classes are, in fact, distinct special cases of a single underlying structure. Specifically, we introduce the 2D Quon language, which combines Majorana worldlines with their underlying spacetime topology to diagrammatically represent quantum processes and tensor networks. In full generality, the 2D Quon language is universal -- capable of representing arbitrary quantum states, dynamics, or tensor networks -- yet they become especially powerful in describing Clifford and matchgate classes. Each class can be efficiently characterized in a visually recognizable manner using the Quon framework. This capability naturally gives rise to several families of efficiently computable tensor networks introduced in this work: punctured matchgates, hybrid Clifford-matchgate-MPS, and ansatze generated from factories of tractable networks. All of these exhibit high non-Cliffordness, high non-matchgateness, and large bipartite entanglement entropy. We discuss a range of applications of our approach, from recovering well-known results such as the Kramers-Wannier duality and the star-triangle relation of the Ising model, to enabling variational optimization with novel ansatz states.

quant-ph↗

arXiv2025

Critically Slow Hilbert-Space Ergodicity in Quantum Morphic Drives

The maximum entropy principle is foundational for statistical analyses of complex dynamics. This principle has been challenged by the findings of a previous work [arXiv:1701.07596], where it was argued that a quantum system driven in time by a certain aperiodic sequence without any explicit symmetries, dubbed the Thue-Morse drive, gives rise to emergent nonergodic steady states which are underpinned by effective conserved quantities. Here, we resolve this apparent tension. We rigorously prove that the Thue-Morse drive achieves a very strong notion of quantum ergodicity in the long-time limit: The time evolution of any initial state uniformly visits every corner of its Hilbert space. On the other hand, we find the dynamics also approximates a Floquet drive for arbitrarily long albeit finite periods of time with no characteristic timescale, resulting in a scale-free ergodic dynamics we call critically slow complete Hilbert-space ergodicity. Furthermore, numerical studies reveal that critically slow complete Hilbert-space ergodicity is not specific to the Thue-Morse drive and is, in fact, exhibited by many other aperiodic drives derived from morphic sequences, i.e., words derived from repeatedly applying substitution rules on basic characters. Our work presents a new class of dynamics in time-dependent quantum systems where full ergodicity is eventually attained, but only after astronomically long times.

quant-ph↗

arXiv2025

Quantum Computing Enhanced Sensing

Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak oscillating fields with unknown strength and frequency. We present a quantum computing enhanced sensing protocol that outperforms all existing approaches. Furthermore, we prove our approach is optimal by establishing the Grover-Heisenberg limit -- a fundamental lower bound on the minimum sensing time. The key idea is to robustly digitize the continuous, analog signal into a discrete operation, which is then integrated into a quantum algorithm. Our metrological gain originates from quantum computation, distinguishing our protocol from conventional sensing approaches. Indeed, we prove that broad classes of protocols based on quantum Fisher information, finite-lifetime quantum memory, or classical signal processing are strictly less powerful. Our protocol is compatible with multiple experimental platforms. We propose and analyze a proof-of-principle experiment using nitrogen-vacancy centers, where meaningful improvements are achievable using current technology. This work establishes quantum computation as a powerful new resource for advancing sensing capabilities.

quant-ph↗

arXiv2024

Efficiently measuring $d$-wave pairing and beyond in quantum gas microscopes

Understanding the mechanism of high-temperature superconductivity is among the most important problems in physics, for which quantum simulation can provide new insights. However, it remains challenging to characterize superconductivity in existing cold-atom quantum simulation platforms. Here, we introduce a protocol for measuring a broad class of observables in fermionic quantum gas microscopes, including long-range superconducting pairing correlations (after a repulsive-to-attractive mapping). The protocol only requires global controls followed by site-resolved particle number measurements -- capabilities that have been already demonstrated in multiple experiments -- and is designed by analyzing the Hilbert-space structure of dimers of two sites. The protocol is sample efficient and we further optimize our pulses for robustness to experimental imperfections such as lattice inhomogeneity. Our work introduces a general tool for manipulating quantum states on optical lattices, enhancing their ability to tackle problems such as that of high-temperature superconductivity.

cond-mat.quant-gas↗