Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

npj Quantum Information

Two and three-uniform states from irredundant orthogonal arrays

Shanqi Pang, Zhang Xiao, Lin Xiao, Qingjuan Zhang

Published Jun 17, 2019• 56 citations
Publisher

Abstract

Abstract A pure quantum state of N subsystems, each with d levels, is said to be k-uniform if all of its reductions to k qudits are maximally mixed. Only the uniform states obtained from orthogonal arrays (OAs) are considered throughout this work. The Hamming distances of OAs are specially applied to the theory of quantum information. By using difference schemes and orthogonal partitions, we construct a series of infinite classes of irredundant orthogonal arrays (IrOAs), then answer the open questions of whether there exist 3-uniform states of N qubits and 2-uniform states of N qutrits, and whether 3-uniform states of qudits (d > 2) for high values of N can be explicitly constructed. In fact, we obtain 3-uniform states for an arbitrary number of N ≥ 8 qubits and 2-uniform states of N qutrits for every N ≥ 4. Additionally, we provide explicit constructions of the 3-uniform states of N ≥ 8 qutrits, N = 6 and N ≥ 8 ququarts and ququints, N ≥ 6 qudits having d levels for any prime power d > 6, and N = 8 and N ≥ 12 qudits having d levels for non-prime-power d ≥ 6. Moreover, we describe an explicit construction scheme for the 2-uniform states of qudits having d ≥ 4 levels. The proofs of existence of the 2-uniform states of N ≥ 6 qubits are simplified by using a class of OAs. Two special 3-uniform states are obtained from IrOA(32, 10, 2, 3) and IrOA(32, 11, 2, 3) using the interaction column property of OAs.

DOI
10.1038/s41534-019-0165-8

Related papers

k -uniform quantum states arising from orthogonal arrays

Mao-Sheng Li, Yan-Ling Wang

A pure quantum state of $N$ subsystems with local dimension $d$ is called a $k$-uniform state if every reduction to $k$ qudits is maximally mixed. Based on a special class of combinatorial design, namely irredundant orthogonal arrays, we show the existence of 2-uniform $N$-qudit states when $N\ensuremath{\ge}4$ and $d$ is a prime power other than 2. In addition, given any Hadamard matrix of order greater than 4, we demonstrate how it can be used to construct 3-uniform multiqubit states. In fact, we find that there exists some 3-uniform $N$-qubit when $N\ensuremath{\ge}8$ except case $N=9$. These give an answer to a question posed by Goyeneche et al. [Phys. Rev. A 90, 022316 (2014)]. Furthermore, starting from a minimal support $k$-uniform state, we show how to generate an orthogonal basis consisting of $k$-uniform states. At last, we derive a series of $(k\ensuremath{-}1)$-uniform $(N\ensuremath{-}1)$-qudit states from a single $k$-uniform $N$-qudit state. The $k$-uniform states are good candidates among the multipartite entangled states.

Physical Review A•Apr 25, 2019•34 citations

Genuinely multipartite entangled states and orthogonal arrays

Dardo Goyeneche, Karol Życzkowski

A pure quantum state of $N$ subsystems with $d$ levels each is called $k$-multipartite maximally entangled state, which we call a $k$-uniform state, if all its reductions to $k$ qudits are maximally mixed. These states form a natural generalization of $N$-qudit Greenberger-Horne-Zeilinger states which belong to the class 1-uniform states. We establish a link between the combinatorial notion of orthogonal arrays and $k$-uniform states and prove the existence of several classes of such states for $N$-qudit systems. In particular, known Hadamard matrices allow us to explicitly construct 2-uniform states for an arbitrary number of $N>5$ qubits. We show that finding a different class of 2-uniform states would imply the Hadamard conjecture, so the full classification of 2-uniform states seems to be currently out of reach. Furthermore, we establish links between the existence of $k$-uniform states and classical and quantum error correction codes and provide a graph representation for such states.

arXiv:1404.3586•Physical Review A•Aug 15, 2014•166 citations

3-Uniform states and orthogonal arrays of strength 3

Yajuan Zang, Hui-Juan Zuo, Zihong Tian

