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:2308.00188 · PLoS ONE

Quantum simulation of Pauli channels and dynamical maps: Algorithm and implementation

Tomás Basile, Carlos Pineda

Published Apr 10, 2024• 4 citations
arXivHTMLPDF

Abstract

Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps (parametrized Pauli channels). A parametrized quantum circuit is employed to accommodate for dynamical maps. We also establish the mathematical conditions for an N-qubit transformation to be achievable using a parametrized circuit where only one single-qubit operation depends on the parameter. The implementation of the proposed circuit is demonstrated using IBM's quantum computers for the case of one qubit, and the fidelity of this implementation is reported.

DOI
10.1371/journal.pone.0297210

Related papers

Theory and Methodology of Information Security: Quantum Gates and Pauli Matrices

Mikhail Pavlov

Abstract In the field of quantum computing, the study of single-qubit quantum gates is fundamental to constructing quantum circuits and algorithms. Single-qubit gates, such as the X, Y, and Z gates, enable precise manipulation of qubit states, which can be visualized on the Bloch sphere. The use of matrix representations, including Pauli matrices, provides a rigorous mathematical framework for analyzing gate operations and their effects within quantum circuits. This work also explores the application of the Quantum Fourier Transform (QFT) and introduces the Hadamard test subroutine as a practical method for evaluating quantum states. The presented algorithms were successfully implemented on a 5-qubit IBM quantum computer, demonstrating both the theoretical foundations and practical significance of quantum gates and Pauli matrices in modern quantum computation and their potential role in secure information processing.

•Mar 4, 2026•0 citations

Efficient Simulation of Parametrized Quantum Circuits under Nonunital Noise through Pauli Backpropagation

Victor Martinez, Armando Angrisani, Ekaterina Aleksandrovna Pankovets +2 more

As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient classical simulation algorithms possible. Among the most promising approaches are Pauli backpropagation algorithms, which have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits-a leading contender for near-term quantum advantage-under random circuit assumptions and depolarizing noise. However, their efficiency was not previously established for more realistic nonunital noise models, such as amplitude damping, that better capture noise on existing hardware. Here, we close this gap by adapting Pauli backpropagation to nonunital noise, proving that it remains efficient even under these more challenging conditions. Our proof leverages a refined combinatorial analysis to handle the complexities introduced by nonunital channels, thus strengthening Pauli backpropagation as a powerful tool for simulating near-term quantum devices.

arXiv:2501.13050•Physical Review Letters•May 28, 2025•9 citations

Pauli Cloners for Pauli Channels

S. F. Kerstan, M. Gallezot, T. Decker +2 more

We present a quantum circuit architecture for the one-to-two cloning of $N$-qubit registers. It implements the broad class of Pauli cloners by extending the Niu--Griffiths architecture to multi-qubit systems. In the single-qubit case, we provide explicit constructions for asymmetric universal, phase covariant and biased cloners. We explore the fundamental relationship between Pauli errors, mutually unbiased bases and Pauli cloning. Furthermore, we demonstrate how Pauli cloners can be tailored to specific noise models in the context of quantum communication, especially quantum key distribution.

quant-pharXiv:2602.00646•Feb 3, 2026•0 citations

Accurate modeling of noise in quantum error correcting circuits

Mauricio Gutierrez Arguedas

A universal, scalable quantum computer will require the use of quantum error correction in order to achieve fault tolerance. The assessment and comparison of error-correcting strategies is performed by classical simulation. However, due to the prohibitive exponential scaling of general quantum circuits, simulations are restrained to specific subsets of quantum operations. This creates a gap between accuracy and efficiency which is particularly problematic when modeling noise, because most realistic noise models are not efficiently simulable on a classical computer. We have introduced extensions to the Pauli channel, the traditional error channel employed to model noise in simulations of quantum circuits. These expanded error channels are still computationally tractable to simulate, but result in more accurate approximations to realistic error channels at the single qubit level. Using the Steane [[7,1,3]] code, we have also investigated the behavior of these expanded channels at the logical error-corrected level. We have found that it depends strongly on whether the error is incoherent or coherent. In general, the Pauli channel will be an excellent approximation to incoherent channels, but an unsatisfactory one for coherent channels, especially because it severely underestimates the magnitude of the error. Finally, we also studied the honesty and accuracy of the expanded channels at the logical level. Our results suggest that these measures can be employed to generate lower and upper bounds to a quantum code's threshold under the influence of a specific error channel.

•Nov 16, 2015•0 citations

Experimental quantum channel simulation

He Lu, Chang Liu, Dongsheng Wang +9 more

Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported quantum channel simulator consists of four single-qubit gates and one controlled-not gate. All types of quantum channels can be decomposed by the algorithm and implemented on this device. We deploy our system to simulate various quantum channels, such as quantum-noise channels and weak quantum measurement. Our results advance experimental quantum channel simulation, which is integral to the goal of quantum information processing.

arXiv:1505.02879•Physical Review A•Apr 10, 2017•34 citations

Phased outcome-complete simulation

Vadym Kliuchnikov, Adam Paetznick, Marcus P. da Silva

