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.17604

Phase-sensitive representation of Majorana stabilizer states

Tomislav Begušić, Garnet Kin-Lic Chan

quant-phSubmitted Feb 19, 2026• Announced Feb 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Stabilizer states hold a special place in quantum information science due to their connection with quantum error correction and quantum circuit simulation. In the context of classical simulations of many-body physics, they are an example of states that can be both highly entangled and efficiently represented and transformed under Clifford operators. Recently, Clifford operators have been discussed in the context of fermionic quantum computation through their extension, the Majorana Clifford group. Here, we document the phase-sensitive form of the corresponding Majorana stabilizer states, as well as the algorithms for computing their amplitudes, their inner products, and update rules for transforming Majorana stabilizer states under Majorana Clifford gates.

Related papers

Encoding Majorana codes

Maryam Mudassar, Riley W. Chien, Daniel Gottesman

To implement a quantum error-correction protocol, we first need a scheme to prepare our state in the correct subspace of the code, and this can be done using a unitary encoding circuit. Majorana codes are special since any gates that transform such codes must preserve fermionic parity. In this paper, we present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes. We present two approaches, both of which use a version of Gaussian elimination with row operations replaced with elementary fermionic Clifford operations. One approach uses an additional ancilla mode and works for all Majorana stabilizer codes, while the second approach does not use an ancilla but does not work if the total parity is inside the stabilizer group.

arXiv:2402.07829•Physical Review A•Sep 23, 2024•12 citations

Clifford transformations for fermionic quantum systems: From Pauli and Majorana operators to Dirac fermions

Ilias Magoulas, Francesco A. Evangelista

Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state distillation, quantum communication and cryptography, and qubit tapering. Moreover, circuits composed entirely of Clifford gates are classically simulatable, highlighting their computational significance. In this work, we extend the concept of Clifford transformations to fermionic systems. We demonstrate that fermionic Clifford transformations are generated by half-body and pair operators, providing a systematic framework for their characterization. Additionally, we establish connections with fermionic mean-field theories and applications in qubit tapering, offering insights into their broader implications in quantum computing.

arXiv:2510.23923•Physical Review A•Jan 27, 2026•2 citations

A Graphical Rule Book for Clifford Manipulations of Stabilizer States

Ashlesha Patil, Saikat Guha

Stabilizer states, along with Clifford manipulations (unitary transformations and measurements) thereof—despite being efficiently simulable on a classical computer—are an important tool in quantum information processing, with applications to quantum computing, error correction, and networking. Graph states, defined on a graph, are a special class of stabilizer states that are central to measurement-based quantum computing, all-photonic quantum repeaters, distributed quantum computing, and entanglement distribution in a network. All stabilizer states are local-Clifford equivalent to graph states. In this paper, we review the stabilizer framework and extend it by incorporating general stabilizer measurements such as multi-qubit joint projections. We provide an explicit procedure—using Karnaugh maps from Boolean algebra—for converting arbitrary stabilizer gates into tableau operations of the CHP formalism for efficient stabilizer manipulations. We derive graphical rules for arbitrary stabilizer manipulations of graph states, including multi-qubit stabilizer projections and unitaries. We implement the graphical rulebook resulting from above into a MATLAB simulator with a GUI. A user of this tool, e.g., for research in quantum networks, will not require any background in quantum information or the stabilizer framework.

arXiv:2312.02377•IEEE Transactions on Quantum Engineering•Jan 1, 2026•10 citations

Structure of the Majorana Clifford group

Valérie Bettaque, Brian G. Swingle

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

arXiv:2407.11319•Physical Review A•Jul 14, 2025•12 citations

Stabilizer Tensor Networks: Universal Quantum Simulator on a Basis of Stabilizer States

Sergi Masot-Llima, Artur García-Sáez

Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this Letter, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simulation of more states, raising some interesting questions on the representation power of tensor networks and the quantum properties of resources such as entanglement and magic, and support our claims with simulations.

arXiv:2403.08724•Physical Review Letters•Dec 3, 2024•63 citations

Transformations of Stabilizer States in Quantum Networks