A pure quantum state of [Formula: see text] subsystems with [Formula: see text] levels is called [Formula: see text]-uniform state if all its reductions to [Formula: see text] qudits are maximally mixed. We construct 3-uniform states for an arbitrary number of [Formula: see text] via orthogonal arrays and the method of adding minus signs mathematically.

International Journal of Quantum Information•Feb 1, 2019•12 citations

Multipartite entangled states, symmetric matrices and error-correcting codes

Keqin Feng, Lingfei Jin, Chaoping Xing +1 more

A pure quantum state is called k-uniform if all its reductions to k-qudit are maximally mixed. We investigate the general constructions of k-uniform pure quantum states of n subsystems with d levels. We provide one construction via symmetric matrices and the second one through the classical error-correcting codes. There are three main results arising from our constructions. First, we show that for any given even n ≥ 2, there always exists an n/2-uniform n-qudit quantum state of level p for sufficiently large prime p. Second, both constructions show that there exist k-uniform n-qudit pure quantum states such that k is proportional to n, i.e., k = Ω(n) although the construction from symmetric matrices in general outperforms the one by error-correcting codes. Third, our symmetric matrix construction provides a positive answer to the open question on whether there exists a 3-uniform n-qudit pure quantum state for all n ≥ 8. In fact, we can further prove that, for every k, there exists a constant Mksuch that there exists a k-uniform n-qudit quantum state for all n ≥ Mk. In addition, by using the concatenation of algebraic geometry codes, we give an explicit construction of k-uniform quantum state when k tends to infinity.

arXiv:1511.07992•IEEE Transactions on Information Theory•Jan 1, 2017•22 citations

kkk-Uniform states and quantum information masking

Fei Shi, Mao-Sheng Li, Lin Chen +1 more

A pure state of $N$ parties with local dimension $d$ is called a $k$-uniform state if all the reductions to $k$ parties are maximally mixed. Based on the connections among $k$-uniform states, orthogonal arrays and linear codes, we give general constructions for $k$-uniform states. We show that when $d\geq 4k-2$ (resp. $d\geq 2k-1$) is a prime power, there exists a $k$-uniform state for any $N\geq 2k$ (resp. $2k\leq N\leq d+1$). Specially, we give the existence of $4,5$-uniform states for almost every $N$-qudits. Further, we generalize the concept of quantum information masking in bipartite systems given by [Modi \emph{et al.} {Phys. Rev. Lett. \textbf{120}, 230501 (2018)}] to $k$-uniform quantum information masking in multipartite systems, and we show that $k$-uniform states and quantum error-correcting codes can be used for $k$-uniform quantum information masking.

arXiv:2009.12497•Sep 26, 2020•4 citations

Quantum Error-Correcting Codes Based on Orthogonal Arrays

Rong Yan, Shanqi Pang, Mengqian Chen +1 more

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.

