Related papers: How to hide a secret direction
We show that an arbitrary basis of a multipartite quantum state space consisting of $K$ distant parties such that the $k$th party has local dimension $d_k$ always contains at least $N=\sum_{k=1}^K (d_k-1)+1$ members that are unambiguously…
We discuss the communication complexity of establishing a shared reference frame, in particular examining the case of aligning spatial axes via the exchange of spin-1/2 particles. Unlike previous work we allow for multiple rounds of…
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an…
We show that the ability to create entanglement is necessary for execution of bipartite quantum gates even when they are applied to unentangled states and create no entanglement. Starting with a simple example we demonstrate that to execute…
Quantum secret sharing is an encryption technique based on quantum mechanics, which utilizes uncertainty principle to achieve security in transmission. Most protocols focus on the study of quantum ($n,n$) or ($t,n$) threshold single secret…
Two types of results are presented for distinguishing pure bipartite quantum states using Local Operations and Classical Communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three…
One of the remarkable features of quantum mechanics is the ability to ensure secrecy. Private states embody this effect, as they are precisely those multipartite quantum states from which two parties can produce a shared secret that cannot…
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).…
In this work, we study position-based cryptography in the quantum setting. The aim is to use the geographical position of a party as its only credential. On the negative side, we show that if adversaries are allowed to share an arbitrarily…
In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way…
In this work we give a $(n,n)$-threshold protocol for sequential secret sharing of quantum information for the first time. By sequential secret sharing we refer to a situation where the dealer is not having all the secrets at the same time,…
Here we show that, in principle it is possible to clone (measure) a single arbitrary unknown quantum state of a spin-$\frac{1}{2}$ particle (an electron) with arbitrary precision and with success probability tending to one, using protective…
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its…
Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success…
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold…
We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to $N$ receivers who could only decode…
Quantum states can be used to encode the information contained in a direction, i.e., in a unit vector. We present the best encoding procedure when the quantum state is made up of $N$ spins (qubits). We find that the quality of this optimal…
Every measurement that can be implemented by local quantum operations and classical communication (LOCC) using an infinite number of rounds is the limit of a sequence of measurements each of which requires only a finite number of rounds.…
Quantum secret sharing plays an important role in quantum communications and secure multiparty computation. In this paper, we present a new measurement-device-independent quantum secret sharing protocol, which can double the space distance…
We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be…