Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Deterministic fast scrambling with Rydberg arrays

Gregory S. Bentsen, Tomohiro Hashizume, Sebastian Weber, Andrew J. Daley

Published Jun 3, 2021• 0 citations
OpenAlex

Related papers

Towards the fast scrambling conjecture

Nima Lashkari, Douglas Stanford, Matthew B. Hastings +2 more

arXiv:1111.6580•Journal of High Energy Physics•Apr 1, 2013•433 citations

Deterministic Fast Scrambling with Neutral Atom Arrays

Tomohiro Hashizume, Gregory S. Bentsen, Sebastian Weber +1 more

Fast scramblers are dynamical quantum systems that produce many-body entanglement on a timescale that grows logarithmically with the system size N. We propose and investigate a family of deterministic, fast scrambling quantum circuits realizable in near-term experiments with arrays of neutral atoms. We show that three experimental tools-nearest-neighbor Rydberg interactions, global single-qubit rotations, and shuffling operations facilitated by an auxiliary tweezer array-are sufficient to generate nonlocal interaction graphs capable of scrambling quantum information using only O(logN) parallel applications of nearest-neighbor gates. These tools enable direct experimental access to fast scrambling dynamics in a highly controlled and programmable way and can be harnessed to produce highly entangled states with varied applications.

arXiv:2102.13117•Physical Review Letters•May 19, 2021•18 citations

Tuning between collective dynamics and scrambling through initial-state symmetry alignment in long-range spin models

Sridevi Kuriyattil, Johannes Kombe, Andrew J. Daley +1 more

Long-range interactions in many-body quantum systems give rise to a wide range of dynamical phenomena, from collective dynamics well described by integrable mean-field models with symmetric all-to-all couplings, to fast scrambling of quantum information from disordered long-range interactions. Here, we investigate scenarios in which both regimes emerge within a single deterministic, translation-invariant XY spin model with long-range couplings. We consider a sparse powers-of-two (PWR2) graph, where each spin interacts with a logarithmic number of neighbors, and a power-law-decaying model. By altering the initial state via local perturbations on a completely symmetric state, we show that the dynamics changes from collective to scrambling as witnessed by bipartite and multipartite entanglement measures. We characterize this collective-to-scrambling crossover using Lyapunov exponents in the semiclassical regime, and show that the spectral properties of the coupling graph adjacency matrix provide a very efficient tool to predict the onset of fast scrambling. Our results offer a unified framework for controlling the switch between collective and scrambling dynamics in a setup accessible in experiments with neutral atoms in cavities or in tweezer arrays.

quant-pharXiv:2610.28462•Oct 21, 2026•0 citations

Optimizing the Fast Rydberg Gate

Marianna S. Safronova, Carl J. Williams, Charles W. Clark

Physical Review A•Jan 1, 2003•1 citation

Onset of Scrambling as a Dynamical Transition in Tunable-Range Quantum Circuits

Sridevi Kuriyattil, Tomohiro Hashizume, Gregory S. Bentsen +1 more

In a fast-scrambling many-body quantum system, information is spread and entanglement is built up on a time scale that grows logarithmically with the system size.This is of fundamental interest in understanding the dynamics of many-body systems, as well as in efficiently producing entangled resource states and error-correcting codes.In this work, we identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity.In particular, we show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse around a critical point between two clearly defined regimes of different dynamical behavior.We study this transition analytically in a related long-range Brownian-circuit model and show how the transition can be mapped onto the statistical mechanics of a long-range Ising model in a particular region of parameter space.This mapping predicts mean-field critical exponents ν = -1/(1 + s c ), which are consistent with the critical exponents extracted from Clifford-circuit numerics.In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic sparse circuits that can be realized in experiments with neutral-atom arrays.

arXiv:2304.09833•PRX Quantum•Aug 23, 2023•5 citations

Deterministic atom-shuttle interconnects via ultrafast atom-ion entangling gate

Mu Qiao

