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

Quantum Science and Technology

Unveiling the Action of Randomized Compiling on Quantum States: A Geometric Perspective

Kai Tang, Chao Zhan, Yao Song, Peiling Huang, Yuxuan Zhou, Song Liu, Junkai Zeng, Jiansheng Wu, Tongxing Yan, Xiu–Hao Deng, Yuanzhen Chen

Published Nov 5, 2026• 0 citations
Publisher

Abstract

Abstract Randomized compiling (RC) converts coherent errors into stochastic Pauli noise, but this conversion alone does not imply isotropic contraction of the output state. Here we use the generalized Bloch vector (GBV) representation to examine the cumulative effect of RC on state purity and orientation in multi-layer circuits. For the independent, isotropically distributed weak coherent errors considered here, the accumulated ensemble-averaged RC channel lies close to the depolarizing direction, producing a state-level near-isotropic contraction that sacrifices a small amount of purity to achieve a substantial suppression of orientational deviation. When dephasing coexists, RC suppresses the coherent-error contribution but leaves a residual deviation dominated by dephasing, setting a limit that we term the ``dephasing wall.'' We experimentally validate these findings on a superconducting quantum processor through GHZ state preparation and phase estimation in a simulation of topological braiding. The results confirm that RC's effectiveness stems from its ability to suppress the orientational bias of coherent errors—a structural transformation not resolved by fidelity alone but directly visible through GBV diagnostics.

DOI
10.1088/2058-9565/aebe5f

Related papers

Noise Correlations as a Resource in Pauli-Twirled Circuits

Antoine Brillant, Rohan N Rajmohan, Peter Groszkowski +3 more

Randomized compiling (RC) is an established tool to tailor arbitrary quantum noise channels into Pauli errors. The effect of both spatial and temporal noise correlations in randomly compiled circuits, however, is not fully understood. Here, we show that for a broad class of correlated Gaussian noise, RC reduces both the strength and temporal range of correlations. For Clifford circuits, we derive a simple analytical expression for the circuit fidelity of randomly compiled circuits. Surprisingly, we show that this fidelity is always increased by the presence of correlations, suggesting that correlations are a resource in randomly compiled circuits. To leading order in system-bath coupling, we also show that RC suppresses the quantum component of bath correlations, implying that one can safely treat weak noise as being classical. Finally, through extensive numerical simulations, we show that our results remain valid for many relevant non-Clifford circuits. These results clarify how RC mitigates memory effects and enhances circuit robustness.

quant-pharXiv:2603.12054•Mar 13, 2026•2 citations

Concepts and conditions for error suppression through randomized compiling

Adam Winick, Joel J. Wallman, Dar Dahlen +3 more

Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling also tailors non-Markovian errors into local stochastic Pauli noise and investigate the technique's limitations. We show through analysis and numerical results that randomized compiling alters errors in three distinct helpful ways. First, it prevents the coherent accumulation of errors (including hard to remove crosstalk effects) across gate cycles by destroying intercycle coherent correlations. Second, it converts individual gate cycle errors into Pauli noise. Finally, randomized compiling reduces the variability inherent to noisy devices. We confirm these theoretical predictions with the IBM Quantum Experience platform and describe experimental data that illustrates a drastic performance improvement across public devices. These results cement the importance of randomized compiling in near- and long-term quantum information processing.

arXiv:2212.07500•Dec 14, 2022•22 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

Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer

Hugo Perrin, Thibault Scoquart, Alexander Shnirman +2 more

We develop and apply an extension of the randomized compiling (RC) protocol that includes a special treatment of neighboring qubits and dramatically reduces crosstalk effects caused by the application of faulty gates on superconducting qubits in IBMQ quantum computers ( and ). Crosstalk errors, stemming from controlled- () two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. For the IBMQ machines, their effect on the performance of a given quantum computation is often overlooked. Our RC protocol turns coherent noise due to crosstalk into a depolarizing noise channel that can then be treated using established error mitigation schemes, such as noise estimation circuits. We apply our approach to the quantum simulation of the nonequilibrium dynamics of the Bardeen-Cooper-Schrieffer (BCS) Hamiltonian for superconductivity, a particularly challenging model to simulate on quantum hardware because of the long-range interaction of Cooper pairs. With 135 gates, we work in a regime where crosstalk, as opposed to either Trotterization or qubit decoherence, dominates the error. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits and allows for a quantitative simulation of the BCS model. Published by the American Physical Society 2024

