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:2212.08677 · Physical Review A

Noisy stabilizer formalism

Maria Flors Mor-Ruiz, Wolfgang Dür

Published Mar 27, 2023• 14 citations
arXivHTMLPDF

Abstract

Despite the exponential overhead to describe general multiqubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilized. The stabilizer formalism and the Gottesman-Knill theorem, where pure stabilizer or graph states are manipulated by Clifford operations and Pauli measurements, are prominent examples, and these states play a major role in many applications in quantum technologies. Here we develop a noisy stabilizer formalism, i.e., a method that allows one to efficiently describe and follow not only pure states under Clifford operations and Pauli measurements but also Pauli noise processes acting on such stabilizer states, including uncorrelated and correlated dephasing and single- or multiple-qubit depolarizing noise. The method scales linearly in the number of qubits of the initial state, but exponentially in the size of the target state. Thus, whenever a noisy stabilizer state is manipulated by means of local Pauli measurements such that a multipartite entangled state of a few qubits is generated, one can efficiently describe the resulting state.

DOI
10.1103/physreva.107.032424

Related papers

Extensions and Limitations of the Noisy Stabilizer Formalism

Matti, Jasmin

The stabilizer formalism is a central framework in quantum computing and one of the key building blocks for fault-tolerant quantum computers. According to the Gottesman–Knill theorem, we can efficiently simulate any quantum system consisting of stabilizer states, Clifford gates, and Pauli measurements on a classical computer. A key challenge in developing robust quantum technologies is that physical quantum systems are unavoidably affected by noise, which degrades quantum information. Accurate noise modeling is therefore essential. For stabilizer states, the noisy stabilizer formalism has recently been introduced as a framework for efficiently describing the evolution of graph states subject to Pauli-diagonal noise under Clifford operations and Pauli measurements. In this thesis, we explore and extend this formalism in two directions. First, we generalize the method from graph states to arbitrary stabilizer states, thereby extending the Gottesman-Knill theorem to noisy scenarios. Second, we extend the formalism to handle noise models beyond Pauli-diagonal channels. Moreover, we study the applicability of the noisy stabilizer formalism to entanglement purification protocols.

•Jan 1, 2025•0 citations

Qudit noisy stabilizer formalism

Paul Aigner, Maria Flors Mor-Ruiz, Wolfgang Dür

We introduce the qudit noisy stabilizer formalism, a framework for efficiently describing the evolution of stabilizer states in prime-power dimensions subject to generalized Pauli-diagonal noise under Clifford operations and generalized Pauli measurements. For arbitrary dimensions, the formalism remains applicable, though restricted to a subset of stabilizer states and operations. The computational complexity scales linearly with the number of qudits in the initial state and exponentially with the number of qudits in the final state. This ensures that when noisy qudit stabilizer states evolve via generalized Pauli measurements and Clifford operations to generate multipartite entangled states of a few qudits, their description remains efficient. We demonstrate this by analyzing the generation of a generalized Bell pair from a noisy linear cluster state subject to two distinct noise sources acting on each of the qudits.

arXiv:2505.03889•Physical Review A•Jul 14, 2025•2 citations

Approximation of realistic errors by Clifford channels and Pauli measurements

Mauricio Gutiérrez, Lukas Svec, Alexander Vargo +1 more

The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates randomly throughout the circuit. Although convenient, these channels are poor approximations of common, realistic channels such as amplitude damping. Here we analyze a larger set of efficiently simulable error channels by allowing the random insertion of any one-qubit gate or measurement that can be efficiently simulated within the stabilizer formalism. Our error channels are shown to be a viable method for accurately approximating realistic error channels.

arXiv:1207.0046•Physical Review A•Mar 22, 2013•63 citations

Localizing genuine multipartite entanglement in noisy stabilizer states

K J Harikrishnan, Amit Kumar Pal

Characterizing large noisy multiparty quantum states using genuine multipartite entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multipartite entanglement localized over a chosen multiparty subsystem of multiqubit stabilizer states in the noiseless and noisy scenarios. In the absence of noise, adopting a graph-based technique, we perform the calculation for arbitrary graph states as representatives of the stabilizer states and show that the graph operations required for the calculation have a polynomial scaling with the system size. As demonstrations, we compute the localized genuine multipartite entanglement over subsystems of large graphs having linear, ladder, and square structures. We also extend the calculation for graph states subjected to single-qubit Markovian or non-Markovian Pauli noise on all qubits and demonstrate, for a specific lower bound of the localizable genuine multipartite entanglement corresponding to a specific Pauli measurement setup, the existence of a critical noise strength beyond which all of the postmeasured states are biseparable. The calculation is also useful for arbitrary large stabilizer states under noise due to the local unitary connection between stabilizer states and graph states. We demonstrate this by considering a toric code defined on a square lattice and computing a lower bound of localizable genuine multipartite entanglement over a nontrivial loop of the code. Similar to the graph states, we show the existence of the critical noise strength in this case also and discuss its interesting features.

