Related papers: Quantum states for perfectly secure secret sharing
We provide various schemes for the splitting up of Quantum information into parts using the four and five partite cluster states. Explicit protocols for the Quantum information splitting (QIS) of single and two qubit states are illustrated.…
From the NP-hardness of the quantum separability problem and the relation between bipartite entanglement and the secret key correlations, it is shown that the problem deciding whether a given quantum state has secret correlations in it or…
We construct quantum gate entangler for general multipartite states based on topological unitary operators. We show that these operators can entangle quantum states if they satisfy the separability condition that is given by the complex…
We experimentally prepare a new type of continuous variable genuine four-partite entangled states, the quantum correlation property of which is different from that of the four-mode GHZ and cluster states, and which has not any qubit…
One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among…
Quantum key distribution (QKD) offers the promise of absolutely secure communications. However, proofs of absolute security often assume perfect implementation from theory to experiment. Thus, existing systems may be prone to insidious…
We present a two-step exact remote state preparation protocol of an arbitrary qubit with the aid of a three-particle Greenberger-Horne-Zeilinger state. Generalization of this protocol for higher-dimensional Hilbert space systems among three…
We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $\varphi^{\otimes n}$ for a given reference state $\varphi$, up to errors on a few positions. This task makes…
For two qubits and for general bipartite quantum systems, we give a simple spectral condition in terms of the ordered eigenvalues of the density matrix which guarantees that the corresponding state is separable.
Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A \textbf{61}, 042311 (2000)] is revisited based on a…
We study certain quantum states for which the PPT criterion is both sufficient and necessary for separability. A class of $n\times n$ bipartite mixed states is presented and the conditions of PPT for these states are derived. The separable…
We study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An…
In this paper, we develop a quantum key distribution protocol based on the Greenberger-Horne-Zeilinger states (GHZs). The particles are exchanged among the users in blocks through two steps. In this protocol, for three-particle GHZs three…
We show that all multi-partite pure states can, under local operations, be transformed into bi-partite pairwise entangled states in a "lossless fashion": An arbitrary distinguished party will keep pairwise entanglement with all other…
We investigate schemes for quantum secret sharing and quantum dense coding via tripartite entangled states. We present a scheme for sharing classical information via entanglement swapping using two tripartite entangled GHZ states. In order…
We describe how to achieve optimal entanglement generation and one-way entanglement distillation rates by coherent implementation of a class of secret key generation and secret key distillation protocols, respectively. This short paper is a…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces.…
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).…
Bounds analogous to entropic uncertainty relations allow one to design practical tests to detect quantum entanglement by a collective measurement performed on several copies of the state analyzed. This approach, initially worked out for…
A resilient secret sharing scheme is supposed to generate the secret correctly even after some shares are damaged. In this paper, we show how quantum error correcting codes can be exploited to design a resilient quantum secret sharing…