No Arabic abstract
In [Science 340, 1205, 7 June (2013)], via polytopes Michael Walter et al. proposed a sufficient condition detecting the genuinely entangled pure states. In this paper, we indicate that generally, the coefficient vector of a pure product state of $n$ qubits cannot be decomposed into a tensor product of two vectors, and show that a pure state of $n$ qubits is a product state if and only if there exists a permutation of qubits such that under the permutation, its coefficient vector arranged in ascending lexicographical order can be decomposed into a tensor product of two vectors. The contrapositive of this result reads that a pure state of $n$ qubits is genuinely entangled if and only if its coefficient vector cannot be decomposed into a tensor product of two vectors under any permutation of qubits. Further, by dividing a coefficient vector into $2^{i}$ equal-size block vectors, we show that the coefficient vector can be decomposed into a tensor product of two vectors if and only if any two non-zero block vectors of the coefficient vector are proportional. In terms of textquotedblleft proportionalitytextquotedblright , we can rephrase that a pure state of $n$ qubits is genuinely entangled if and only if there are two non-zero block vectors of the coefficient vector which are not proportional under any permutation of qubits. Thus, we avoid decomposing a coefficient vector into a tensor product of two vectors to detect the genuine entanglement. We also present the full decomposition theorem for product states of n qubits.
Two qubits in pure entangled states going through separate paths and interacting with their own individual environments will gradually lose their entanglement. Here we show that the entanglement change of a two-qubit state due to amplitude damping noises can be recovered by entanglement swapping. Some initial states can be asymptotically purified into maximally entangled states by iteratively using our protocol.
Beyond the simplest case of bipartite qubits, the composite Hilbert space of multipartite systems is largely unexplored. In order to explore such systems, it is important to derive analytic expressions for parameters which characterize the systems state space. Two such parameters are the degree of genuine multipartite entanglement and the degree of mixedness of the systems state. We explore these two parameters for an N-qubit system whose density matrix has an X form. We derive the class of states that has the maximum amount of genuine multipartite entanglement for a given amount of mixedness. We compare our results with the existing results for the N=2 case. The critical amount of mixedness above which no N-qubit X-state possesses genuine multipartite entanglement is derived. It is found that as N increases, states with higher mixedness can still be entangled.
We revisit the problem of detection of entanglement of an unknown two-qubit state using minimal resources. Using weak values and just two copies of an arbitrary two-qubit state, we present a protocol where a post selection measurement in the computational basis provides enough information to identify if the state is entangled or not. Our protocol enables complete state identification with a single-setting post selection measurement on two copies of the state. It follows that by restricting to pure states, the global interaction required for determining the weak values can be realized by local operations. We further show that our protocol is robust against errors arising from inappropriate global interactions applied during weak value determination.
We report the preparation and verification of a genuine 12-qubit entanglement in a superconducting processor. The processor that we designed and fabricated has qubits lying on a 1D chain with relaxation times ranging from 29.6 to 54.6 $mu$s. The fidelity of the 12-qubit entanglement was measured to be above $0.5544pm0.0025$, exceeding the genuine multipartite entanglement threshold by 21 statistical standard deviations. Our entangling circuit to generate linear cluster states is depth-invariant in the number of qubits and uses single- and double-qubit gates instead of collective interactions. Our results are a substantial step towards large-scale random circuit sampling and scalable measurement-based quantum computing.
Genuine multipartite entanglement plays important roles in quantum information processing. The detection of genuine multipartite entanglement has been long time a challenging problem in the theory of quantum entanglement. We propose a criterion for detecting genuine tripartite entanglement of arbitrary dimensional tripartite states based on quantum Fisher information. We show that this criterion is more effective for some states in detecting genuine tripartite entanglement by detailed example.