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

arXiv:2609.06448

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

Mirza Samad Ahmed Baig, Syeda Anshrah Gillani, Abdul Akbar Khan, Muhammad Omer Khan

Published Sep 6, 2026• 0 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2609.06448

Related papers

Loop-Phase Covariance from a Single Site in a Four-Site Quantum Walk

Antyshev

A particle moving around two loops can encounter identical marginal phase noise whether the fluctuations are independent or shared. We give a necessary and sufficient criterion for identifying Gaussian cycle-phase covariance from calibrated population harmonics on a finite connected hopping graph. A four-site diamond realizes the two-cycle criterion with one binary occupation readout at one fixed time. Four vertices are necessary within the class of simple graphs. A cycle of 17 control-phase settings has a certified absolute alias error below 0.000009 per selected Fourier component. A new finite-sample covariance interval combines an independent pilot, directional Hoeffding concentration and an exact bound on the logarithmic remainder. In a reproducible synthetic comparison on the same graph, the method yields narrower intervals using 143,616 rather than 417,792 shots per test–reference comparison, including the pilot, with simultaneous coverage at least 95% under the stated assumptions. This sample-size gain is specific to the benchmark. Experimentally, the mixed winding distinguishes independent and shared loop fluctuations that have the same marginal visibilities. A homogeneous edge-noise model gives the consistency law M=A^(4/3), while a specified local variance perturbation violates it. Implementation requires controlled loop phases, independent repeated preparations, a matched reference and a calibrated systematic-error budget; edge-noise localization requires further information.

•Nov 13, 2026•0 citations

Phase transitions in random circuit sampling

Alexis Morvan, Benjamin Villalonga, Xiao Mi +97 more

Undesired coupling to the surrounding environment destroys long-range correlations in quantum processors and hinders coherent evolution in the nominally available computational space. This noise is an outstanding challenge when leveraging the computation power of near-term quantum processors1. It has been shown that benchmarking random circuit sampling with cross-entropy benchmarking can provide an estimate of the effective size of the Hilbert space coherently available2–8. Nevertheless, quantum algorithms’ outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak-link model, which allows us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors. By implementing random circuit sampling, experimental and theoretical results establish the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.

arXiv:2304.11119•Nature•Oct 9, 2024•248 citations

Metrological Benchmarking of Random Quantum Circuits

Simone Cavazzoni, Changhun Oh

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, characterized by quantum Fisher information (QFI). A relation between QFI and out-of-time-order correlators enables protocols with local or global control. For Haar-random circuits, the average QFI approaches its maximal value in the local protocol and grows linearly with the number of qubits under collective control. In contrast, Clifford circuits yield zero QFI despite extensive operator spreading, showing that the response probes dynamical properties beyond spreading alone. A butterfly protocol further uses system size to enhance sensitivity, yielding a mean inverse sensitivity proportional to the number of qubits with single-qubit readout. Its fluctuations distinguish the Haar and Clifford ensembles despite their identical mean responses. For noisy implementations, we derive an exact relation between the noisy and ideal QFI within a global white-noise model, providing a quantitative reference for the degradation of the benchmark. These protocols enable metrological benchmarking of noisy random quantum circuits without computing ideal output probabilities.

quant-pharXiv:2609.39226•Oct 1, 2026•0 citations

Group twirling and noise tailoring for multiqubit controlled phase gates

Guoding Liu, Ziyi Xie, Zitai Xu +1 more

Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and randomized compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into Pauli channels for Clifford gates—thereby facilitating efficient benchmarking and mitigating worst-case errors—the lack of practical twirling groups for multiqubit non-Clifford gates remains a challenge. To address this gap, we study the issue of finding twirling groups for generic quantum gates, focusing on a widely used circuit structure in randomized benchmarking or randomized compiling. Specifically, for multiqubit controlled phase gates, which are essential in quantum algorithms and directly implementable in practice, we determine optimal twirling groups within the realm of classically replaceable unitary operations. Contrasting with the local Pauli twirling group for Clifford gates, the optimal groups for such gates contain nonlocal operations, highlighting the overhead of tailoring noise in global non-Clifford contexts. We design new benchmarking procedures for multiqubit controlled phase gates based on the optimal twirling groups. Our simulation results show that our scheme can improve the precision and accuracy of benchmarking in small-scale systems. Published by the American Physical Society 2024

