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.
AI Summary
The paper studies when orthogonal arrays (OAs), represented as normalized positive equal-amplitude multipartite states, are locally unitarily equivalent. It focuses on explicit Fourier transformations rather than a classification under arbitrary local unitaries.
For a systematic generator $G=(I_m\mid P)$ over $\mathbb Z_d$, character orthogonality establishes that applying the normalized cyclic Fourier transform to every party maps the array state to the state generated by $H=(-P^T\mid I_{n-m})$. Conditions on determinantal divisors ensure that $G$ generates an $\mathrm{OA}(d^m,n,d,k)$; requiring a unit in every row of $P$ ensures that its Fourier partner is an $\mathrm{OA}(d^{n-m},n,d,1)$. Over prime alphabets, these arrays are the codeword arrays of a linear code and its Euclidean dual, a relation also identified in prior work.
Irredundancy results follow from minimum-distance bounds and a converse showing that a positive equal-amplitude array state is $k$-uniform exactly when its support is an irredundant OA of strength $k$. Explicit families include Fourier-equivalent $\mathrm{IrOA}(d^m,2m-1,d,2)$ and $\mathrm{IrOA}(d^{m-1},2m-1,d,2)$ for every $d\geq2$, $m\geq4$. Applications cover MDS, Hamming, Reed–Muller, cyclic, and negacyclic codes. For code and dual distances $\delta,\delta^\perp$, both arrays are irredundant at common strength $t$ exactly when $1\leq t\leq\min\{\delta-1,\delta^\perp-1\}$.
The results identify specific Fourier partners, not all LU-equivalent arrays. The coding applications using cyclic Fourier matrices assume prime alphabets; nonprime prime powers require field-additive transforms. Composite-modulus systematic-form assumptions and prescribed versus maximal OA strengths are explicitly distinguished.
Little sign of AI-generated textIncrementalUnclear novelty
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
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.
The paper studies when orthogonal arrays (OAs), represented as normalized positive equal-amplitude multipartite states, are locally unitarily equivalent. It focuses on explicit Fourier transformations rather than a classification under arbitrary local unitaries.
For a systematic generator G=(Im∣P) over Zd, character orthogonality establishes that applying the normalized cyclic Fourier transform to every party maps the array state to the state generated by H=(−PT∣In−m). Conditions on determinantal divisors ensure that G generates an OA(dm,n,d,k); requiring a unit in every row of P ensures that its Fourier partner is an OA(dn−m,n,d,1). Over prime alphabets, these arrays are the codeword arrays of a linear code and its Euclidean dual, a relation also identified in prior work.
Irredundancy results follow from minimum-distance bounds and a converse showing that a positive equal-amplitude array state is k-uniform exactly when its support is an irredundant OA of strength k. Explicit families include Fourier-equivalent IrOA(dm,2m−1,d,2) and IrOA(dm−1,2m−1,d,2) for every d≥2, m≥4. Applications cover MDS, Hamming, Reed–Muller, cyclic, and negacyclic codes. For code and dual distances δ,δ⊥, both arrays are irredundant at common strength t exactly when 1≤t≤min{δ−1,δ⊥−1}.
The results identify specific Fourier partners, not all LU-equivalent arrays. The coding applications using cyclic Fourier matrices assume prime alphabets; nonprime prime powers require field-additive transforms. Composite-modulus systematic-form assumptions and prescribed versus maximal OA strengths are explicitly distinguished.
In the investigation of quantum entanglement, local unitary (LU) equivalence serves as a fundamental tool for distinguishing and classifying entanglement structures. Orthogonal arrays are classical combinatorial designs with applications to quantum states and quantum error-correcting codes. Two orthogonal arrays are said to be LU equivalent if their associated quantum states are equivalent under LU operations. In this paper, we study the LU equivalence of three concrete families of orthogonal arrays constructed from mutually orthogonal Latin squares and difference matrices via Fourier matrices. We determine their strengths using projection maps and minimum support sizes. These constructions yield LU equivalent orthogonal arrays whose numbers of rows need not be the same, and in general, whose strengths may be different. Under a natural condition on the first local unitary, we further show that LU equivalence between two OAs obtained from difference matrices implies LU equivalence between their underlying difference matrices. These findings provide a new perspective for investigating the LU equivalence of orthogonal arrays and their underlying difference matrices, and reveal deep connections between combinatorial structures with different parameters.
Abstract Two orthogonal arrays (OAs) are local unitary (LU) equivalent if they lead to LU-equivalent quantum states. Finding LU-equivalent OAs is an open problem posed by Goyeneche et al ( Phys. Rev. A 90 022316). In this paper, we develop methods of constructing infinite families of LU-equivalent OAs, both fixed-level and mixed-level, by investigating the constructions, structures and properties of OAs. We consequently provide a solution to the open problem. The results significantly advance our understanding of LU-equivalent quantum states and their potential applications in quantum information processing.
Abstract The classification of multipartite entanglement is essential as it serves as a resource for various quantum information processing tasks. This study concerns a particular class of highly entangled multipartite states, the so-called absolutely maximally entangled (AME) states. These are characterized by maximal entanglement across all possible bipartitions. In particular we analyze the local unitary (LU) equivalence among AME states using invariants. One of our main findings is that the existence of special irredundant orthogonal arrays implies the existence of an infinite number of equivalence classes of AME states constructed from these. In particular, we show that there are infinitely many LU inequivalent three-party AME states for local dimension d > 2 and five-party AME states for d ⩾ 2 .
In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N,1,d+1))s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3,s,2))s for all si≥3, ((4,s2,2))s for all si≥5, ((5,s,3))s for all si≥4, ((6,s2,3))s for all si≥5, ((7,s3,3))s for all si≥7, ((8,s2,4))s for all si≥9, ((9,s3,4))s for all si≥11, ((9,s,5))s for all si≥9, ((10,s2,5))s for all si≥11, ((11,s,6))s for all si≥11, and ((12,s2,6))s for all si≥13, where s=s1⋯sn and s1,…,sn are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets.
The necessary and sufficient conditions for the equivalence of arbitrary n-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two n-qubit states (with n>2 arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.
Decoupling schemes are used in quantum information processing to selectively switch off unwanted interactions in a multipartite Hamiltonian. A decoupling scheme consists of a sequence of local unitary operations which are applied to the system's qudits and alternate with the natural time evolution of the Hamiltonian. Several constructions of decoupling schemes have been given in the literature. Here we focus on two such schemes. The first is based on certain triples of submatrices of Hadamard matrices that are closed under pointwise multiplication (see Leung, “Simulation and reversal ofn-qubit Hamiltonians using Hadamard matrices,” J. Mod. Opt., vol. 49, pp. 1199–1217, 2002), the second uses orthogonal arrays (see Stollsteimer and Mahler, “Suppression of arbitrary internal couplings in a quantum register,” Phys. Rev. A., vol. 64, p. 052301, 2001). We show that both methods lead to the same class of decoupling schemes. We extend the first method to2-local qudit Hamiltonians, wheredgeq2. Furthermore, we extend the second method tot-local qudit Hamiltonians, wheretgeq2anddgeq2, by using orthogonal arrays of strengtht. We also establish a characterization of orthogonal arrays of strengthtby showing that they are equivalent to decoupling schemes fort-local Hamiltonians which have the property that they can be refined to have time-slots of equal length. The methods used to derive efficient decoupling schemes are based on classical error-correcting codes.