Phase-cycled randomized benchmarking of quantum processors: recovering hidden classical noise correlations
cs.ET, cs.CL, cs.DC
Submitted: 2026-09-06
Updated: 2026-09-06
Comments: 8 pages, 3 figures. Code and data: https://github.com/Mirza-Samad-Ahmed-Baig/quantum-phase-cycled-rb
Code: https://github.com/Mirza-Samad-Ahmed-Baig/quantum-phase-cycled-rb
License: http://creativecommons.org/licenses/by/4.0/
The gist: Randomized benchmarking can hide classical temporal correlations because its Clifford-twirled response is even in the noise phase.
Terminology
Abstract
Randomized benchmarking can hide classical temporal correlations because its Clifford-twirled response is even in the noise phase. For a stationary symmetric telegraph fluctuator, we show that continuous evolution and independent stationary resets at slot boundaries yield identical mean responses for arbitrary fixed idle modulations. We construct an eight-setting phase-cycle measurement of the connected sine-phase covariance under ideal Clifford twirling and classical idle dephasing. This observable vanishes for independent slot noise and fixed detuning without a weak-phase or Gaussian approximation. A closed telegraph response, independent circuit calculations and 800 simulation trials validate the construction and quantify the empirical coverage of a paired bootstrap estimator. A separate conservative confidence set states its finite-sample assumptions. Two acquisitions on an IBM processor compare engineered shared-sign and independently reset phases with identical marginals. Their primary contrasts are 0.254 and 0.211, with empirical 95% intervals [0.177, 0.331] and [0.136, 0.285], respectively; all negative-control intervals include zero. At equal shot and sensingwindow budgets, an ideal Ramsey/echo estimator is more precise in every tested class. The result supplies an explicit connection between a benchmarking identifiability limitation and a controlled correlation measurement. No native or quantum-memory detection is claimed.
Related papers
- Quantum Approximate Multi-Objective Optimization in Routing Problems
- An RRAM-based Hardware Implementation of a Radial Basis Function Neuron for Edge Classifiers
- Embodied Neurocomputation: A Framework for Interfacing Biological Neural Cultures with Scaled Task-Driven Validation
- Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing
- Thermalizing Stochastic Programs
- Streamlined optical training of large-scale modern deep learning architectures with direct feedback alignment