On the Geometry of Stabilizer States

TL;DR

This paper explores the geometric structure of stabilizer states in quantum computing, providing new methods for their characterization, comparison, and approximation to enhance quantum error correction and state representation.

Contribution

It introduces novel techniques for analyzing stabilizer states, including counting, angle distribution, superpositions, and improved inner-product computations, advancing understanding and applications of stabilizer formalism.

Findings

Counted and characterized nearest-neighbor stabilizer states.

Quantified the distribution of angles between stabilizer states.

Developed algorithms for stabilizer superpositions and inner-product calculations.

Abstract

Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that preserve them. Such states are obtained by stabilizer circuits (consisting of CNOT, Hadamard and Phase gates) and can be represented compactly on conventional computers using $O(n^2)$ bits, where $n$ is the number of qubits. As an additional application, the work by Aaronson and Gottesman suggests the use of superpositions of stabilizer states to represent arbitrary quantum states. To aid in such applications and improve our understanding of stabilizer states, we characterize and count nearest-neighbor stabilizer states, quantify the distribution of angles between pairs of stabilizer states, study succinct stabilizer superpositions and stabilizer bivectors, explore the approximation of non-stabilizer states by single stabilizer states and short linear combinations of stabilizer states, develop an improved inner-product computation for stabilizer states via synthesis of compact canonical stabilizer circuits, propose an orthogonalization procedure for stabilizer states, and evaluate several of these algorithms empirically.