arXiv:2309.15651•Physical Review Research•Dec 2, 2024•8 citations

Recovering Coherent Errors from Randomized-Compiling Labels

Kushagra Vyas

Randomized compiling converts a coherent gate error into a stochastic one by dressing each gate with a randomly chosen Pauli operator, and the standard view is that the coherent information is lost once outcomes are averaged over these random choices. This is incorrect: an exact Fisher-information identity shows that the averaged data and the correlation between the outcome and the random choice, the twirl label, together conserve the full information, and only the label is normally discarded. Retaining it turns an unmodified randomized-compiling run into an unbiased estimator for the coherent error, at no added circuit cost, valid under realistic decoherence and at any circuit depth. The same construction extends to coupling between qubits through two further mechanisms: a neighboring qubit prepared in a known, randomized state probes static coupling, and randomizing the pulse count used to prepare that state isolates a second, physically distinct leakage effect found unexpectedly on real hardware during this work. All three results are derived exactly, checked against closed-form oracles, and tested on a 127-qubit IBM processor. The single-qubit case is confirmed cleanly: an injected phase is recovered to 0.006~rad while the same data without labels shows no signal. The two-qubit extensions are validated at the level of the recovery circuit, with clean positive controls on hardware, though the coupling strengths themselves remain below the resolution of the shot budgets used here.

quant-pharXiv:2607.26756•Jul 30, 2026•1 citation

Scalable and Verifiable Quantum Benchmarking with Spectrally Flat Hidden Shifts

Lior Horesh C, Vasileios Kalantzis, Shashanka Ubaru

Abstract Scalable quantum benchmarks often lack exact reference answers that can be verified without classically simulating the device. We introduce a hidden-shift benchmark in which a secret string is planted by construction, recovered by a quantum circuit, and exactly verified at any system size. The benchmark uses spectrally flat Boolean oracles, whose Fourier structure fixes the ideal output weight of the planted answer and enables majority-vote recovery even when its single-shot probability is extremely small. Register size, circuit depth, and non-Clifford content are independently controlled through the oracle degree. On IBM superconducting processors, degree-2 instances are recovered on up to 24 qubits despite single-shot fidelities near $10^{-3}$, while higher-degree oracles provide a tunable non-Clifford stress test that distinguishes processor performance. Although classically tractable, these benchmarks provide a scalable and exactly verifiable measure of how far a noisy quantum processor can reliably execute a structured computation.

