Related papers: Hiding classical data in multi-partite quantum sta…
We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the…
We propose a quantum secret sharing protocol between multi-party ($m$ members in group 1) and multi-party ($n$ members in group 2) using a sequence of single photons. These single photons are used directly to encode classical information in…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
We develop a formalism for distilling a classical key from a quantum state in a systematic way, expanding on our previous work on secure key from bound entanglement [K. Horodecki et. al., Phys. Rev. Lett. 94 (2005)]. More detailed proofs,…
A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown…
We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel. Specifically, it is shown that, given a single use of this…
A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process…
Quantum secret sharing is well known as a method for players to share a classical secret for secret sharing in quantum mechanical ways. Most of the results associated with quantum secret sharing are based on pure multipartite entangled…
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…
We investigate the problem of enhancement of mutual information by encoding classical data into entangled input states of arbitrary length and show that while there is a threshold memory or correlation parameter beyond which entangled…
A scheme is proposed for protecting quantum states from both independent decoherence and cooperative decoherence. The scheme operates by pairing each qubit (two-state quantum system) with an ancilla qubit and by encoding the states of the…
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that each of the encoded bits can be recovered with high…
Quantum state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multi-partite quantum networks. Quantum state sharing allows for secure communication in a quantum…
Covert communication offers a method to transmit messages in such a way that it is not possible to detect that the communication is happening at all. In this work, we report an experimental demonstration of covert communication that is…
The quantum key distribution protocol without public announcement of bases is equipped with a two-way classical communication symmetric entanglement purification protocol. This modified key distribution protocol is unconditionally secure…
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state…
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other…
Based on the fact that the entanglement can not be created locally, we proposed a quantum bit commitment protocol, in which entangled states and quantum algorithms is used. The bit is not encoded with the form of the quantum states, and…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…
We study the practical effectiveness of privacy amplification for classical key-distribution schemes. We find that in contrast to quantum key distribution schemes, the high fidelity of the raw key generated in classical systems allow the…