相关论文: Entanglement purification protocols for all graph …

Entity Resolution (ER) is the task of finding records that refer to the same real-world entities. A common scenario is when entities across two clean sources need to be resolved, which we refer to as Clean-Clean ER. In this paper, we…

We construct new entanglement distillation protocols by interpolating between the recurrence and hashing protocols. This leads to asymptotic two-way distillation protocols, resulting in an improvement of the distillation rate for all mixed…

Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…

We present a deterministic entanglement purification protocol (EPP) working for currently available experiment technique. In this protocol, we resort to the robust time-bin entanglement to purify the polarization entanglement determinately,…

Entanglement is among the most fundamental-and at the same time puzzling-properties of quantum physics. Its modern description relies on a resource-theoretical approach, which treats entangled systems as a means to enable or accelerate…

Quantum networks crucially rely on the availability of high-quality entangled pairs of qubits, known as entangled links, distributed across distant nodes. Maintaining the quality of these links is a challenging task due to the presence of…

Quantum information theory is a multidisciplinary field whose objective is to understand what happens when information is stored in the state of a quantum system. Quantum mechanics provides us with a new resource, called quantum…

We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…

Monogamy of bipartite correlations leads, for arbitrary pure multi-qubit states, to simple conditions able to indicate various types of multipartite entanglement by being capable to exclude the possibility of k-separability.

Heterogeneous bipartite quantum pure states, composed of two subsystems with a different number of levels, cannot have both reductions maximally mixed. In this work, we demonstrate existence of a wide range of highly entangled states of…

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…

Entanglement purification protocols play an important role in the distribution of entangled systems, which is necessary for various quantum information processing applications. We consider the effects of photo-detector efficiency and…

We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local quantum operation and classical communication.…

We present a new asymptotic bipartite entanglement distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like…

Purification is a tool that allows to represent mixed quantum states as pure states on enlarged Hilbert spaces. A purification of a given state is not unique and its entanglement strongly depends on the particular choice made. Moreover, in…

We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…

Characterizing large noisy multiparty quantum states using genuine multiparty entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multiparty entanglement localized over a chosen multiparty subsystem of…

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…

Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum…

We present a new approach to the analysis of entanglement in smooth bipartite continuous-variable states. One or both parties perform projective filterings via preliminary measurements to determine whether the system is located in some…