Pauli Transfer Matrix in Quantum Channels

• Pauli Transfer Matrix (PTM) is a matrix representation that fully characterizes quantum channels using an orthonormal Pauli basis for efficient channel analysis.
• The PTM approach underpins efficient quantum process tomography and benchmarking by reconstructing channel dynamics with reduced experimental configurations.
• PTM also enables advanced quantum machine learning techniques by providing an interpretable framework for channel estimation and reservoir computing.

The Pauli Transfer Matrix (PTM) is a real matrix representation of quantum channels—completely positive trace-preserving (CPTP) maps—expressed in the multi-qubit Pauli operator basis. It provides an explicit and tractable framework for describing the evolution of quantum states and processes, enabling detailed analysis of features such as noise, decoherence, and system-environment interactions in both theory and experiment. The PTM formalism also underpins efficient algorithmic approaches for quantum process tomography, benchmarking, learning, and the analysis of quantum machine learning architectures, particularly in the context of quantum reservoir computing.

1. Formal Definition and Structure

Let $\mathcal{H} \cong (\mathbb{C}^2)^{\otimes n}$ denote the Hilbert space of $n$ qubits, $d = 2^n$. The orthonormal $n$-qubit Pauli basis $\{P_k\}_{k=0}^{d^2-1}$ (with $P_0 = I^{\otimes n}$, $P_k$ the $n$-fold tensor products of $I,X,Y,Z$) satisfies $\mathrm{Tr}[P_i P_j] = d\,\delta_{ij}$.

Given a density operator $n$0, its Pauli expansion is: $n$1 Collating $n$2 into a real vector $n$3, any linear quantum channel $n$4 (Schrödinger picture) acts as: $n$5 where $n$6 is the PTM, a real $n$7 matrix with entries: $n$8 The PTM thus fully characterizes $n$9 in the Pauli basis. For any operator $d = 2^n$0, one has $d = 2^n$1 (Hantzko et al., 2024, Gross et al., 20 Feb 2026, Caro, 2022, Ye et al., 17 Oct 2025).

2. Properties and Algebraic Features

The PTM inherits and reflects key structural properties of quantum channels:

• Realness: $d = 2^n$2 is a real matrix; Hermitian operators map to Hermitian operators.
• Trace Preservation: $d = 2^n$3 is TP iff the first row (corresponding to $d = 2^n$4) is $d = 2^n$5: $d = 2^n$6.
• Unitality: $d = 2^n$7 is unital ($d = 2^n$8) iff the first column is $d = 2^n$9: $n$0 (Hantzko et al., 2024, Ye et al., 17 Oct 2025).
• Composition: PTMs compose as $n$1 (Hantzko et al., 2024, Caro, 2022).
• Tensor Product Structure: For product channels, the PTM factorizes as $n$2 (Hantzko et al., 2024).
• Complete Positivity: CP is not a simple positivity constraint on $n$3, but equivalent to positivity of the Choi or Chi matrix derived from $n$4.

For CPTP channels, $n$5 admits a block-affine structure: $n$6 with $n$7 acting on the traceless sector ($n$8) and $n$9 implies non-unitality (Gross et al., 20 Feb 2026, Kobayashi et al., 2024).

3. PTM in Quantum Process Tomography and Channel Estimation

The PTM facilitates efficient and interpretable quantum process tomography (QPT):

• Standard Approach: Full QPT reconstructs $\{P_k\}_{k=0}^{d^2-1}$0 by preparing a complete set of input states and measuring outputs in the Pauli basis. This requires $\{P_k\}_{k=0}^{d^2-1}$1 settings (Roncallo et al., 2022, Hantzko et al., 2024).
• Direct PTM Reconstruction (DPTM): By using specially constructed mixed input states $\{P_k\}_{k=0}^{d^2-1}$2, each PTM entry $\{P_k\}_{k=0}^{d^2-1}$3 can be extracted from at most two experimental configurations: $\{P_k\}_{k=0}^{d^2-1}$4, where $\{P_k\}_{k=0}^{d^2-1}$5 is the measured expectation $\{P_k\}_{k=0}^{d^2-1}$6 (Roncallo et al., 2022).
• Multipass QPT: By applying $\{P_k\}_{k=0}^{d^2-1}$7 repetitions of a gate and reconstructing $\{P_k\}_{k=0}^{d^2-1}$8 ($\{P_k\}_{k=0}^{d^2-1}$9 = error PTM), systematic errors (SPAM, readout) can be suppressed and single-shot PTM extracted via perturbative or Sylvester equation methods (Stanchev et al., 2024).