Entropy•Apr 19, 2023•4 citations
Abstract A pure quantum state of N subsystems, each with d levels, is said to be k-uniform if all of its reductions to k qudits are maximally mixed. Only the uniform states obtained from orthogonal arrays (OAs) are considered throughout this work. The Hamming distances of OAs are specially applied to the theory of quantum information. By using difference schemes and orthogonal partitions, we construct a series of infinite classes of irredundant orthogonal arrays (IrOAs), then answer the open questions of whether there exist 3-uniform states of N qubits and 2-uniform states of N qutrits, and whether 3-uniform states of qudits (d > 2) for high values of N can be explicitly constructed. In fact, we obtain 3-uniform states for an arbitrary number of N ≥ 8 qubits and 2-uniform states of N qutrits for every N ≥ 4. Additionally, we provide explicit constructions of the 3-uniform states of N ≥ 8 qutrits, N = 6 and N ≥ 8 ququarts and ququints, N ≥ 6 qudits having d levels for any prime power d > 6, and N = 8 and N ≥ 12 qudits having d levels for non-prime-power d ≥ 6. Moreover, we describe an explicit construction scheme for the 2-uniform states of qudits having d ≥ 4 levels. The proofs of existence of the 2-uniform states of N ≥ 6 qubits are simplified by using a class of OAs. Two special 3-uniform states are obtained from IrOA(32, 10, 2, 3) and IrOA(32, 11, 2, 3) using the interaction column property of OAs.
A pure quantum state of NNN subsystems with local dimension ddd is called a kkk-uniform state if every reduction to kkk qudits is maximally mixed. Based on a special class of combinatorial design, namely irredundant orthogonal arrays, we show the existence of 2-uniform NNN-qudit states when $N\ensuremath{\ge}4$ and ddd is a prime power other than 2. In addition, given any Hadamard matrix of order greater than 4, we demonstrate how it can be used to construct 3-uniform multiqubit states. In fact, we find that there exists some 3-uniform NNN-qubit when $N\ensuremath{\ge}8$ except case N=9N=9N=9. These give an answer to a question posed by Goyeneche et al. [Phys. Rev. A 90, 022316 (2014)]. Furthermore, starting from a minimal support kkk-uniform state, we show how to generate an orthogonal basis consisting of kkk-uniform states. At last, we derive a series of $(k\ensuremath{-}1)$-uniform $(N\ensuremath{-}1)$-qudit states from a single kkk-uniform NNN-qudit state. The kkk-uniform states are good candidates among the multipartite entangled states.
A pure quantum state of NNN subsystems with ddd levels each is called kkk-multipartite maximally entangled state, which we call a kkk-uniform state, if all its reductions to kkk qudits are maximally mixed. These states form a natural generalization of NNN-qudit Greenberger-Horne-Zeilinger states which belong to the class 1-uniform states. We establish a link between the combinatorial notion of orthogonal arrays and kkk-uniform states and prove the existence of several classes of such states for NNN-qudit systems. In particular, known Hadamard matrices allow us to explicitly construct 2-uniform states for an arbitrary number of N>5N>5N>5 qubits. We show that finding a different class of 2-uniform states would imply the Hadamard conjecture, so the full classification of 2-uniform states seems to be currently out of reach. Furthermore, we establish links between the existence of kkk-uniform states and classical and quantum error correction codes and provide a graph representation for such states.
A pure quantum state is called k-uniform if all its reductions to k-qudit are maximally mixed. We investigate the general constructions of k-uniform pure quantum states of n subsystems with d levels. We provide one construction via symmetric matrices and the second one through the classical error-correcting codes. There are three main results arising from our constructions. First, we show that for any given even n ≥ 2, there always exists an n/2-uniform n-qudit quantum state of level p for sufficiently large prime p. Second, both constructions show that there exist k-uniform n-qudit pure quantum states such that k is proportional to n, i.e., k = Ω(n) although the construction from symmetric matrices in general outperforms the one by error-correcting codes. Third, our symmetric matrix construction provides a positive answer to the open question on whether there exists a 3-uniform n-qudit pure quantum state for all n ≥ 8. In fact, we can further prove that, for every k, there exists a constant Mksuch that there exists a k-uniform n-qudit quantum state for all n ≥ Mk. In addition, by using the concatenation of algebraic geometry codes, we give an explicit construction of k-uniform quantum state when k tends to infinity.
A pure state of NNN parties with local dimension ddd is called a kkk-uniform state if all the reductions to kkk parties are maximally mixed. Based on the connections among kkk-uniform states, orthogonal arrays and linear codes, we give general constructions for kkk-uniform states. We show that when d≥4k−2d\geq 4k-2d≥4k−2 (resp. d≥2k−1d\geq 2k-1d≥2k−1) is a prime power, there exists a kkk-uniform state for any N≥2kN\geq 2kN≥2k (resp. 2k≤N≤d+12k\leq N\leq d+12k≤N≤d+1). Specially, we give the existence of 4,54,54,5-uniform states for almost every NNN-qudits. Further, we generalize the concept of quantum information masking in bipartite systems given by [Modi \emph{et al.} {Phys. Rev. Lett. \textbf{120}, 230501 (2018)}] to kkk-uniform quantum information masking in multipartite systems, and we show that kkk-uniform states and quantum error-correcting codes can be used for kkk-uniform quantum information masking.
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.