Matthias Englbrecht, Tristan Kraft, Barbara Kraus

Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC) transformations among stabilizer states. These transformations arise as a physically motivated extension of local operations in quantum networks with access to bipartite entanglement between some of the nodes of the network. First, we show that PLC transformations among graph states are equivalent to a generalization of the well-known local complementation, which describes local Clifford transformations among graph states. Then, we introduce a mathematical framework to study PLC equivalence of stabilizer states, relating it to the classification of tuples of bilinear forms. This framework allows us to study decompositions of stabilizer states into tensor products of indecomposable ones, that is, decompositions into states from the entanglement generating set (EGS). While the EGS is finite up to 3 parties [Bravyi et al., J. Math. Phys. 47 , 062106 (2006)], we show that for 4 and more parties it is an infinite set, even when considering party-local unitary transformations. Moreover, we explicitly compute the EGS for 4 parties up to 10 qubits. Finally, we generalize the framework to qudit stabilizer states in prime dimensions not equal to 2 , which allows us to show that the decomposition of qudit stabilizer states into states from the EGS is unique.

arXiv:2203.04202•Quantum•Oct 25, 2022•13 citations
Stabilizer states hold a special place in quantum information science due to their connection with quantum error correction and quantum circuit simulation. In the context of classical simulations of many-body physics, they are an example of states that can be both highly entangled and efficiently represented and transformed under Clifford operators. Recently, Clifford operators have been discussed in the context of fermionic quantum computation through their extension, the Majorana Clifford group. Here, we document the phase-sensitive form of the corresponding Majorana stabilizer states, as well as the algorithms for computing their amplitudes, their inner products, and update rules for transforming Majorana stabilizer states under Majorana Clifford gates.
To implement a quantum error-correction protocol, we first need a scheme to prepare our state in the correct subspace of the code, and this can be done using a unitary encoding circuit. Majorana codes are special since any gates that transform such codes must preserve fermionic parity. In this paper, we present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes. We present two approaches, both of which use a version of Gaussian elimination with row operations replaced with elementary fermionic Clifford operations. One approach uses an additional ancilla mode and works for all Majorana stabilizer codes, while the second approach does not use an ancilla but does not work if the total parity is inside the stabilizer group.
Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state distillation, quantum communication and cryptography, and qubit tapering. Moreover, circuits composed entirely of Clifford gates are classically simulatable, highlighting their computational significance. In this work, we extend the concept of Clifford transformations to fermionic systems. We demonstrate that fermionic Clifford transformations are generated by half-body and pair operators, providing a systematic framework for their characterization. Additionally, we establish connections with fermionic mean-field theories and applications in qubit tapering, offering insights into their broader implications in quantum computing.
Stabilizer states, along with Clifford manipulations (unitary transformations and measurements) thereof—despite being efficiently simulable on a classical computer—are an important tool in quantum information processing, with applications to quantum computing, error correction, and networking. Graph states, defined on a graph, are a special class of stabilizer states that are central to measurement-based quantum computing, all-photonic quantum repeaters, distributed quantum computing, and entanglement distribution in a network. All stabilizer states are local-Clifford equivalent to graph states. In this paper, we review the stabilizer framework and extend it by incorporating general stabilizer measurements such as multi-qubit joint projections. We provide an explicit procedure—using Karnaugh maps from Boolean algebra—for converting arbitrary stabilizer gates into tableau operations of the CHP formalism for efficient stabilizer manipulations. We derive graphical rules for arbitrary stabilizer manipulations of graph states, including multi-qubit stabilizer projections and unitaries. We implement the graphical rulebook resulting from above into a MATLAB simulator with a GUI. A user of this tool, e.g., for research in quantum networks, will not require any background in quantum information or the stabilizer framework.
In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.
Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this Letter, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simulation of more states, raising some interesting questions on the representation power of tensor networks and the quantum properties of resources such as entanglement and magic, and support our claims with simulations.
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC) transformations among stabilizer states. These transformations arise as a physically motivated extension of local operations in quantum networks with access to bipartite entanglement between some of the nodes of the network. First, we show that PLC transformations among graph states are equivalent to a generalization of the well-known local complementation, which describes local Clifford transformations among graph states. Then, we introduce a mathematical framework to study PLC equivalence of stabilizer states, relating it to the classification of tuples of bilinear forms. This framework allows us to study decompositions of stabilizer states into tensor products of indecomposable ones, that is, decompositions into states from the entanglement generating set (EGS). While the EGS is finite up to 3 parties [Bravyi et al., J. Math. Phys. 47 , 062106 (2006)], we show that for 4 and more parties it is an infinite set, even when considering party-local unitary transformations. Moreover, we explicitly compute the EGS for 4 parties up to 10 qubits. Finally, we generalize the framework to qudit stabilizer states in prime dimensions not equal to 2 , which allows us to show that the decomposition of qudit stabilizer states into states from the EGS is unique.