Neutral-atom arrays and trapped-ion crystals offer complementary strengths for fault-tolerant quantum computing but lack a fast way to deterministically interact. Here we propose a controlled-$Z$ gate generated by the charge-induced-dipole ($C_4$) force between a Rydberg-excited atom and a trapped ion, balanced by a spin-dependent optical Magnus force on the ion that closes phase-space trajectories within a few microseconds. Toggling the Rydberg state extends the scheme to multi-ion crystals at negligible overhead. The resulting ${\sim}5\,$kHz atom shuttle accelerates short-distance QCCD links and enables hybrid qLDPC memories in which atom logical qubits are written onto an ion block treated as a passive storage zone. We perform circuit-level Monte Carlo simulations and find that the hybrid architecture supports orders of magnitude more operations than atom-only or ion-only architectures at fixed code distance and logical error rate.

quant-pharXiv:2607.15597•Jul 20, 2026•0 citations
Fast scramblers are dynamical quantum systems that produce many-body entanglement on a timescale that grows logarithmically with the system size N. We propose and investigate a family of deterministic, fast scrambling quantum circuits realizable in near-term experiments with arrays of neutral atoms. We show that three experimental tools-nearest-neighbor Rydberg interactions, global single-qubit rotations, and shuffling operations facilitated by an auxiliary tweezer array-are sufficient to generate nonlocal interaction graphs capable of scrambling quantum information using only O(logN) parallel applications of nearest-neighbor gates. These tools enable direct experimental access to fast scrambling dynamics in a highly controlled and programmable way and can be harnessed to produce highly entangled states with varied applications.
Long-range interactions in many-body quantum systems give rise to a wide range of dynamical phenomena, from collective dynamics well described by integrable mean-field models with symmetric all-to-all couplings, to fast scrambling of quantum information from disordered long-range interactions. Here, we investigate scenarios in which both regimes emerge within a single deterministic, translation-invariant XY spin model with long-range couplings. We consider a sparse powers-of-two (PWR2) graph, where each spin interacts with a logarithmic number of neighbors, and a power-law-decaying model. By altering the initial state via local perturbations on a completely symmetric state, we show that the dynamics changes from collective to scrambling as witnessed by bipartite and multipartite entanglement measures. We characterize this collective-to-scrambling crossover using Lyapunov exponents in the semiclassical regime, and show that the spectral properties of the coupling graph adjacency matrix provide a very efficient tool to predict the onset of fast scrambling. Our results offer a unified framework for controlling the switch between collective and scrambling dynamics in a setup accessible in experiments with neutral atoms in cavities or in tweezer arrays.
In a fast-scrambling many-body quantum system, information is spread and entanglement is built up on a time scale that grows logarithmically with the system size.This is of fundamental interest in understanding the dynamics of many-body systems, as well as in efficiently producing entangled resource states and error-correcting codes.In this work, we identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity.In particular, we show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse around a critical point between two clearly defined regimes of different dynamical behavior.We study this transition analytically in a related long-range Brownian-circuit model and show how the transition can be mapped onto the statistical mechanics of a long-range Ising model in a particular region of parameter space.This mapping predicts mean-field critical exponents ν = -1/(1 + s c ), which are consistent with the critical exponents extracted from Clifford-circuit numerics.In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic sparse circuits that can be realized in experiments with neutral-atom arrays.
Neutral-atom arrays and trapped-ion crystals offer complementary strengths for fault-tolerant quantum computing but lack a fast way to deterministically interact. Here we propose a controlled-ZZZ gate generated by the charge-induced-dipole (C4C_4C4​) force between a Rydberg-excited atom and a trapped ion, balanced by a spin-dependent optical Magnus force on the ion that closes phase-space trajectories within a few microseconds. Toggling the Rydberg state extends the scheme to multi-ion crystals at negligible overhead. The resulting ∼5 {\sim}5\,∼5kHz atom shuttle accelerates short-distance QCCD links and enables hybrid qLDPC memories in which atom logical qubits are written onto an ion block treated as a passive storage zone. We perform circuit-level Monte Carlo simulations and find that the hybrid architecture supports orders of magnitude more operations than atom-only or ion-only architectures at fixed code distance and logical error rate.