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:2602.08464 · npj Quantum Information

Non-Markovianity induced by Pauli-twirling

Joris Kattemölle, Balázs Gulácsi, Guido Burkard

quant-phSubmitted Feb 9, 2026• Announced Feb 10, 2026• 3 citations
arXivHTMLPDF

Abstract

Noise forms a central obstacle to effective quantum information processing. Recent experimental advances have enabled the tailoring of noise properties through Pauli twirling, transforming arbitrary noise channels into Pauli channels. This underpins theoretical descriptions of fault-tolerant quantum computation and forms an essential tool in noise characterization and error mitigation. Pauli-Lindblad channels have been introduced to aptly parameterize quasi-local Pauli errors across a quantum register, excluding negative Pauli-Lindblad parameters relying on the Markovianity of the underlying noise processes. We point out that caution is required when parameterizing channels as Pauli-Lindblad channels with nonnegative parameters. For this, we study the effects of Pauli twirling on Markovianity. We use the notion of Markovianity of a channel (rather than that of an entire semigroup) and prove a general Pauli channel is non-Markovian if and only if at least one of its Pauli-Lindblad parameters is negative. Using this, we show that Markovian quantum channels often become non-Markovian after Pauli twirling. The Pauli-twirling induced non-Markovianity necessitates the use of negative Pauli-Lindblad parameters for a correct noise description in experimentally realistic scenarios. An important example is the implementation of the $\sqrt{X}$-gate under standard Markovian noise. As such, our results have direct implications for quantum error mitigation protocols that rely on accurate noise characterization.

Comments
9 pages, 2 figures

Related papers

Single snapshot non-Markovianity of Pauli channels

Alireza Seif, Moein Malekakhlagh, Swarnadeep Majumder +1 more

Pauli channels are widely used to describe errors in quantum computers, particularly when noise is shaped via Pauli twirling. A common assumption is that such channels admit a Markovian generator, namely a Pauli-Lindblad model with non-negative rates, but the validity of this assumption has not been systematically examined. Here, using CP-indivisibility as our criterion for non-Markovianity, we study multi-qubit Pauli channels from a single snapshot of the dynamics. We find that while the generator always has the same structure as the standard Pauli-Lindblad model, the rates may be negative or complex. We show that random Pauli channels are almost always non-Markovian, with the probability of encountering a negative rate converging doubly exponentially to unity with the number of qubits. For physically motivated noise models shaped by Pauli twirling, including single-qubit over-rotations and two-qubit amplitude damping errors, we find that negative rates are generic, even when the underlying physical noise is Markovian. We generalize probabilistic error amplification and cancellation to non-Markovian generators, and quantify the sampling overhead introduced by negative and complex rates. Experiments on superconducting qubits confirm that allowing negative rates in the learned noise model yields more accurate predictions than restricting to non-negative rates.

quant-pharXiv:2602.13145•Feb 16, 2026•3 citations

Non-Markovian Noise Suppression Simplified through Channel Representation

Zhenhuan Liu, Yunlong Xiao, Zhenyu Cai

Non-Markovian noise, arising from memory effects in the environment, poses substantial challenges to conventional quantum noise suppression protocols, including quantum error correction and mitigation. We introduce a channel representation for arbitrary non-Markovian quantum dynamics, termed the Choi channel, which translates the complex dynamics of non-Markovian noise into the familiar picture of noise channels. It therefore provides a systematic way to design non-Markovian noise suppression protocols: one can apply existing channel-level error-suppression techniques in the Choi-channel picture and then translate them back to the circuit picture. The performance of the resulting non-Markovian protocols, including their noise-suppression effects and complexity, can often be inherited directly from the corresponding Choi-channel protocols without requiring a separate analysis. With this framework, we devise new protocols using Pauli twirling, probabilistic error cancellation, and virtual channel purification. Pauli twirling reduces non-Markovian noise to noise with only classical temporal correlations; probabilistic error cancellation can fully cancel non-Markovian noise; and virtual channel purification can suppress non-Markovian noise without detailed knowledge of its specific form. Through these examples, the Choi channel serves as a foundational bridge for systematically converting existing channel-level techniques into non-Markovian noise suppression protocols.

