The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)

Abstract

We describe stabilizer states and Clifford group operations using linear operations and quadratic forms over binary vector spaces. We show how the n-qubit Clifford group is isomorphic to a group with an operation that is defined in terms of a (2n+1)x(2n+1) binary matrix product and binary quadratic forms. As an application we give two schemes to efficiently decompose Clifford group operations into one and two-qubit operations. We also show how the coefficients of stabilizer states and Clifford group operations in a standard basis expansion can be described by binary quadratic forms. Our results are useful for quantum error correction, entanglement distillation and possibly quantum computing.

9 pages

References in corpus (1)

• Local permutations of products of Bell states and entanglement distillation

Cited by in corpus (130)

• Improved Simulation of Stabilizer Circuits
• Characterizing Quantum Gates via Randomized Benchmarking
• A Universal Operator Growth Hypothesis
• Graphical description of the action of local Clifford transformations on graph states
• Hudson's Theorem for finite-dimensional quantum systems
• Trading classical and quantum computational resources
• SIC-POVMs and the Extended Clifford Group
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
• Reducing qubit requirements for quantum simulation using molecular point group symmetries
• Quantifying magic for multi-qubit operations
• Direct randomized benchmarking for multi-qubit devices
• Scalable measures of magic resource for quantum computers
• Classical simulation versus universality in measurement based quantum computation
• Experimental Estimation of Quantum State Properties from Classical Shadows
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Catalysis and activation of magic states in fault tolerant architectures
• How to efficiently select an arbitrary Clifford group element
• Typical entanglement of stabilizer states
• Efficient Representation of Topologically Ordered States with Restricted Boltzmann Machines
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Optimized compiler for Distributed Quantum Computing
• Operator growth in the transverse-field Ising spin chain with integrability-breaking longitudinal field
• Quantum computation via translation-invariant operations on a chain of qubits
• Unifying gate-synthesis and magic state distillation
• Real Randomized Benchmarking
• EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design
• Improved upper bounds on the stabilizer rank of magic states
• Numerically Probing the Universal Operator Growth Hypothesis
• The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Learning quantum circuits of some $T$ gates
• Informational power of the Hoggar SIC-POVM
• A Non-Commuting Stabilizer Formalism
• A linearized stabilizer formalism for systems of finite dimension
• A single $T$-gate makes distribution learning hard
• Asymptotic adaptive bipartite entanglement distillation protocol
• Quantum Entanglement: Separability, Measure, Fidelity of Teleportation and Distillation
• Hashing protocol for distilling multipartite CSS states
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
• Fast Stabiliser Simulation with Quadratic Form Expansions
• Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
• Enumerating all bilocal Clifford distillation protocols through symmetry reduction
• Mutually unbiased bases as minimal Clifford covariant 2-designs
• Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution
• Robustness of QMA against witness noise
• A quantum primality test with order finding
• Stabilizer notation for Spekkens' toy theory
• A monomial matrix formalism to describe quantum many-body states
• Hybrid Stabilizer Matrix Product Operator
• Graph Concatenation for Quantum Codes
• Clifford Dressed Time-Dependent Variational Principle
• Logical Clifford Synthesis for Stabilizer Codes
• Extracting GHZ states from linear cluster states
• Decoding Holographic Codes with an Integer Optimisation Decoder
• Classification of Small Triorthogonal Codes
• Local invariants of stabilizer codes
• Stabilizer rank and higher-order Fourier analysis
• Computing quopit Clifford circuit amplitudes by the sum-over-paths technique
• Stabilizer state breeding
• A stabilizer framework for Contextual Subspace VQE and the noncontextual projection ansatz
• Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
• The Classification of Clifford Gates over Qubits
• Efficient Inner-product Algorithm for Stabilizer States
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• The invariants of the local Clifford group
• The principle of majorization: application to random quantum circuits
• The axiomatic and the operational approaches to resource theories of magic do not coincide
• Entropic uncertainty relations and the stabilizer formalism
• Local unitary classification for sets of generalized Bell states
• Hardware-Tailored Diagonalization Circuits
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
• Quantum many-body simulations with PauliStrings.jl
• Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver
• On Local Equivalence, Surface Code States and Matroids
• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
• On the local equivalence of complete bipartite and repeater graph states
• The equivalence of two approaches to the design of entanglement distillation protocols
• Quantum linear network coding for entanglement distribution in restricted architectures
• On maximum-likelihood decoding with circuit-level errors
• Improved Quantum State Tomography for the Systems with XX+YY Couplings and Z Readouts
• Learning stabilizer states by Bell sampling
• Kerdock Codes Determine Unitary 2-Designs
• The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
• A full dichotomy for Holant${}^c$, inspired by quantum computation
• Lower Bounds on Stabilizer Rank
• Fast simulation of planar Clifford circuits
• Edge local complementation for logical cluster states
• New techniques for bounding stabilizer rank
• Determination of stabilizer states
• Symbolic Synthesis of Clifford Circuits and Beyond
• Classical codes in quantum state space
• Improvement of stabilizer based entanglement distillation protocols by encoding operators
• Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank
• Renormalization view on resonance proliferation between many-body localized phases
• Normalizer Circuits and Quantum Computation
• Faster computation of nonstabilizerness
• Opening Krylov space to access all-time dynamics via dynamical symmetries
• Covariant mutually unbiased bases
• Group theory on quantum Boltzmann machine
• Fast algorithms for classical specifications of stabiliser states and Clifford gates
• Abelian Hypergroups and Quantum Computation
• Single-copy stabilizer testing
• Classical Coding Approaches to Quantum Applications
• Polynomially restricted operator growth in dynamically integrable models
• Clifford-Dressed Variational Principles for Precise Loschmidt Echoes
• Improved Strong Simulation of Universal Quantum Circuits
• Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes
• Targeted Clifford logical gates for hypergraph product codes
• Tailoring Fault-Tolerance to Quantum Algorithms
• The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
• Characterization of non-adaptive Clifford channels
• Quantum Theory from Principles, Quantum Software from Diagrams
• Global Synthesis of CNOT Circuits with Holes
• Minimising the number of edges in LC-equivalent graph states
• Probabilistic Representation of Commutative Quantum Circuit Models
• Maximally symmetric stabilizer MUBs in even prime-power dimensions
• A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra
• GNarsil: Splitting Stabilizers into Gauges
• Efficient classical computation of the neural tangent kernel of quantum neural networks
• Efficient and simple Gibbs state preparation of the 2D toric code via duality to classical Ising chains
• Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor
• Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
• Limits of Clifford Disentangling in Tensor Network States
• Quadratic Form Expansions for Unitaries
• Distilling GHZ States using Stabilizer Codes
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Enhancing Quantum Key Distribution with Entanglement Distillation and Classical Advantage Distillation
• Quantum Advantage via Efficient Post-processing on Qudit Classical Shadow tomography