Related papers: Multiparticle entanglement purification for two-co…
We study the problem of entanglement distribution in terms of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network with a source, a repeater, and a destination. The…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of min- and max-entropies. Our protocol allows for interpolation between corner points…
As the hyperentanglement of photon systems presents lots of unique opportunities in high-capacity quantum networking, the hyperentanglement purification protocol (hyper-EPP) becomes a vital project work and the quality of its accomplishment…
As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties…
Uncontrolled interactions with the environment introduce errors that remain a significant challenge to the reliability of quantum technologies using entanglement. An essential method to overcome or mitigate these errors is entanglement…
We present a simple protocol to purify bipartite entanglement in spin-1/2 particles by utilizing only natural spin-spin interactions, i.e. those that can commonly be realized in realistic physical systems, and S_z-measurements on single…
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in…
Systems of four nonbinary particles, each having three or more internal states, exhibit maximally entangled states that are inaccessible to four qubits. This breaks the pattern of two- and three-particle systems, in which the existing graph…
Graph states are a fundamental entanglement resource for multipartite quantum applications which are in general challenging to transform efficiently. While fusion operations for merging entangled states are well-developed, no direct…
An entanglement purification protocol (EPP) aims to transform multiple noisy entangled states into a single entangled state with higher fidelity. In this work we consider EPPs that always yield an output fidelity no worse than each of the…
Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…
We present optimized distillation schemes for preparing Greenberger-Horne-Zeilinger (GHZ) states. Our approach relies on training variational quantum circuits with white noise affected GHZ states as inputs. Optimizing for a single iteration…
A classification of multipartite entanglement in qubit systems is introduced for pure and mixed states. The classification is based on the robustness of the said entanglement against partial trace operation. Then we use current machine…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
We study the genuine multipartite entanglement of arbitrary $n$-partite quantum states by representing the density matrices in terms of the generalized Pauli operators. We introduce a general framework for detecting genuine multipartite…
Multipartite entanglement is one of the hallmarks of quantum mechanics and is central to quantum information processing. In this work we show that Concentratable Entanglement (CE), an operationally motivated entanglement measure, induces a…
We propose a method to characterize and quantify multipartite entanglement for pure states. The method hinges upon the study of the probability density function of bipartite entanglement and is tested on an ensemble of qubits in a variety…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
A general mathematical framework is presented to describe local equivalence classes of multipartite quantum states under the action of local unitary and local filtering operations. This yields multipartite generalizations of the singular…