We present a tripartite three-level state that allows a secret sharing protocol among the three parties, or a quantum key distribution protocol between any two parties. The state used in this scheme contains entanglement even after one system is traced out. We show how to utilize this residual entanglement for quantum key distribution purposes, and propose a realization of the scheme using entanglement of orbital angular momentum states of photons.
We analyze the security of two multipartite quantum key distribution (QKD) protocols, specifically we introduce an $N$-partite version of the BB84 protocol and we discuss the $N$-partite six-state protocol proposed in arXiv:1612.05585v2. The security analysis proceeds from the generalization of known results in bipartite QKD to the multipartite scenario, and takes into account finite resources. In this context we derive a computable expression for the achievable key rate of both protocols by employing the best-known strategies: the uncertainty relation and the postselection technique. We compa…
The problem of noise incidence on qubits taking part of bipartite entanglement-based protocols is addressed. It is shown that the use of a three-partite GHZ state and measurements instead of their EPR counterparts allows the experimenter to detect $2/3$ of the times whenever one of the qubits involved in the measurement is affected by bit-flip noise through the mere observation of unexpected outcomes in the teleportation and superdense coding protocols when compared to the ideal case. It is shown that the use of post-selection after the detection of noise leads to an enhancement in the efficie…
The laws of quantum mechanics allow for the distribution of a secret random key between two parties. Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement. We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates. Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network c…
Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed). When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bi-partite quantum key distribution (QKD) and those that exploit multi-partite entanglement. The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis t…
Teleporting an unknown qubit state is a paradigmatic quantum information processing task revealing the advantage of quantum communication protocols over their classical counterpart. For a teleportation protocol using a Bell state as quantum channel, the resource has been identified to be the concurrence. However, for mixed multi-partite states the lack of computable entanglement measures has made the identification of the quantum resource responsible for this advantage more challenging. Here, by building on previous results showing that localizable concurrence is the necessary resource for con…
We show how to efficiently send an M-partite entangled state along a spin chain of arbitrary size. Specifically, we show how an entangled M-partite W sate can be almost flawlessly transmitted from one end (Alice) to the other end (Bob) of a spin-1/2 chain described by a slightly modified XX model. We achieve an almost perfect transmission without employing external magnetic fields or modulating the coupling constants among the spins of the chain, the two standard approaches used to achieve a good transmission efficiency. Moreover, the protocol here proposed can be used to transform an M-partit…
We introduce a family of QKD protocols for distributing shared random keys within a network of $n$ users. The advantage of these protocols is that any possible key structure needed within the network, including broadcast keys shared among subsets of users, can be implemented by using a particular multi-partite high-dimensional quantum state. This approach is more efficient in the number of quantum channel uses than conventional quantum key distribution using bipartite links. Additionally, multi-partite high-dimensional quantum states are becoming readily available in quantum photonic labs, mak…
The squash operation, or the squashing model, is a useful mathematical tool for proving the security of quantum key distribution systems using practical (i.e., non-ideal) detectors. At the present, however, this method can only be applied to a limited class of detectors, such as the threshold detector of the Bennett-Brassard 1984 type. In this paper we generalize this method to include multi-partite measurements, such that it can be applied to a wider class of detectors. We demonstrate the effectiveness of this generalization by applying it to the device-independent security proof of the Ekert…
One notion of non-locality in quantum theory is the fact that information may be encoded in a composite system in such a way that it is not accessible through local measurements, even with the assistance of classical communication. Thus, contrary to the classical case, there exists information in quantum many body systems which cannot be accessed locally. We show however that, remarkably, two-dimensional subspaces do not have this property: any physically allowed measurement on information encoded in any two-dimensional subspace, regardless of entanglement or multi-partite structure, may be pe…
Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism, we formulate different classical capacities for a bi-partite quantum process. We find that a one-way communication protocol through an arbitrary process cannot outperform a causally separable process, i.e., we can send at most one bit per qubit. Next, we study bi-directional communication through a causally separable process. Our result shows, a bi-directio…
We introduce entanglement purification protocols for d-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multi-partite qudit systems. The schemes we introduce include recurrence protocols that operate on two copies, as well as hashing protocols that operate on large ensembles. We analyze properties of the protocols with respect to minimal required fidelity and yield, and study their performance in the presence of noise and imperfections. We determine error thresholds and study…
The efficacies of maximally and that of non-maximally entangled mixed states as teleportation channels have been studied. A new class of non-maximally entangled mixed states have been proposed also. Their advantages as quantum teleportation channels over existing non-maximally entangled mixed states have been verified. The mixed states can also be generated using quantum cloning machines. We have also studied how one can utilize the mixed entangled states obtained as output from a state independent quantum cloning machine in teleportation and dense coding. Mixed states can also be used in secr…
Recently, a quantum multi-party summation protocol based on the quantum Fourier transform has been proposed [Quantum Inf Process 17: 129, 2018]. The protocol claims to be secure against both outside and participant attacks. However, a closer look reveals that the player in charge of generating the required multi-partite entangled states can launch two kinds of attacks to learn about other parties' private integer strings without being caught. In this paper, we present these attacks, and propose countermeasures to make the protocol secure again. The improved protocol not only can resist these a…