arXiv:2305.02345•Physical Review Research•Feb 5, 2024•23 citations

Improved quantum error correction with randomized compiling

Aditya Jain, Pavithran Sridharan Iyer, Stephen D. Bartlett +1 more

Current hardware for quantum computing suffers from high levels of noise, and so to achieve practical fault-tolerant quantum computing will require powerful and efficient methods to correct for errors in quantum circuits. Here, we explore the role and effectiveness of using noise tailoring techniques to improve the performance of error correcting codes. Noise tailoring methods such as randomized compiling (RC) convert complex coherent noise processes to effective stochastic noise. While it is known that this can be leveraged to design efficient diagnostic tools, we explore its impact on the performance of error correcting codes. Of particular interest is the important class of coherent errors, arising from control errors, where RC has the maximum effect---converting these into purely stochastic errors. For these errors, we show here that RC delivers an improvement in performance of the concatenated Steane code by several orders of magnitude. We also show that below a threshold rotation angle, the gains in logical fidelity can be arbitrarily magnified by increasing the size of the codes. These results suggest that using randomized compiling can lead to a significant reduction in the resource overhead required to achieve fault tolerance.

arXiv:2303.06846•Physical Review Research•Jul 25, 2023•18 citations

Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition

Yevgen Kotukh

We present Stochastic Commutator Synthesis, a hybrid quantum gate compilation framework that integrates Kuperberg's sub-cubic Solovay-Kitaev exponent c near 1.44042 with the error-tailoring machinery of randomized compilation. Classical Solovay-Kitaev implementations produce known word lengths and accumulate coherent approximation errors that degrade fault-tolerant threshold estimates. Kuperberg's 2023-2025 result reduces this via doubly exponential convergence and higher-order commutator decompositions. SCS augments this geometric backbone with a Gibbs-sampled stochastic choice of commutator factors at each recursion level, converting coherent synthesis residuals into incoherent, Pauli-twirl-compatible noise -- a property exploited by RC. Combined with RL-guided pre-synthesis, SCS achieves consistent T-count reductions of 10-25 percent and demonstrates fidelity gains of up to 35 percent on multi-fold Forrelation circuits on trapped-ion hardware such as Sandia QSCOUT. We situate SCS within the complexity-theoretic landscape established by the Raz-Tal oracle separation, arguing that low-error, noise-robust compilation of Forrelation-type circuits constitutes a practical pathway toward demonstrating this separation on physical hardware.

