$\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays

TL;DR

This paper introduces a systematic framework for constructing and analyzing $hi$-colorable graph states, providing explicit formulas and connections to quantum orthogonal arrays, which enhance understanding and manipulation of multipartite entanglement.

Contribution

It develops a structured approach to represent $hi$-colorable graph states using closed-form expressions and links them to quantum orthogonal arrays, advancing the analysis of multipartite entanglement.

Findings

Explicit closed-form expressions for $hi$-colorable graph states.

LC-equivalence of two-colorable states to orthogonal array-based states.

Connection between graph states and quantum orthogonal arrays.

Abstract

Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation. In this work, we develop a systematic framework for constructing and analyzing $\chi$-colorable graph states, deriving explicit closed-form expressions for arbitrary $\chi$. For two- and a broad family of three-colorable graph states, the representations obtained using only local operations, require a minimal number of terms in the Z-eigenbasis. We prove that every two-colorable graph state is local Clifford (LC) equivalent to a state expressible as a summation of rows of an orthogonal array (OA), providing a structured approach to writing highly entangled states. For graph states with $\chi > 2$, we show that they are LC-equivalent to quantum orthogonal arrays (QOAs), establishing a direct combinatorial connection between multipartite entanglement and structured quantum states. Additionally, the derived closed-form expression has the minimal Schmidt measure for every two-colorable and a broad family of three-colorable graph states. Furthermore, the upper and lower bounds of the Schmidt measure are also discussed. Our results offer an efficient and practical method for systematically constructing graph states, optimizing their representation in quantum circuits, and identifying structured forms of multipartite entanglement. This framework also connects graph states to $k$-uniform and absolutely maximally entangled (AME) states, motivating further exploration of the structure of entangled states and their applications in quantum networks, quantum error correction, and measurement based quantum computing.