arXiv:2211.01064•Physical Review A•Sep 5, 2023•5 citations

Learning Noise-Robust Stabilizer Structure via Bell Sampling

Letian Tang, Thomas Steckmann

Bell sampling efficiently learns the stabilizer group, and hence the stabilizer nullity, of pure states with little magic, a primitive underlying tomography and certification of low-magic states. Real devices, however, only prepare noisy images of the target, which we model as a Pauli channel acting on the ideal state; the resulting noisy state generically has no exact Pauli stabilizers. Existing structure learners for mixed states rely on such exact stabilizers. Agnostic tomography does not, but its guarantees scale exponentially in the nullity $t$. We show that the ideal stabilizer group remains encoded in the noisy state as the set of Pauli operators under which it is invariant. We give Bell-sampling algorithms that learn the group to accuracy $\varepsilon$ for states of nullity at most $t$. The difficulty is that noisy samples break the group structure pure-state learners rely on, so more samples can erase structure rather than reveal it. We resolve this with a finder-verifier scheme that extracts stabilizer structure from partially corrupted sample batches while certifying proposed updates. For sufficiently weak global depolarizing noise, both samples and runtime are $\mathrm{poly}(n,t,1/\varepsilon)$ when the channel's total error probability is at most of order $\varepsilon n/t$. Up to a constant total error probability ($\approx 0.16$), samples remain polynomial while classical processing costs $2^t$, and for any error probability below one a $4^t$ overhead suffices. Arbitrary Pauli channels exhibit the same three regimes, with more restrictive thresholds. For weak Pauli noise, this closes much of the gap between agnostic learners such as stabilizer bootstrapping and polynomial pure-state algorithms.

quant-pharXiv:2610.03307•Oct 5, 2026•1 citation

On the stabilizer formalism and its generalization

Éloi Descamps, Borivoje Dakić

Abstract The standard stabilizer formalism provides a setting to show that quantum computations restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman–Knill theorem. This work analyzes the mathematical structure behind this theorem to find possible generalizations and derivation of constraints required for constructing a non-trivial generalized Clifford group. We prove that if the closure of the stabilizing set is dense in the set of SU(d) transformations, then the associated Clifford group is trivial, consisting only of local gates and permutations of subsystems. This result demonstrates the close relationship between the density of the stabilizing set and the simplicity of the corresponding Clifford group. We apply the analysis to investigate stabilization with binary observables for qubits and find that the formalism is equivalent to the standard stabilization for a low number of qubits. Based on the observed patterns, we conjecture that a large class of generalized stabilizer states are equivalent to the standard ones. Our results provide better insights into the structure of Gottesman–Knill-type results, consequently allowing us to draw a sharper line between quantum and classical computation.

