Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntropy bounds for multiparty device-independent cryptography
90
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Multiparty quantum cryptography based on distributed entanglement will find its natural application in the upcoming quantum networks. The security of many multipartite device-independent (DI) protocols, such as DI conference key agreement, relies on bounding the von Neumann entropy of the parties outcomes conditioned on the eavesdroppers information, given the violation of a multipartite Bell inequality. We consider three parties testing the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality and certify the privacy of their outcomes by bounding the conditional entropy of a single partys outcome and the joint conditional entropy of two parties outcomes. From the former bound, we show that genuine multipartite entanglement is necessary to certify the privacy of a partys outcome, while the latter significantly improve previous results. We obtain the entropy bounds thanks to two general results of independent interest. The first one drastically simplifies the quantum setup of an $N$-partite Bell scenario. The second one provides an upper bound on the violation of the MABK inequality by an arbitrary $N$-qubit state, as a function of the states parameters.
rate research
Read More
The Greenberger-Horne-Zeilinger (GHZ) entanglement, originally introduced to uncover the extreme violation of local realism against quantum mechanics, is an important resource for multiparty quantum communication tasks. But the low intensity and fragility of the GHZ entanglement source in current conditions have made the practical applications of these multiparty tasks an experimental challenge. Here we propose a feasible scheme for practically distributing the post-selected GHZ entanglement over a distance of more than 100 km for experimentally accessible parameter regimes. Combining the decoy-state and measurement-device-independent protocols for quantum key distribution, we anticipate that our proposal suggests an important avenue for practical multiparty quantum communication.
It is known that advantage distillation (that is, information reconciliation using two-way communication) improves noise tolerances for quantum key distribution (QKD) setups. Two-way communication is hence also of interest in the device-independent case, where noise tolerance bounds for one-way error correction are currently too low to be experimentally feasible. Existing security proofs for the device-independent repetition-code protocol (the most prominent form of advantage distillation) rely on fidelity-related security conditions, but previous bounds on the fidelity were not tight. We improve on those results by developing an algorithm that returns arbitrarily tight lower bounds on the fidelity. Our results give new insight on how strong the fidelity-related security conditions are, and could also be used to compute some lower bounds on one-way protocol keyrates. Finally, we conjecture a necessary security condition for the protocol studied in this work, that naturally complements the existing sufficient conditions.
We show that the entropy of a message can be tested in a device-independent way. Specifically, we consider a prepare-and-measure scenario with classical or quantum communication, and develop two different methods for placing lower bounds on the communication entropy, given observable data. The first method is based on the framework of causal inference networks. The second technique, based on convex optimization, shows that quantum communication provides an advantage over classical, in the sense of requiring a lower entropy to reproduce given data. These ideas may serve as a basis for novel applications in device-independent quantum information processing.
We study the impact of finite-size effects on the key rate of continuous-variable (CV) measurement-device-independent (MDI) quantum key distribution (QKD). Inspired by the parameter estimation technique developed in [Rupert textit{et al.} Phys. Rev. A textbf{90}, 062310 (2014)]~we adapt it to study CV-MDI-QKD and, assuming realistic experimental conditions, we analyze the impact of finite-size effects on the key rate. We find that, increasing the block-size, the performance of the protocol converges towards the ideal one, and that block-sizes between $10^{6}$ and $10^{9}$ data points can already provide a key rate $sim10^{-2}$ bit/use over metropolitan distances.
In this paper, we report an experiment about the device-independent tests of classical and quantum entropy based on a recent proposal [Phys. Rev. Lett. 115, 110501 (2015)], in which the states are encoded on the polarization of a biphoton system and measured by the state tomography technology. We also theoretically obtained the minimal quantum entropy for three widely used linear dimension witnesses. The experimental results agree well with the theoretical analysis, demonstrating that lower entropy is needed in quantum systems than that in classical systems under given values of the dimension witness.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
