Information Propagation in Rydberg Arrays via Analog OTOC Calculations

• URL: http://arxiv.org/abs/2604.05038v1
• Date: Mon, 06 Apr 2026 18:00:05 GMT
• Title: Information Propagation in Rydberg Arrays via Analog OTOC Calculations
• Abstract summary: Out-of-time-order correlators (OTOCs) are the main tool for probing quantum chaos and scrambling.<n>We develop and implement a randomized measurement protocol to compute OTOCs on Aquila by QuEra Computing.<n>This work establishes the first demonstration of fully analog randomized OTOC measurements in neutral-atom simulators.
• Score: 37.108493798440655
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Out-of-time-order correlators (OTOCs) are the main tool for probing quantum chaos and scrambling, and have become crucial probes in many areas of quantum computing. However, the measurement of OTOCs is difficult to implement on analog quantum computers due to the requirement of backward time evolution. In this paper, we develop and implement a randomized measurement protocol to compute OTOCs on Aquila by QuEra Computing. Unlike traditional methods that require backward time evolution, our approach utilizes a sequence of global randomized quenches that approximates the unitary 2-design properties necessary for extracting infinite-temperature OTOCs from statistical correlations. We demonstrate the protocol's success by explicitly observing the lightcone of information propagation in 1D Rydberg chains, and compare hardware results to both state-vector simulations and matrix product state (MPS) tensor network calculations. This work establishes the first demonstration of fully analog randomized OTOC measurements in neutral-atom simulators, providing a scalable pathway to probe quantum chaos in complex many-body systems.

Related papers

• Deterministic Quantum Phase Estimation with Linear Circuit Complexity in a Photonic System [4.969716969054012]
  Quantum algorithms solve certain computational problems faster than the best known classical algorithms.<n>We introduce a QPE algorithm that successfully reduces the circuit complexity from $mathcalO(n2)$ to $mathcalO(n)$ for a special class of unitary operators.
  arXiv  Detail & Related papers  (2026-07-15T03:02:14Z)
• Memory-Augmented Hybrid Quantum Reservoir Computing [0.0]
  We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array.
  arXiv  Detail & Related papers  (2024-09-15T22:44:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Simulating Floquet scrambling circuits on trapped-ion quantum computers [0.6843496572893532]
  Information scrambling is one of the promising applications of quantum computing.<n>We demonstrate the Hayden-Preskill recovery protocol and the interferometric protocol for calculating out-of-time-ordered correlators.<n>Our experiments are made possible by extensively utilizing one of the highest-fidelity quantum processors currently available.
  arXiv  Detail & Related papers  (2024-05-13T10:22:17Z)
• Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
  We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. Our results are the first step in the experimental realization of QSP-based quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-09T19:00:17Z)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Optimality and Complexity in Measured Quantum-State Stochastic Processes [0.0]
  We show that optimal prediction requires using an infinite number of temporal features. We identify the mechanism underlying this complicatedness as generator nonunifilarity. This makes it possible to quantitatively explore the influence that measurement choice has on a quantum process' degrees of randomness.
  arXiv  Detail & Related papers  (2022-05-08T21:43:06Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.