arXiv subjects

Andrew Y. Guo

Publications and source records attributed to Andrew Y. Guo.

13 recordsLinked to original sources

arXiv2026

Computing with many encoded logical qubits beyond break-even

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers. Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\, k,\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\, k_2k_1,\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor. Utilizing new gadgets for encoded operations, we realize this "beyond break-even" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between $48$ and $94$ logical qubits. These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional $XY$ model of quantum magnetism. Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation. Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.

quant-ph↗

arXiv2025

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate "bottleneck" region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions $L, R$ with $N_L, N_R$ qubits, respectively, coupled only through an intermediate region $C$ with $N_C$ qubits, for any $δ> 0$ we show a lower bound of $Ω(N_R^{1-δ}/\sqrt{N_L}N_C)$ on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between $L$ and $C,R$ that can be generated in time $t$ by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from $O(N_L t)$ to $O(\sqrt{N_L} t)$. As a special case, when applied to the star graph (i.e., one vertex connected to $N$ leaves), we obtain an $Ω(\sqrt{N^{1-δ}})$ lower bound on the routing time and on the time to prepare $N/2$ Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time $Θ(\sqrt{N})$ using Hamiltonian quantum routing, obtaining a speed-up over gate-based routing, which takes time $Θ(N)$.

quant-ph↗

arXiv2024

Experimental roadmap for optimal state transfer and entanglement generation in power-law systems

Experimental systems with power-law interactions have recently garnered interest as promising platforms for quantum information processing. Such systems are capable of spreading entanglement superballistically and achieving an asymptotic speed-up over locally interacting systems. Recently, protocols developed by Eldredge et al. [Phys. Rev. Lett. 119, 170503 (2017)] and Tran et al. [Phys. Rev. X 11, 031016 (2021)] for the task of transferring a quantum state between distant particles quickly were shown to be optimal and saturate theoretical bounds. However, the implementation of these protocols in physical systems with long-range interactions remains to be fully realized. In this work, we provide an experimental roadmap towards realizing fast state-transfer protocols in three classes of atomic and molecular systems with dipolar interactions: polar molecules composed of alkali-metal dimers, neutral atoms in excited Rydberg states, and atoms with strong magnetic moments (e.g. dysprosium). As a guide to near-term experimental implementation, we numerically evaluate the tradeoffs between the two protocols for small system sizes and develop methods to address potential crosstalk errors that may arise during the execution of the protocols.

quant-ph↗

arXiv2022

Disordered Lieb-Robinson bounds in one dimension

By tightening the conventional Lieb-Robinson bounds to better handle systems which lack translation invariance, we determine the extent to which "weak links" suppress operator growth in disordered one-dimensional spin chains. In particular, we prove that ballistic growth is impossible when the distribution of coupling strengths $μ(J)$ has a sufficiently heavy tail at small $J$, and identify the correct dynamical exponent to use instead. Furthermore, through a detailed analysis of the special case in which the couplings are genuinely random and independent, we find that the standard formulation of Lieb-Robinson bounds is insufficient to capture the complexity of the dynamics -- we must distinguish between bounds which hold for all sites of the chain and bounds which hold for a subsequence of sites, and we show by explicit example that these two can have dramatically different behaviors. All the same, our result for the dynamical exponent is tight, in that we prove by counterexample that there cannot exist any Lieb-Robinson bound with a smaller exponent. We close by discussing the implications of our results, both major and minor, for numerous applications ranging from quench dynamics to the structure of ground states.

cond-mat.dis-nn↗

arXiv2022

Hydrodynamic theory of scrambling in chaotic long-range interacting systems