We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased outcome-complete simulation. The original algorithm enabled equivalence checking of stabilizer circuits with intermediate measurements and conditional Pauli corrections for all input states and all measurement outcomes simultaneously, but it tracked quantum states only up to a global phase. Our generalization removes this limitation and enables equivalence checking for an important family of non-stabilizer circuits: stabilizer circuits augmented with single-qubit rotations $\exp(iαZ)$ by symbolic angles. Two such circuits are equivalent if they implement the same quantum channel for all values of the symbolic angles and all measurement outcomes, given a one-to-one correspondence between rotation angles in the two circuits and a mapping between measurement outcomes. This model enables testing of compilation algorithms that transform the Clifford portions of a computation while preserving rotation angles. Examples include Pauli-based computation, edge-disjoint path compilation for surface codes, and custom compilation strategies for reversible circuits such as adders, multipliers, and table lookups. Our efficient classical verification methods extend naturally to circuits with outcome-parity-conditional Pauli gates and intermediate measurements, features that are ubiquitous in fault-tolerant quantum computing but are rarely addressed by existing equivalence-checking approaches.

quant-pharXiv:2603.24717•Mar 27, 2026•0 citations
Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps (parametrized Pauli channels). A parametrized quantum circuit is employed to accommodate for dynamical maps. We also establish the mathematical conditions for an N-qubit transformation to be achievable using a parametrized circuit where only one single-qubit operation depends on the parameter. The implementation of the proposed circuit is demonstrated using IBM's quantum computers for the case of one qubit, and the fidelity of this implementation is reported.
Abstract In the field of quantum computing, the study of single-qubit quantum gates is fundamental to constructing quantum circuits and algorithms. Single-qubit gates, such as the X, Y, and Z gates, enable precise manipulation of qubit states, which can be visualized on the Bloch sphere. The use of matrix representations, including Pauli matrices, provides a rigorous mathematical framework for analyzing gate operations and their effects within quantum circuits. This work also explores the application of the Quantum Fourier Transform (QFT) and introduces the Hadamard test subroutine as a practical method for evaluating quantum states. The presented algorithms were successfully implemented on a 5-qubit IBM quantum computer, demonstrating both the theoretical foundations and practical significance of quantum gates and Pauli matrices in modern quantum computation and their potential role in secure information processing.
As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient classical simulation algorithms possible. Among the most promising approaches are Pauli backpropagation algorithms, which have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits-a leading contender for near-term quantum advantage-under random circuit assumptions and depolarizing noise. However, their efficiency was not previously established for more realistic nonunital noise models, such as amplitude damping, that better capture noise on existing hardware. Here, we close this gap by adapting Pauli backpropagation to nonunital noise, proving that it remains efficient even under these more challenging conditions. Our proof leverages a refined combinatorial analysis to handle the complexities introduced by nonunital channels, thus strengthening Pauli backpropagation as a powerful tool for simulating near-term quantum devices.
We present a quantum circuit architecture for the one-to-two cloning of NNN-qubit registers. It implements the broad class of Pauli cloners by extending the Niu--Griffiths architecture to multi-qubit systems. In the single-qubit case, we provide explicit constructions for asymmetric universal, phase covariant and biased cloners. We explore the fundamental relationship between Pauli errors, mutually unbiased bases and Pauli cloning. Furthermore, we demonstrate how Pauli cloners can be tailored to specific noise models in the context of quantum communication, especially quantum key distribution.
A universal, scalable quantum computer will require the use of quantum error correction in order to achieve fault tolerance. The assessment and comparison of error-correcting strategies is performed by classical simulation. However, due to the prohibitive exponential scaling of general quantum circuits, simulations are restrained to specific subsets of quantum operations. This creates a gap between accuracy and efficiency which is particularly problematic when modeling noise, because most realistic noise models are not efficiently simulable on a classical computer. We have introduced extensions to the Pauli channel, the traditional error channel employed to model noise in simulations of quantum circuits. These expanded error channels are still computationally tractable to simulate, but result in more accurate approximations to realistic error channels at the single qubit level. Using the Steane [[7,1,3]] code, we have also investigated the behavior of these expanded channels at the logical error-corrected level. We have found that it depends strongly on whether the error is incoherent or coherent. In general, the Pauli channel will be an excellent approximation to incoherent channels, but an unsatisfactory one for coherent channels, especially because it severely underestimates the magnitude of the error. Finally, we also studied the honesty and accuracy of the expanded channels at the logical level. Our results suggest that these measures can be employed to generate lower and upper bounds to a quantum code's threshold under the influence of a specific error channel.
Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported quantum channel simulator consists of four single-qubit gates and one controlled-not gate. All types of quantum channels can be decomposed by the algorithm and implemented on this device. We deploy our system to simulate various quantum channels, such as quantum-noise channels and weak quantum measurement. Our results advance experimental quantum channel simulation, which is integral to the goal of quantum information processing.
We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased outcome-complete simulation. The original algorithm enabled equivalence checking of stabilizer circuits with intermediate measurements and conditional Pauli corrections for all input states and all measurement outcomes simultaneously, but it tracked quantum states only up to a global phase. Our generalization removes this limitation and enables equivalence checking for an important family of non-stabilizer circuits: stabilizer circuits augmented with single-qubit rotations exp⁡(iαZ)\exp(iαZ)exp(iαZ) by symbolic angles. Two such circuits are equivalent if they implement the same quantum channel for all values of the symbolic angles and all measurement outcomes, given a one-to-one correspondence between rotation angles in the two circuits and a mapping between measurement outcomes. This model enables testing of compilation algorithms that transform the Clifford portions of a computation while preserving rotation angles. Examples include Pauli-based computation, edge-disjoint path compilation for surface codes, and custom compilation strategies for reversible circuits such as adders, multipliers, and table lookups. Our efficient classical verification methods extend naturally to circuits with outcome-parity-conditional Pauli gates and intermediate measurements, features that are ubiquitous in fault-tolerant quantum computing but are rarely addressed by existing equivalence-checking approaches.