arXiv:2309.09815•Journal of Physics A Mathematical and Theoretical•Oct 11, 2024•2 citations
Despite the exponential overhead to describe general multiqubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilized. The stabilizer formalism and the Gottesman-Knill theorem, where pure stabilizer or graph states are manipulated by Clifford operations and Pauli measurements, are prominent examples, and these states play a major role in many applications in quantum technologies. Here we develop a noisy stabilizer formalism, i.e., a method that allows one to efficiently describe and follow not only pure states under Clifford operations and Pauli measurements but also Pauli noise processes acting on such stabilizer states, including uncorrelated and correlated dephasing and single- or multiple-qubit depolarizing noise. The method scales linearly in the number of qubits of the initial state, but exponentially in the size of the target state. Thus, whenever a noisy stabilizer state is manipulated by means of local Pauli measurements such that a multipartite entangled state of a few qubits is generated, one can efficiently describe the resulting state.
The stabilizer formalism is a central framework in quantum computing and one of the key building blocks for fault-tolerant quantum computers. According to the Gottesman–Knill theorem, we can efficiently simulate any quantum system consisting of stabilizer states, Clifford gates, and Pauli measurements on a classical computer. A key challenge in developing robust quantum technologies is that physical quantum systems are unavoidably affected by noise, which degrades quantum information. Accurate noise modeling is therefore essential. For stabilizer states, the noisy stabilizer formalism has recently been introduced as a framework for efficiently describing the evolution of graph states subject to Pauli-diagonal noise under Clifford operations and Pauli measurements. In this thesis, we explore and extend this formalism in two directions. First, we generalize the method from graph states to arbitrary stabilizer states, thereby extending the Gottesman-Knill theorem to noisy scenarios. Second, we extend the formalism to handle noise models beyond Pauli-diagonal channels. Moreover, we study the applicability of the noisy stabilizer formalism to entanglement purification protocols.
We introduce the qudit noisy stabilizer formalism, a framework for efficiently describing the evolution of stabilizer states in prime-power dimensions subject to generalized Pauli-diagonal noise under Clifford operations and generalized Pauli measurements. For arbitrary dimensions, the formalism remains applicable, though restricted to a subset of stabilizer states and operations. The computational complexity scales linearly with the number of qudits in the initial state and exponentially with the number of qudits in the final state. This ensures that when noisy qudit stabilizer states evolve via generalized Pauli measurements and Clifford operations to generate multipartite entangled states of a few qudits, their description remains efficient. We demonstrate this by analyzing the generation of a generalized Bell pair from a noisy linear cluster state subject to two distinct noise sources acting on each of the qudits.
The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates randomly throughout the circuit. Although convenient, these channels are poor approximations of common, realistic channels such as amplitude damping. Here we analyze a larger set of efficiently simulable error channels by allowing the random insertion of any one-qubit gate or measurement that can be efficiently simulated within the stabilizer formalism. Our error channels are shown to be a viable method for accurately approximating realistic error channels.
Characterizing large noisy multiparty quantum states using genuine multipartite entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multipartite entanglement localized over a chosen multiparty subsystem of multiqubit stabilizer states in the noiseless and noisy scenarios. In the absence of noise, adopting a graph-based technique, we perform the calculation for arbitrary graph states as representatives of the stabilizer states and show that the graph operations required for the calculation have a polynomial scaling with the system size. As demonstrations, we compute the localized genuine multipartite entanglement over subsystems of large graphs having linear, ladder, and square structures. We also extend the calculation for graph states subjected to single-qubit Markovian or non-Markovian Pauli noise on all qubits and demonstrate, for a specific lower bound of the localizable genuine multipartite entanglement corresponding to a specific Pauli measurement setup, the existence of a critical noise strength beyond which all of the postmeasured states are biseparable. The calculation is also useful for arbitrary large stabilizer states under noise due to the local unitary connection between stabilizer states and graph states. We demonstrate this by considering a toric code defined on a square lattice and computing a lower bound of localizable genuine multipartite entanglement over a nontrivial loop of the code. Similar to the graph states, we show the existence of the critical noise strength in this case also and discuss its interesting features.
Bell sampling efficiently learns the stabilizer group, and hence the stabilizer nullity, of pure states with little magic, a primitive underlying tomography and certification of low-magic states. Real devices, however, only prepare noisy images of the target, which we model as a Pauli channel acting on the ideal state; the resulting noisy state generically has no exact Pauli stabilizers. Existing structure learners for mixed states rely on such exact stabilizers. Agnostic tomography does not, but its guarantees scale exponentially in the nullity ttt. We show that the ideal stabilizer group remains encoded in the noisy state as the set of Pauli operators under which it is invariant. We give Bell-sampling algorithms that learn the group to accuracy ε\varepsilonε for states of nullity at most ttt. The difficulty is that noisy samples break the group structure pure-state learners rely on, so more samples can erase structure rather than reveal it. We resolve this with a finder-verifier scheme that extracts stabilizer structure from partially corrupted sample batches while certifying proposed updates. For sufficiently weak global depolarizing noise, both samples and runtime are poly(n,t,1/ε)\mathrm{poly}(n,t,1/\varepsilon)poly(n,t,1/ε) when the channel's total error probability is at most of order εn/t\varepsilon n/tεn/t. Up to a constant total error probability (≈0.16\approx 0.16≈0.16), samples remain polynomial while classical processing costs 2t2^t2t, and for any error probability below one a 4t4^t4t overhead suffices. Arbitrary Pauli channels exhibit the same three regimes, with more restrictive thresholds. For weak Pauli noise, this closes much of the gap between agnostic learners such as stabilizer bootstrapping and polynomial pure-state algorithms.
Abstract The standard stabilizer formalism provides a setting to show that quantum computations restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman–Knill theorem. This work analyzes the mathematical structure behind this theorem to find possible generalizations and derivation of constraints required for constructing a non-trivial generalized Clifford group. We prove that if the closure of the stabilizing set is dense in the set of SU(d) transformations, then the associated Clifford group is trivial, consisting only of local gates and permutations of subsystems. This result demonstrates the close relationship between the density of the stabilizing set and the simplicity of the corresponding Clifford group. We apply the analysis to investigate stabilization with binary observables for qubits and find that the formalism is equivalent to the standard stabilization for a low number of qubits. Based on the observed patterns, we conjecture that a large class of generalized stabilizer states are equivalent to the standard ones. Our results provide better insights into the structure of Gottesman–Knill-type results, consequently allowing us to draw a sharper line between quantum and classical computation.