arXiv:2412.11220•Dec 15, 2024•17 citations

Hard decoding algorithm for optimizing thresholds under general Markovian noise

Christopher Chamberland, Joel J. Wallman, Stefanie J. Beale +1 more

Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.

arXiv:1612.02830•Physical Review A•Apr 21, 2017•38 citations

Operational Markovianization in randomized benchmarking

Pedro Figueroa–Romero, Miha Papič, A Auer +3 more

Abstract A crucial task to obtain optimal and reliable quantum devices is to quantify their overall performance. The average fidelity of quantum gates is a particular figure of merit that can be estimated efficiently by randomized benchmarking (RB). However, the concept of gate-fidelity itself relies on the crucial assumption that noise behaves in a predictable, time-local, or so-called Markovian manner, whose breakdown can naturally become the leading source of errors as quantum devices scale in size and depth. We analytically show that error suppression techniques such as dynamical decoupling (DD) and Pauli-twirling can operationally Markovianize RB: (i) fast DD reduces non-Markovian RB to an exponential decay plus longer-time corrections, while on the other hand, (ii) Pauli-twirling generally does not affect the average, but (iii) it always suppresses the variance of such RB outputs. We demonstrate these effects numerically with a qubit noise model. Our results show that simple and efficient error suppression methods can simultaneously tame non-Markovian noise and allow for standard and reliable gate quality estimation, a fundamentally important task in the path toward fully functional quantum devices.

arXiv:2305.04704•Quantum Science and Technology•Apr 16, 2024•11 citations

Spatiotemporal Pauli processes: Quantum combs for modeling correlated noise in quantum error correction

John F Kam, Angus Southwell, Spiro Gicev +2 more

Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance $19$. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.

quant-pharXiv:2603.05474•Mar 6, 2026•6 citations

Spectral-Transfer-Tensor Method for Characterizing Non-Markovian Noise

Yuqin Chen, Yi-Cong Zheng, Shengyu Zhang +1 more

With continuing improvements on the quality of fabricated quantum devices, it becomes increasingly crucial to analyze noisy quantum process in greater details such as characterizing the non-Markovianity in a quantitative manner. In this work, we propose an experimental protocol, termed spectral transfer tensor maps (STTMs), to accurately predict the Rivas-Huelga-Plenio non-Markovian measure of any Pauli channels without state preparation and measurement errors. In fact, for Pauli channels, STTM even allows the reconstruction of a highly precise noise power spectrum for qubits. At last, we also discuss how STTM can be useful to approximately characterize non-Markovianity of non-Pauli channels via Pauli twirling in an optimal basis.