quant-pharXiv:2605.02051•May 5, 2026•1 citation
Abstract Randomized compiling (RC) converts coherent errors into stochastic Pauli noise, but this conversion alone does not imply isotropic contraction of the output state. Here we use the generalized Bloch vector (GBV) representation to examine the cumulative effect of RC on state purity and orientation in multi-layer circuits. For the independent, isotropically distributed weak coherent errors considered here, the accumulated ensemble-averaged RC channel lies close to the depolarizing direction, producing a state-level near-isotropic contraction that sacrifices a small amount of purity to achieve a substantial suppression of orientational deviation. When dephasing coexists, RC suppresses the coherent-error contribution but leaves a residual deviation dominated by dephasing, setting a limit that we term the ``dephasing wall.'' We experimentally validate these findings on a superconducting quantum processor through GHZ state preparation and phase estimation in a simulation of topological braiding. The results confirm that RC's effectiveness stems from its ability to suppress the orientational bias of coherent errors—a structural transformation not resolved by fidelity alone but directly visible through GBV diagnostics.
Randomized compiling (RC) is an established tool to tailor arbitrary quantum noise channels into Pauli errors. The effect of both spatial and temporal noise correlations in randomly compiled circuits, however, is not fully understood. Here, we show that for a broad class of correlated Gaussian noise, RC reduces both the strength and temporal range of correlations. For Clifford circuits, we derive a simple analytical expression for the circuit fidelity of randomly compiled circuits. Surprisingly, we show that this fidelity is always increased by the presence of correlations, suggesting that correlations are a resource in randomly compiled circuits. To leading order in system-bath coupling, we also show that RC suppresses the quantum component of bath correlations, implying that one can safely treat weak noise as being classical. Finally, through extensive numerical simulations, we show that our results remain valid for many relevant non-Clifford circuits. These results clarify how RC mitigates memory effects and enhances circuit robustness.
Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling also tailors non-Markovian errors into local stochastic Pauli noise and investigate the technique's limitations. We show through analysis and numerical results that randomized compiling alters errors in three distinct helpful ways. First, it prevents the coherent accumulation of errors (including hard to remove crosstalk effects) across gate cycles by destroying intercycle coherent correlations. Second, it converts individual gate cycle errors into Pauli noise. Finally, randomized compiling reduces the variability inherent to noisy devices. We confirm these theoretical predictions with the IBM Quantum Experience platform and describe experimental data that illustrates a drastic performance improvement across public devices. These results cement the importance of randomized compiling in near- and long-term quantum information processing.
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.
We develop and apply an extension of the randomized compiling (RC) protocol that includes a special treatment of neighboring qubits and dramatically reduces crosstalk effects caused by the application of faulty gates on superconducting qubits in IBMQ quantum computers ( and ). Crosstalk errors, stemming from controlled- () two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. For the IBMQ machines, their effect on the performance of a given quantum computation is often overlooked. Our RC protocol turns coherent noise due to crosstalk into a depolarizing noise channel that can then be treated using established error mitigation schemes, such as noise estimation circuits. We apply our approach to the quantum simulation of the nonequilibrium dynamics of the Bardeen-Cooper-Schrieffer (BCS) Hamiltonian for superconductivity, a particularly challenging model to simulate on quantum hardware because of the long-range interaction of Cooper pairs. With 135 gates, we work in a regime where crosstalk, as opposed to either Trotterization or qubit decoherence, dominates the error. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits and allows for a quantitative simulation of the BCS model. Published by the American Physical Society 2024
Current hardware for quantum computing suffers from high levels of noise, and so to achieve practical fault-tolerant quantum computing will require powerful and efficient methods to correct for errors in quantum circuits. Here, we explore the role and effectiveness of using noise tailoring techniques to improve the performance of error correcting codes. Noise tailoring methods such as randomized compiling (RC) convert complex coherent noise processes to effective stochastic noise. While it is known that this can be leveraged to design efficient diagnostic tools, we explore its impact on the performance of error correcting codes. Of particular interest is the important class of coherent errors, arising from control errors, where RC has the maximum effect---converting these into purely stochastic errors. For these errors, we show here that RC delivers an improvement in performance of the concatenated Steane code by several orders of magnitude. We also show that below a threshold rotation angle, the gains in logical fidelity can be arbitrarily magnified by increasing the size of the codes. These results suggest that using randomized compiling can lead to a significant reduction in the resource overhead required to achieve fault tolerance.
We present Stochastic Commutator Synthesis, a hybrid quantum gate compilation framework that integrates Kuperberg's sub-cubic Solovay-Kitaev exponent c near 1.44042 with the error-tailoring machinery of randomized compilation. Classical Solovay-Kitaev implementations produce known word lengths and accumulate coherent approximation errors that degrade fault-tolerant threshold estimates. Kuperberg's 2023-2025 result reduces this via doubly exponential convergence and higher-order commutator decompositions. SCS augments this geometric backbone with a Gibbs-sampled stochastic choice of commutator factors at each recursion level, converting coherent synthesis residuals into incoherent, Pauli-twirl-compatible noise -- a property exploited by RC. Combined with RL-guided pre-synthesis, SCS achieves consistent T-count reductions of 10-25 percent and demonstrates fidelity gains of up to 35 percent on multi-fold Forrelation circuits on trapped-ion hardware such as Sandia QSCOUT. We situate SCS within the complexity-theoretic landscape established by the Raz-Tal oracle separation, arguing that low-error, noise-robust compilation of Forrelation-type circuits constitutes a practical pathway toward demonstrating this separation on physical hardware.