An efficient algebraic representation for graph states for measurement-based quantum computing

TL;DR

This paper introduces an algebraic method to efficiently represent and manipulate graph states in measurement-based quantum computing by reducing the number of stabilizers needed, especially for specific topologies.

Contribution

It presents a novel algebraic framework that simplifies the representation of graph states using fewer stabilizers, improving efficiency in quantum computation.

Findings

Number of stabilizers reduces from n to n/2 for ring topology

Number of stabilizers reduces from n to 1 for star topology

Graph states can be generated by a subgroup of the stabilizer group

Abstract

Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the abelian group of stabilizer operators. They own topological properties, arising from their graph structure, including the presence of highly connected nodes, called hubs. Starting from hub nodes, we demonstrate how to efficiently express a graph state through the generators of the stabilizer group. We provide examples by expressing the ring and the star topology, for which the number of stabilizers reduces from n to n/2, and from n to 1, respectively. We demonstrate that the graph states can be generated by a subgroup of the stabilizer group. Therefore, we provide an algebraic framework to manipulate the graph states with a reduced number of stabilizers.