The PTM approach supports tailored protocols for benchmarking Clifford and non-Clifford gates, such as Pauli-Transfer-Character Benchmarking (PTCB), which estimates products $P_0 = I^{\otimes n}$0 via random Pauli twirling and ratio-of-expectation measurements, yielding SPAM-robust fidelity estimates (Ye et al., 17 Oct 2025).

4. Conversion from Other Channel Representations

The PTM provides a unifying representation for channels specified in various forms:

• Chi (Process) Matrix: If $P_0 = I^{\otimes n}$1, then $P_0 = I^{\otimes n}$2 (Hantzko et al., 2024).
• Choi Matrix: $P_0 = I^{\otimes n}$3; PTM recovered as $P_0 = I^{\otimes n}$4.
• Kraus Operators: For $P_0 = I^{\otimes n}$5, $P_0 = I^{\otimes n}$6.
• Superoperator (Canonical): The PTM is related to the canonical matrix representation by a tensorized basis change (Hantzko et al., 2024, Caro, 2022).

Tensorized algorithms using cumulative weights and recursive decomposition yield conversion cost $P_0 = I^{\otimes n}$7 for $P_0 = I^{\otimes n}$8 Kraus operators over $P_0 = I^{\otimes n}$9 qubits (Hantzko et al., 2024).

5. PTM in Quantum Machine Learning and Reservoir Computing

The PTM formalism underlies the feature-space analysis of quantum reservoir computing, quantum extreme learning machines (QELMs), and related architectures (Gross et al., 20 Feb 2026, Kobayashi et al., 2024):

• Feature Encoding: The classical input $P_k$0 is mapped to a nonlinear feature vector in the Pauli basis via the encoding channel’s PTM, $P_k$1.
• Linear Mixing: The internal quantum reservoir dynamics apply a linear transformation to features, governed by the reservoir’s PTM.
• Measurement and Readout: A subset of Pauli observables is measured, corresponding to a row selection of the PTM, and the final output is obtained by classical linear regression.
• Decodability: The geometric decodability score $P_k$2 quantifies isolation and reconstructibility of feature $P_k$3.
• Temporal Multiplexing: Measurements at multiple time points under different evolutions are expressed as stacked PTMs.

In these architectures, the feature library is determined by the Pauli expectations attainable via encoding, while the reservoir linearly scrambles these features. The PTM formalism provides an interpretable map from classical inputs through nonlinear Pauli features and linear quantum evolution to the ultimately read-out observables (Gross et al., 20 Feb 2026).

6. Physical Interpretations: Coherence Influx, Memory, and Spectral Properties

PTMs illuminate dynamical properties and open-system effects:

• Coherence Influx: The affine term $P_k$4 in the PTM block form ($P_k$5) represents the nonunital “coherence influx.” This term is necessary for input sensitivity and nonstationary echo-state property (ESP) in quantum reservoir computers (Kobayashi et al., 2024).
• Spectral Radius and Memory: The largest eigenvalue modulus $P_k$6 of the traceless sector dictates the fading memory and dynamical stability. $P_k$7 is necessary for the system to possess the fading memory property and for convergence (Kobayashi et al., 2024).
• Toy Model (mRC): The one-dimensional affine recursive model $P_k$8 encapsulates these roles, with memory capacity $P_k$9 controlled by $n$0; $n$1 is required for non-trivial response (Kobayashi et al., 2024).

7. Quantum Learning, Tomography, and Algorithmic Complexity

The PTM presents a natural pathway for channel learning, with implications for quantum advantage:

• Choi-state Shadow Tomography: All PTM entries can be estimated in parallel using $n$2 copies of the Choi state via Pauli shadow tomography, leveraging the Choi–Jamiolkowski isomorphism for sample-efficient estimation (Caro, 2022). This is exponentially more efficient than any memoryless classical strategy, which requires $n$3 samples.
• Hamiltonian Learning: By interpolating time-dependent Pauli expectation profiles, one reconstructs the unknown Hamiltonian $n$4 underlying a process from short-time PTMs, with the sample complexity scaling as $n$5 for Hamiltonian norm $n$6 (Caro, 2022).
• PTM in Benchmarking: PTM-based benchmarking such as PTCB directly measures fidelity-critical components without requiring full tomography, and provides robust bounds even for non-Clifford gates with $n$7 (Ye et al., 17 Oct 2025).

---

The PTM formalism thus serves as a central, mathematically robust, and computationally tractable representation for quantum channels, supporting not only detailed theoretical analysis but also scalable and interpretable experimental protocols across diverse areas of quantum information science.