Abstract In this study, we provide a positive answer to the problem of whether N -qubit pure quantum states exist in which all k -body reduced density are maximally mixed for k < ⌊ N 2 ⌋ in [1]. In addition, for k ⩾ 4 and any d , there exists an integer N 0 ( k , d ) such that whenever N ⩾ N 0 ( k , d ), we can construct a series of infinite classes of k -uniform states of N qudits with any level d , including infinitely many absolutely maximally entangled states.
Abstract In this study, we provide a positive answer to the problem of whether N -qubit pure quantum states exist in which all k -body reduced density are maximally mixed for k < ⌊ N 2 ⌋ in [1]. In addition, for k ⩾ 4 and any d , there exists an integer N 0 ( k , d ) such that whenever N ⩾ N 0 ( k , d ), we can construct a series of infinite classes of k -uniform states of N qudits with any level d , including infinitely many absolutely maximally entangled states.
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.
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.
Pure multipartite quantum states of n parties and local dimension q are called k-uniform if all reductions to k parties are maximally mixed.These states are relevant for our understanding of multipartite entanglement, quantum information protocols, and the construction of quantum error correction codes.To our knowledge, the only known systematic construction of these quantum states is based on classical error correction codes.We present a systematic method to construct other examples of k-uniform states and show that the states derived through our construction are not equivalent to any k-uniform state constructed from the so-called maximum distance separable error correction codes.Furthermore, we use our method to construct several examples of absolutely maximally entangled states whose existence was open so far.
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.
A pure multipartite quantum state is called absolutely maximally entangled if all reductions of no more than half of the parties are maximally mixed. However, an n-qubit absolutely maximally entangled state exists only when n equals 2, 3, 5, and 6. A natural question arises when it does not exist: Which n-qubit pure state has the largest number of maximally mixed $\ensuremath{\lfloor}n/2\ensuremath{\rfloor}$-party reductions? We denote this number by Qex(n). It was shown that Qex(4)=4 by Higuchi and Sudbery [Phys. Lett. A 273, 213 (2000)] and Qex(7)=32 by Huber et al. [Phys. Rev. Lett. 118, 200502 (2017)]. In this paper, we give a general upper bound of Qex(n) by linking the well-known Tur\'an problem in graph theory and provide lower bounds using constructive and probabilistic methods. In particular, we show that Qex(8)=56, which is the third known value for this problem.
Pure multiparticle quantum states are called absolutely maximally entangled if all reduced states obtained by tracing out at least half of the particles are maximally mixed. We provide a method to characterize these states for a general multiparticle system. With that, we prove that a seven-qubit state whose three-body marginals are all maximally mixed, or equivalently, a pure ((7,1,4))_{2} quantum error correcting code, does not exist. Furthermore, we obtain an upper limit on the possible number of maximally mixed three-body marginals and identify the state saturating the bound. This solves the seven-particle problem as the last open case concerning maximally entangled states of qubits.