The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases
arXiv:2203.00103 · doi:10.22331/q-2022-09-22-815
Abstract
We propose an extension to the Pauli stabiliser formalism that includes fractional rotations around the axis for some integer . The resulting generalised stabiliser formalism - denoted the XP stabiliser formalism - allows for a wider range of states and codespaces to be represented. We describe the states which arise in the formalism, and demonstrate an equivalence between XP stabiliser states and 'weighted hypergraph states' - a generalisation of both hypergraph and weighted graph states. Given an arbitrary set of XP operators, we present algorithms for determining the codespace and logical operators for an XP code. Finally, we consider whether measurements of XP operators on XP codes can be classically simulated.
arXiv comment43 pages + 22 page appendix, 3 figures. Includes links to a Github repository for Python software implementing all algorithms discussed in the paper, as well as links to interactive Jupyter notebooks for all worked examples. v2 minor updates; v3 published version
References in corpus (15)
- Fault-tolerant quantum computation by anyons
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Improved Simulation of Stabilizer Circuits
- Anyons and the quantum Hall effect - a pedagogical review
- Graphical description of the action of local Clifford transformations on graph states
- Measurement-based quantum computation beyond the one-way model
- Quantum memories at finite temperature
- Quantum Hypergraph States
- Codeword Stabilized Quantum Codes
- A nonadditive quantum code
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Standard Form of Qudit Stabilizer Groups
- On Optimality of CSS Codes for Transversal
- A Non-Commuting Stabilizer Formalism
- Non-Pauli topological stabilizer codes from twisted quantum doubles