$\chi$-Colorable Graph States: Closed-Form Expressions 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.

arXiv comment17 pages + appendix and references, 9 figures. Comments are welcome!

References in corpus (30)

• Quantum entanglement
• Three qubits can be entangled in two inequivalent ways
• Quantum secret sharing
• Quantum state transfer and entanglement distribution among distant nodes in a quantum network
• Multi-party entanglement in graph states
• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Graphical description of the action of local Clifford transformations on graph states
• The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
• Multiparticle entanglement purification for graph states
• Quantum secret sharing with qudit graph states
• Genuinely multipartite entangled states and orthogonal arrays
• An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
• Entanglement and quantum combinatorial designs
• The one-way quantum computer -- a non-network model of quantum computation
• An efficient algorithm to recognize local Clifford equivalence of graph states
• Constructing optimal quantum error correcting codes from absolute maximally entangled states
• Mapping graph state orbits under local complementation
• Equivalence of Decoupling Schemes and Orthogonal Arrays
• Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
• Graph States Under the Action of Local Clifford Group in Non-Binary Case
• Graph states and local unitary transformations beyond local Clifford operations
• Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
• Deterministic generation of qudit photonic graph states from quantum emitters
• Modifying method of constructing quantum codes from highly entangled states
• The LU-LC conjecture is false
• Two-colorable graph states with maximal Schmidt measure
• Entanglement catalysis for quantum states and noisy channels
• Quantum $k$-uniform states from quantum orthogonal arrays
• Coarse-grained entanglement classification through orthogonal arrays