The Fisher-Kolmogorov-Petrovsky-Piskunov (FKPP) equation provides a mean-field theory of out-of-time-ordered commutators in locally interacting quantum chaotic systems at high energy density; in the systems with power-law interactions, the corresponding fractional-derivative FKPP equation provides an analogous mean-field theory. However, the fractional FKPP description is potentially subject to strong quantum fluctuation effects, so it is not clear a priori if it provides a suitable effective description for generic chaotic systems with power-law interactions. Here we study this problem using a model of coupled quantum dots with interactions decaying as $\frac{1}{r^α}$, where each dot hosts $N$ degrees of freedom. The large $N$ limit corresponds to the mean-field description, while quantum fluctuations contributing to the OTOC can be modeled by $\frac{1}{N}$ corrections consisting of a cutoff function and noise. Within this framework, we show that the parameters of the effective theory can be chosen to reproduce the butterfly light cone scalings that we previously found for $N=1$ and generic finite $N$. In order to reproduce these scalings, the fractional index $μ$ in the FKPP equation needs to be shifted from the naïve value of $μ= 2α- 1$ to a renormalized value $μ= 2α- 2$. We provide supporting analytic evidence for the cutoff model and numerical confirmation for the full fractional FKPP equation with cutoff and noise.

cond-mat.stat-mech↗

arXiv2022

Hierarchy of linear light cones with long-range interactions

In quantum many-body systems with local interactions, quantum information and entanglement cannot spread outside of a linear light cone, which expands at an emergent velocity analogous to the speed of light. Local operations at sufficiently separated spacetime points approximately commute -- given a many-body state, $\mathcal{O}_x(t) \mathcal{O}_y |ψ\rangle \approx \mathcal{O}_y\mathcal{O}_x(t) |ψ\rangle$ with arbitrarily small errors -- so long as $|x-y|\gtrsim vt$, where $v$ is finite. Yet most non-relativistic physical systems realized in nature have long-range interactions: two degrees of freedom separated by a distance $r$ interact with potential energy $V(r) \propto 1/r^α$. In systems with long-range interactions, we rigorously establish a hierarchy of linear light cones: at the same $α$, some quantum information processing tasks are constrained by a linear light cone while others are not. In one spatial dimension, this linear light cone exists for every many-body state when $α>3$ (Lieb-Robinson light cone); for a typical state chosen uniformly at random from the Hilbert space when $α>\frac{5}{2}$ (Frobenius light cone); for every state of a non-interacting system when $α>2$ (free light cone). These bounds apply to time-dependent systems and are optimal up to subalgebraic improvements. Our theorems regarding the Lieb-Robinson and free light cones -- and their tightness -- also generalize to arbitrary dimensions. We discuss the implications of our bounds on the growth of connected correlators and of topological order, the clustering of correlations in gapped systems, and the digital simulation of systems with long-range interactions. In addition, we show that universal quantum state transfer, as well as many-body quantum chaos, are bounded by the Frobenius light cone, and therefore are poorly constrained by all Lieb-Robinson bounds.

quant-ph↗

arXiv2021

Clustering of steady-state correlations in open systems with long-range interactions

Lieb-Robinson bounds are powerful analytical tools for constraining the dynamic and static properties of non-relativistic quantum systems. Recently, a complete picture for closed systems that evolve unitarily in time has been achieved. In experimental systems, however, interactions with the environment cannot generally be ignored, and the extension of Lieb-Robinson bounds to dissipative systems which evolve non-unitarily in time remains an open challenge. In this work, we prove two Lieb-Robinson bounds that constrain the dynamics of open quantum systems with long-range interactions that decay as a power-law in the distance between particles. Using a combination of these Lieb-Robinson bounds and mixing bounds which arise from "reversibility" -- naturally satisfied for thermal environments -- we prove the clustering of correlations in the steady states of open quantum systems with long-range interactions. Our work provides an initial step towards constraining the steady-state entanglement structure for a broad class of experimental platforms, and we highlight several open directions regarding the application of Lieb-Robinson bounds to dissipative systems.

quant-ph↗

arXiv2021

