Related papers: An efficient numerical algorithm on irreducible mu…
We introduce a general framework for detecting genuine multipartite entanglement and non full-separability in multipartite quantum systems of arbitrary dimensions based on correlation tensors. Regarding genuine multipartite entanglement our…
We propose efficient algorithms with logarithmic step complexities for the generation of entangled $GHZ_N$ and $W_N$ states useful for quantum networks, and we demonstrate an implementation on the IBM quantum computer up to $N=16$. Improved…
We find that the m-separability and k-partite entanglement of a multipartite quantum system is correlated with quantum coherence of the same with respect to complete orthonormal bases, distinguishable under local operations and classical…
Quantum entanglement between an arbitrary number of remote qubits is examined analytically. We show that there is a non-probabilistic way to address in one context the management of entanglement of an arbitrary number of mixed-state qubits…
We compute the probability that a bipartite quantum state is separable by Monte Carlo sampling. This is carried out for rebits, qubits and quaterbits. We sampled $5\times 10^{11}$ points for each of these three cases. The results strongly…
Inverse Participation Ratios (IPRs) and the related Participation Entropies quantify the spread of a quantum state over a selected basis of the Hilbert space, offering insights into the equilibrium and non-equilibrium properties of the…
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…
We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in n-qubit Dicke states with…
Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…
We calculate spin correlation functions using IBM quantum processors, accessed online. We demonstrate the rotational invariance of the singlet state, interesting properties of the triplet states, and surprising features of a state of three…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
Quantum indistinguishability of non-orthogonal quantum states is a valuable resource in quantum information applications such as cryptography and randomness generation. In this article, we present a sequential state-discrimination scheme…
Let $|\Psi>$ be an arbitrary stabilizer state distributed between three remote parties, such that each party holds several qubits. Let $S$ be a stabilizer group of $|\Psi>$. We show that $|\Psi>$ can be converted by local unitaries into a…
Via a multidimensional complementarity relation we derive a novel operational entanglement measure for any discrete quantum system, i.e. for any multidimensional and multipartite system. This new measure admits a separation into different…
We propose a method to detect genuine quantum correlation for arbitrary quantum state in terms of the rank of coefficient matrices associated with the pure state. We then derive a necessary and sufficient condition for a quantum state to…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for checking separability that is based on finding state…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
Suppose we have an unknown multipartite quantum state, how can we experimentally find out whether it is genuine multipartite entangled or not? Recall that even for a bipartite quantum state whose density matrix is known, it is already…
Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the…