arXiv:2012.10094•Physical Review Applied•Jun 2, 2022•2 citations
Noise forms a central obstacle to effective quantum information processing. Recent experimental advances have enabled the tailoring of noise properties through Pauli twirling, transforming arbitrary noise channels into Pauli channels. This underpins theoretical descriptions of fault-tolerant quantum computation and forms an essential tool in noise characterization and error mitigation. Pauli-Lindblad channels have been introduced to aptly parameterize quasi-local Pauli errors across a quantum register, excluding negative Pauli-Lindblad parameters relying on the Markovianity of the underlying noise processes. We point out that caution is required when parameterizing channels as Pauli-Lindblad channels with nonnegative parameters. For this, we study the effects of Pauli twirling on Markovianity. We use the notion of Markovianity of a channel (rather than that of an entire semigroup) and prove a general Pauli channel is non-Markovian if and only if at least one of its Pauli-Lindblad parameters is negative. Using this, we show that Markovian quantum channels often become non-Markovian after Pauli twirling. The Pauli-twirling induced non-Markovianity necessitates the use of negative Pauli-Lindblad parameters for a correct noise description in experimentally realistic scenarios. An important example is the implementation of the X\sqrt{X}X​-gate under standard Markovian noise. As such, our results have direct implications for quantum error mitigation protocols that rely on accurate noise characterization.
Pauli channels are widely used to describe errors in quantum computers, particularly when noise is shaped via Pauli twirling. A common assumption is that such channels admit a Markovian generator, namely a Pauli-Lindblad model with non-negative rates, but the validity of this assumption has not been systematically examined. Here, using CP-indivisibility as our criterion for non-Markovianity, we study multi-qubit Pauli channels from a single snapshot of the dynamics. We find that while the generator always has the same structure as the standard Pauli-Lindblad model, the rates may be negative or complex. We show that random Pauli channels are almost always non-Markovian, with the probability of encountering a negative rate converging doubly exponentially to unity with the number of qubits. For physically motivated noise models shaped by Pauli twirling, including single-qubit over-rotations and two-qubit amplitude damping errors, we find that negative rates are generic, even when the underlying physical noise is Markovian. We generalize probabilistic error amplification and cancellation to non-Markovian generators, and quantify the sampling overhead introduced by negative and complex rates. Experiments on superconducting qubits confirm that allowing negative rates in the learned noise model yields more accurate predictions than restricting to non-negative rates.
Non-Markovian noise, arising from memory effects in the environment, poses substantial challenges to conventional quantum noise suppression protocols, including quantum error correction and mitigation. We introduce a channel representation for arbitrary non-Markovian quantum dynamics, termed the Choi channel, which translates the complex dynamics of non-Markovian noise into the familiar picture of noise channels. It therefore provides a systematic way to design non-Markovian noise suppression protocols: one can apply existing channel-level error-suppression techniques in the Choi-channel picture and then translate them back to the circuit picture. The performance of the resulting non-Markovian protocols, including their noise-suppression effects and complexity, can often be inherited directly from the corresponding Choi-channel protocols without requiring a separate analysis. With this framework, we devise new protocols using Pauli twirling, probabilistic error cancellation, and virtual channel purification. Pauli twirling reduces non-Markovian noise to noise with only classical temporal correlations; probabilistic error cancellation can fully cancel non-Markovian noise; and virtual channel purification can suppress non-Markovian noise without detailed knowledge of its specific form. Through these examples, the Choi channel serves as a foundational bridge for systematically converting existing channel-level techniques into non-Markovian noise suppression protocols.
Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.
Abstract A crucial task to obtain optimal and reliable quantum devices is to quantify their overall performance. The average fidelity of quantum gates is a particular figure of merit that can be estimated efficiently by randomized benchmarking (RB). However, the concept of gate-fidelity itself relies on the crucial assumption that noise behaves in a predictable, time-local, or so-called Markovian manner, whose breakdown can naturally become the leading source of errors as quantum devices scale in size and depth. We analytically show that error suppression techniques such as dynamical decoupling (DD) and Pauli-twirling can operationally Markovianize RB: (i) fast DD reduces non-Markovian RB to an exponential decay plus longer-time corrections, while on the other hand, (ii) Pauli-twirling generally does not affect the average, but (iii) it always suppresses the variance of such RB outputs. We demonstrate these effects numerically with a qubit noise model. Our results show that simple and efficient error suppression methods can simultaneously tame non-Markovian noise and allow for standard and reliable gate quality estimation, a fundamentally important task in the path toward fully functional quantum devices.
Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance 191919. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.
With continuing improvements on the quality of fabricated quantum devices, it becomes increasingly crucial to analyze noisy quantum process in greater details such as characterizing the non-Markovianity in a quantitative manner. In this work, we propose an experimental protocol, termed spectral transfer tensor maps (STTMs), to accurately predict the Rivas-Huelga-Plenio non-Markovian measure of any Pauli channels without state preparation and measurement errors. In fact, for Pauli channels, STTM even allows the reconstruction of a highly precise noise power spectrum for qubits. At last, we also discuss how STTM can be useful to approximately characterize non-Markovianity of non-Pauli channels via Pauli twirling in an optimal basis.