Skip to content

Phase-cycled randomized benchmarking of quantum processors: recovering hidden classical noise correlations

Sep 2026 · 0 citations · 3 references
Computer Science

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.

View source

Similar papers

#machine learning Preprint Sep 2026

Terminal-Register Certification for Finite-Measurement Learning of Multiscale Quantum States

It is confirmed that an ideal sequential and terminal measurement schedule delivers the same complete bit string distribution under matched causal operations, while normalized postselection can amplify perturbations inversely with prefix acceptance.

Bhvain Makwana, Kashyap Patel, Manjunath Joshi et al. · 0 citations
Preprint Sep 2026

Classical simulation of amplitude-damped bucket-brigade quantum random access memories via predictable branch evolution

Classical simulation of quantum random access memory (QRAM) under noise can be accelerated dramatically by branch pruning: noise histories are sampled as trajectory ensembles, and good branches, whose routing paths avoid every sampled fault, need not be evolved because their final states are analytically predictable. U...

Zhao-Yun Chen, Ming-Yang Tan, Sheng Zhang et al. · 0 citations
Preprint Sep 2026

Predictive Structure Behind Rare Outcomes in Random Quantum Circuits

Rare outputs of random quantum circuits are usually treated as terminal statistics. We ask whether they reveal intermediate organization that remains useful beyond the selecting future. Comparing unconditioned random-normal (RN) and peak-selected random-peaked (RP) circuits from the same local generator, we find strong...

Myeongsu Kim, Travis S. Humble, S. Kais · 0 citations
Preprint Sep 2026

Metrological Benchmarking of Random Quantum Circuits

Random circuit sampling is a leading approach to demonstrating quantum computational advantage, but benchmarking noisy implementations through linear cross-entropy requires costly calculations of ideal output probabilities. We propose a metrological benchmark based on the response to controlled perturbations, character...

Simone Cavazzoni, Changhun Oh · 0 citations
Preprint Sep 2026

Environmental records unlock universal quantum computation from thermal decoherence

At a fixed thermal exposure, the same stabilizer processor can be classically simulable or quantum universal, depending on which environmental records its controller retains. We give an exact computational classification of energy-counting thermal-idle instruments in a quantum processor with ideal stabilizer control an...

Chen-Feng Cao, Qi Zhao · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.