aiqbench analysis
This research establishes a rigorous mathematical bridge between orthogonal arrays in coding theory and the classification of multipartite entangled states via local unitary equivalence. By deriving explicit conditions for Fourier-based equivalence, the work advances fundamental quantum information theory rather than proposing immediate commercial applications or AI-driven algorithms. It represents a significant theoretical contribution to the intersection of combinatorics and quantum physics.
Local unitary equivalence of orthogonal arrays and related linear codes
arXiv:2609.19811v1 Announce Type: new Abstract: Orthogonal arrays (OAs) are combinatorial configurations with applications in experimental design, error-correcting codes, and quantum information. Local unitary (LU) equivalence provides a natural framework for classifying multipartite entangled states. Using the correspondence between OAs and quantum states, Goyeneche and \.{Z}yczkowski [Phys. Rev. A, 2014, 90: 022316] posed the problem of determining when OAs are $LU$ equivalent. In this paper, we construct OAs from generator matrices and establish conditions for Fourier-based $LU$ equivalence of OAs and irredundant orthogonal arrays (IrOAs). For prime alphabets, we identify the Fourier partners of the linear OAs considered here with the arrays of their corresponding dual codes. This gives an explicit connection between $LU$ equivalence and coding theory. We also identify families of $LU$ equivalent OAs arising from specific classes of linear codes.
Abstract:Orthogonal arrays (OAs) are combinatorial configurations with applications in experimental design, error-correcting codes, and quantum information. Local unitary (LU) equivalence provides a natural framework for classifying multipartite entangled states. Using the correspondence between OAs and quantum states, Goyeneche and Życzkowski [Phys. Rev. A, 2014, 90: 022316] posed the problem of determining when OAs are $LU$ equivalent. In this paper, we construct OAs from generator matrices and establish conditions for Fourier-based $LU$ equivalence of OAs and irredundant orthogonal arrays (IrOAs). For prime alphabets, we identify the Fourier partners of the linear OAs considered here with the arrays of their corresponding dual codes. This gives an explicit connection between $LU$ equivalence and coding theory. We also identify families of $LU$ equivalent OAs arising from specific classes of linear codes.
Quantum Physics (quant-ph); Combinatorics (math.CO)
arXiv:2609.19811 [quant-ph]
(or arXiv:2609.19811v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.19811 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 223 words
Related coverage

Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
Quantum Journal · Sep 1, 2026
A Deep Dive into LDS Optimizations on AMD Instinct MI450 GPUs
AMD · Aug 28, 2026

Quantum algorithm simulates complex environments with fewer qubits
Quantum Zeitgeist · Oct 13, 2026
Polynomial-time local-unitary equivalence of graph states
arXiv · Oct 2, 2026