Non-Markovianity induced by Pauli-twirling

• URL: http://arxiv.org/abs/2602.08464v1
• Date: Mon, 09 Feb 2026 10:13:50 GMT
• Title: Non-Markovianity induced by Pauli-twirling
• Authors: Joris Kattemölle, Balázs Gulácsi, Guido Burkard,
• Abstract summary: We study the effects of Pauli twirling on Markovianity.<n>We show that Markovian quantum channels often become non-Markovian after Pauli twirling.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Single snapshot non-Markovianity of Pauli channels [0.3823356975862005]
  Pauli channels are widely used to describe errors in quantum computers.<n>We study multi-qubit Pauli channels from a single snapshot of the dynamics.<n>We find that while the generator always has the same structure as the standard Pauli-Lindblad model, the rates may be negative or complex.
  arXiv  Detail & Related papers  (2026-02-13T17:55:34Z)
• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer.<n>Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• Non-Markovian Noise Suppression Simplified through Channel Representation [0.8639941465436463]
  We introduce a channel representation for arbitrary non-Markovian quantum dynamics, termed the Choi channel.<n>This representation translates the complex dynamics of non-Markovian noise into the familiar picture of noise channels acting on ideal states.<n>We have devised new protocols using Pauli twirling, probabilistic error cancellation and virtual channel purification.
  arXiv  Detail & Related papers  (2024-12-15T15:26:07Z)
• Overcoming the Zero-Rate Hashing Bound with Holographic Quantum Error Correction [40.671162828621426]
  Finding an optimal quantum code under biased noise is a challenging problem.<n> benchmark for this capacity is given by the hashing bound.<n>We show that zero-rate holographic codes, built from hyperbolic tensor networks, fulfill both conditions.
  arXiv  Detail & Related papers  (2024-08-12T15:35:03Z)
• A short note on effective Pauli noise models [0.27195102129095]
  We provide a simple prescription to extract an effective Pauli noise model from classical simulations of a noisy experimental protocol for a unitary gate. This prescription yields the closest Pauli channel approximation to the error channel associated with the gate implementation, as measured by the Frobenius distance between quantum channels.
  arXiv  Detail & Related papers  (2023-11-15T17:18:47Z)
• Emergence of noise-induced barren plateaus in arbitrary layered noise models [44.99833362998488]
  In variational quantum algorithms the parameters of a parameterized quantum circuit are optimized in order to minimize a cost function that encodes the solution of the problem. We discuss how, and in which sense, the phenomenon of noise-induced barren plateaus emerges in parameterized quantum circuits with a layered noise model.
  arXiv  Detail & Related papers  (2023-10-12T15:18:27Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Entanglement-Free Parameter Estimation of Generalized Pauli Channels [10.54626060566304]
  We propose a parameter estimation protocol for generalized Pauli channels acting on $d$-dimensional Hilbert space. The salient features of the proposed method include product probe states and measurements, the number of measurement configurations linear in $d$, minimal post-processing. We show that while measuring generalized Pauli operators the errors caused by the Pauli noise can be modeled as measurement errors.
  arXiv  Detail & Related papers  (2021-02-01T10:12:07Z)
• Spectral Transfer Tensor Method for Non-Markovian Noise Characterization [14.862464401554103]
  We propose an experimental protocol, termed Spectral Transfer Maps (SpecTTM), to accurately predict the non-Markovian measure of any Pauli channels. For Pauli channels, SpecTTM even allows the reconstruction of highly-precised noise power spectrum for qubits.
  arXiv  Detail & Related papers  (2020-12-18T08:10:06Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Fast Estimation of Sparse Quantum Noise [1.933681537640272]
  We present a practical algorithm for estimating the $s$ nonzero Pauli error rates in an $s$-sparse, $n$-qubit Pauli noise channel. We experimentally validate a version of the algorithm that uses simplified Clifford circuits on data from an IBM 14-qubit superconducting device.
  arXiv  Detail & Related papers  (2020-07-15T18:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.