•Nov 12, 2026•0 citations
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.
A particle moving around two loops can encounter identical marginal phase noise whether the fluctuations are independent or shared. We give a necessary and sufficient criterion for identifying Gaussian cycle-phase covariance from calibrated population harmonics on a finite connected hopping graph. A four-site diamond realizes the two-cycle criterion with one binary occupation readout at one fixed time. Four vertices are necessary within the class of simple graphs. A cycle of 17 control-phase settings has a certified absolute alias error below 0.000009 per selected Fourier component. A new finite-sample covariance interval combines an independent pilot, directional Hoeffding concentration and an exact bound on the logarithmic remainder. In a reproducible synthetic comparison on the same graph, the method yields narrower intervals using 143,616 rather than 417,792 shots per test–reference comparison, including the pilot, with simultaneous coverage at least 95% under the stated assumptions. This sample-size gain is specific to the benchmark. Experimentally, the mixed winding distinguishes independent and shared loop fluctuations that have the same marginal visibilities. A homogeneous edge-noise model gives the consistency law M=A^(4/3), while a specified local variance perturbation violates it. Implementation requires controlled loop phases, independent repeated preparations, a matched reference and a calibrated systematic-error budget; edge-noise localization requires further information.
Undesired coupling to the surrounding environment destroys long-range correlations in quantum processors and hinders coherent evolution in the nominally available computational space. This noise is an outstanding challenge when leveraging the computation power of near-term quantum processors1. It has been shown that benchmarking random circuit sampling with cross-entropy benchmarking can provide an estimate of the effective size of the Hilbert space coherently available2–8. Nevertheless, quantum algorithms’ outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak-link model, which allows us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors. By implementing random circuit sampling, experimental and theoretical results establish the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.
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, characterized by quantum Fisher information (QFI). A relation between QFI and out-of-time-order correlators enables protocols with local or global control. For Haar-random circuits, the average QFI approaches its maximal value in the local protocol and grows linearly with the number of qubits under collective control. In contrast, Clifford circuits yield zero QFI despite extensive operator spreading, showing that the response probes dynamical properties beyond spreading alone. A butterfly protocol further uses system size to enhance sensitivity, yielding a mean inverse sensitivity proportional to the number of qubits with single-qubit readout. Its fluctuations distinguish the Haar and Clifford ensembles despite their identical mean responses. For noisy implementations, we derive an exact relation between the noisy and ideal QFI within a global white-noise model, providing a quantitative reference for the degradation of the benchmark. These protocols enable metrological benchmarking of noisy random quantum circuits without computing ideal output probabilities.
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and randomized compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into Pauli channels for Clifford gates—thereby facilitating efficient benchmarking and mitigating worst-case errors—the lack of practical twirling groups for multiqubit non-Clifford gates remains a challenge. To address this gap, we study the issue of finding twirling groups for generic quantum gates, focusing on a widely used circuit structure in randomized benchmarking or randomized compiling. Specifically, for multiqubit controlled phase gates, which are essential in quantum algorithms and directly implementable in practice, we determine optimal twirling groups within the realm of classically replaceable unitary operations. Contrasting with the local Pauli twirling group for Clifford gates, the optimal groups for such gates contain nonlocal operations, highlighting the overhead of tailoring noise in global non-Clifford contexts. We design new benchmarking procedures for multiqubit controlled phase gates based on the optimal twirling groups. Our simulation results show that our scheme can improve the precision and accuracy of benchmarking in small-scale systems. Published by the American Physical Society 2024
Randomized compiling converts a coherent gate error into a stochastic one by dressing each gate with a randomly chosen Pauli operator, and the standard view is that the coherent information is lost once outcomes are averaged over these random choices. This is incorrect: an exact Fisher-information identity shows that the averaged data and the correlation between the outcome and the random choice, the twirl label, together conserve the full information, and only the label is normally discarded. Retaining it turns an unmodified randomized-compiling run into an unbiased estimator for the coherent error, at no added circuit cost, valid under realistic decoherence and at any circuit depth. The same construction extends to coupling between qubits through two further mechanisms: a neighboring qubit prepared in a known, randomized state probes static coupling, and randomizing the pulse count used to prepare that state isolates a second, physically distinct leakage effect found unexpectedly on real hardware during this work. All three results are derived exactly, checked against closed-form oracles, and tested on a 127-qubit IBM processor. The single-qubit case is confirmed cleanly: an injected phase is recovered to 0.006~rad while the same data without labels shows no signal. The two-qubit extensions are validated at the level of the recovery circuit, with clean positive controls on hardware, though the coupling strengths themselves remain below the resolution of the shot budgets used here.
Abstract Scalable quantum benchmarks often lack exact reference answers that can be verified without classically simulating the device. We introduce a hidden-shift benchmark in which a secret string is planted by construction, recovered by a quantum circuit, and exactly verified at any system size. The benchmark uses spectrally flat Boolean oracles, whose Fourier structure fixes the ideal output weight of the planted answer and enables majority-vote recovery even when its single-shot probability is extremely small. Register size, circuit depth, and non-Clifford content are independently controlled through the oracle degree. On IBM superconducting processors, degree-2 instances are recovered on up to 24 qubits despite single-shot fidelities near 10−310^{-3}10−3, while higher-degree oracles provide a tunable non-Clifford stress test that distinguishes processor performance. Although classically tractable, these benchmarks provide a scalable and exactly verifiable measure of how far a noisy quantum processor can reliably execute a structured computation.