The Lieb-Robinson light cone for power-law interactions

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as $1/r^α$ at distance $r$? Here, we present a definitive answer to this question for all exponents $α>2d$ and all spatial dimensions $d$. Schematically, information takes time at least $r^{\min\{1, α-2d\}}$ to propagate a distance~$r$. As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

quant-ph↗

arXiv2021

Optimal State Transfer and Entanglement Generation in Power-law Interacting Systems

We present an optimal protocol for encoding an unknown qubit state into a multiqubit Greenberger-Horne-Zeilinger-like state and, consequently, transferring quantum information in large systems exhibiting power-law ($1/r^α$) interactions. For all power-law exponents $α$ between $d$ and $2d+1$, where $d$ is the dimension of the system, the protocol yields a polynomial speedup for $α>2d$ and a superpolynomial speedup for $α\leq 2d$, compared to the state of the art. For all $α>d$, the protocol saturates the Lieb-Robinson bounds (up to subpolynomial corrections), thereby establishing the optimality of the protocol and the tightness of the bounds in this regime. The protocol has a wide range of applications, including in quantum sensing, quantum computing, and preparation of topologically ordered states. In addition, the protocol provides a lower bound on the gate count in digital simulations of power-law interacting systems.

quant-ph↗

arXiv2020

Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions

The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as $1/r^α$ in the distance $r$ provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shor's algorithm to be performed on a $D$-dimensional lattice in time logarithmic in the number of qubits for interactions with $α\le D$. As a corollary, we show that power-law systems with $α\le D$ are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.

quant-ph↗

arXiv2019

Locality and Heating in Periodically Driven, Power-law Interacting Systems

We study the heating time in periodically driven $D$-dimensional systems with interactions that decay with the distance $r$ as a power-law $1/r^α$. Using linear response theory, we show that the heating time is exponentially long as a function of the drive frequency for $α>D$. For systems that may not obey linear response theory, we use a more general Magnus-like expansion to show the existence of quasi-conserved observables, which imply exponentially long heating time, for $α>2D$. We also generalize a number of recent state-of-the-art Lieb-Robinson bounds for power-law systems from two-body interactions to $k$-body interactions and thereby obtain a longer heating time than previously established in the literature. Additionally, we conjecture that the gap between the results from the linear response theory and the Magnus-like expansion does not have physical implications, but is, rather, due to the lack of tight Lieb-Robinson bounds for power-law interactions. We show that the gap vanishes in the presence of a hypothetical, tight bound.

quant-ph↗

arXiv2019

Locality and digital quantum simulation of power-law interactions

The propagation of information in non-relativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound. We derive a new Lieb-Robinson bound for systems with interactions that decay with distance $r$ as a power law, $1/r^α$. The bound implies an effective light cone tighter than all previous bounds. Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al., FOCS'18. To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish. This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation. In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions. In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when $α>3D$ (where $D$ is the number of dimensions).

quant-ph↗

arXiv2019

Signaling and Scrambling with Strongly Long-Range Interactions

Strongly long-range interacting quantum systems---those with interactions decaying as a power-law $1/r^α$ in the distance $r$ on a $D$-dimensional lattice for $α\le D$---have received significant interest in recent years. They are present in leading experimental platforms for quantum computation and simulation, as well as in theoretical models of quantum information scrambling and fast entanglement creation. Since no notion of locality is expected in such systems, a general understanding of their dynamics is lacking. As a first step towards rectifying this problem, we prove two new Lieb-Robinson-type bounds that constrain the time for signaling and scrambling in strongly long-range interacting systems, for which no tight bounds were previously known. Our first bound applies to systems mappable to free-particle Hamiltonians with long-range hopping, and is saturable for $α\le D/2$. Our second bound pertains to generic long-range interacting spin Hamiltonians, and leads to a tight lower bound for the signaling time to extensive subsets of the system for all $α< D$. This result also lower-bounds the scrambling time, and suggests a path towards achieving a tight scrambling bound that can prove the long-standing fast scrambling conjecture.

quant-ph↗