We study $k$-uniform states in heterogeneous systems whose local dimensions are mixed. Based on the connections between mixed orthogonal arrays with certain minimum Hamming distance, irredundant mixed orthogonal arrays and $k$-uniform states, we present two constructions of $2$-uniform states in heterogeneous systems. We also construct a family of $3$-uniform states in heterogeneous systems, which solves a question posed in [D. Goyeneche et al., Phys. Rev. A 94, 012346 (2016)]. We also show two methods of generating $(k-1)$-uniform states from $k$-uniform states. Some new results on the existence and nonexistence of absolutely maximally entangled states are provided. For the applications, we present an orthogonal basis consisting of $k$-uniform states with minimum support. Moreover, we show that some $k$-uniform bases can not be distinguished by local operations and classical communications, and this shows quantum nonlocality with entanglement.
Orthogonal pure states can be cloned as well as deleted. However if there is an initial disorder in the system, that is for orthogonal mixed states, one cannot perform deletion. And cloning, in such cases, necessarily produces an irreversibility, in the form of leakage of information into the environment.
It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper bounds on the number of perfect LOCC distinguishable orthogonal mixed states. The first one depends only on pure-state entanglement within the supports of the states, and therefore may be easy to compute in many instances. The second bound is optimal in the sense that it optimizes the bounding quantities, not necessarily function of entanglement alone, over al…
In a recent paper (Phys. Rev. A 90, 022316 (2014) ), Goyeneche et al. established a link between the combinatorial notion of orthogonal arrays and k-uniform states and present open issue. (B) Find for what N there are 3-uniform states of N-qubits. In this paper, we demonstrate the existence of 3-uniform states of N-qubits for N=11,..,15".
The task of decoupling, i.e., removing unwanted interactions in a system Hamiltonian and/or couplings with an environment (decoherence), plays an important role in controlling quantum systems. There are many efficient decoupling schemes based on combinatorial concepts like orthogonal arrays, difference schemes and Hadamard matrices. So far these (combinatorial) decoupling schemes have relied on the ability to effect sequences of instantaneous, arbitrarily strong control Hamiltonians (bang-bang controls). To overcome the shortcomings of bang-bang control Viola and Knill proposed a method called…
Quantum multipartite entangled states play significant roles in quantum information processing. By using difference schemes and orthogonal partitions, we construct a series of infinite classes of irredundant mixed orthogonal arrays (IrMOAs) and thus provide positive answers to two open problems. The first is the extension of the method for constructing homogeneous systems from orthogonal arrays (OAs) to heterogeneous multipartite systems with different individual levels. The second is the existence of $k$-uniform states in heterogeneous quantum systems. We present explicit constructions of two…
We consider the problem of designing a measurement to minimize the probability of a detection error when distinguishing between a collection of possibly non-orthogonal mixed quantum states. We show that if the quantum state ensemble consists of linearly independent density operators then the optimal measurement is an orthogonal Von Neumann measurement consisting of mutually orthogonal projection operators and not a more general positive operator-valued measure.
We prove a quantum query lower bound Ω(n^{(d+1)/(d+2)}) for the problem of deciding whether an input string of size n contains a k-tuple which belongs to a fixed orthogonal array on k factors of strength d<=k-1 and index 1, provided that the alphabet size is sufficiently large. Our lower bound is tight when d=k-1. The orthogonal array problem includes the following problems as special cases: k-sum problem with d=k-1, k-distinctness problem with d=1, k-pattern problem with d=0, (d-1)-degree problem with 1<=d<=k-1, unordered search with d=0 and k=1, and graph collision with d=0 and k=2.
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ 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 new 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…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in systems consisting of $N$ subsystems with an arbitrary number of internal levels each, based on properties of orthogonal arrays with $N$ columns. In particular, we investigate in detail a subset of highly entangled pure states which contains all states defining maximum distance separable codes. To illustrate the methods presented, we analyze systems of four…
In the paper, we show that when a quantum state can be decomposed as a convex combination of locally orthogonal mixed states, its entanglement can be decomposed into the entanglement of these mixed states without losing them. The obtained result generalizes a corresponding one proved by Horodecki [Acta Phys. Slov. 48, 141 (1998).]. But, for the entanglement cost it requires certain conditions for holding the decomposition, and the distillable entanglement only has a week result as inequality. Finally, we presented an example to show that the conditions of our conclusions are existence.
The quantum orthogonal arrays define remarkable classes of multipartite entangled states called $k$-uniform states whose every reductions to $k$ parties are maximally mixed. We present constructions of quantum orthogonal arrays of strength 2 with levels of prime power, as well as some constructions of strength 3. As a consequence, we give infinite classes of 2-uniform states of $N$ systems with dimension of prime power $d\geq 2$ for arbitrary $N\geq 5$; 3-uniform states of $N$-qubit systems for arbitrary $N\geq 6$ and $N\neq 7,8,9,11$; 3-uniform states of $N$ systems with dimension of prime po…
Quantum information is nonlocal in the sense that local measurements on a composite quantum system, prepared in one of many mutually orthogonal states, may not reveal in which state the system was prepared. It is shown that in the many copy limit this kind of nonlocality is fundamentally different for pure and mixed quantum states. In particular, orthogonal mixed states may not be distinguishable by local operations and classical communication (LOCC), no matter how many copies are supplied, whereas any set of N orthogonal pure states can be perfectly discriminated with m copies, where, m<N. Th…
The common use in literature of orthogonal measurements in obtaining quantum discord for two-qubit states is discussed and compared with more general measurements. We prove the optimality of orthogonal measurements for rank 2 states. While for rank 3 and 4 mixed states they are not optimal, we present strong numerical evidence showing that they give the correct quantum discord up to minimal corrections. Based on the connection, through purification with an ancilla, between discord and entanglement of formation (EoF), we give a tight upper bound for the EoF of a $2\otimes N$ mixed state of rank…
Electrostatically-defined semiconductor quantum dot arrays offer a promising platform for quantum computation and quantum simulation. However, crosstalk of gate voltages to dot potentials and inter-dot tunnel couplings complicates the tuning of the device parameters. To date, crosstalk to the dot potentials is routinely and efficiently compensated using so-called virtual gates, which are specific linear combinations of physical gate voltages. However, due to exponential dependence of tunnel couplings on gate voltages, crosstalk to the tunnel barriers is currently compensated through a slow ite…
Optically trapped mixed-species single atom arrays with arbitrary geometries are an attractive and promising platform for various applications, because tunable quantum systems with multiple components provide extra degrees of freedom for experimental control. Here, we report the first demonstration of two-dimensional $6\times4$ dual-species atom assembly with a filling fraction of 0.88 (0.89) for $^{85}$Rb ($^{87}$Rb) atoms. This mixed-species atomic synthetic is achieved via rearranging initially randomly distributed atoms using a sorting algorithm (heuristic heteronuclear algorithm) which is…
In this work, we construct a polarization-mediated magic-intensity (MI) optical dipole trap (ODT) array, in which the detrimental effects of light shifts on the mixed-species qubits are efficiently mitigated so that the coherence times of the mixed-species qubits are both substantially enhanced and balanced for the first time. This mixed-species magic trapping technique relies on the tunability of the coefficient of the third-order cross term and ground state hyperpolarizability, which are inherently dependent on the degree of circular polarization of the trap laser. Experimentally, polarizati…
