Sequential quantum secret sharing in noisy environments
- 90 Downloads
Sequential quantum secret sharing (QSS) schemes do not use entangled states for secret sharing, rather they rely on sequential operations of the players on a single state which is circulated between the players. In order to check the viability of these schemes under imperfect operations and noise in the channels, we consider one such scheme in detail and show that under moderate conditions it is still possible to extract viable secure shared keys in this scheme. Although we specifically consider only one type of sequential scheme and three different noise models, our method is fairly general to be applied to other QSS schemes and noise models as well.
KeywordsQuantum secret sharing Noise Sequential
This work was financially supported by the Grant no. 96011347 from Iran National Science Foundation (INSF). M. A. would like to thank Abdus Salam International Center for Theoretical Physics (ICTP), where part of this research was carried out. She also thanked V. Karimipour for many discussions and Fabio Benatti for his valuable comments.
- 1.Bennett, C.H., Brassard, G.: Quantum cryptography: public keydistribution and coin tossing. In: Proceedings of IEEEInternational Conference on Computers, Systems and SignalProcessing, vol. 175, pp. 8. New York (1984)Google Scholar
- 22.Tavakoli, A., Herbauts, I., Zukowski, M., Bourennane, M.: Sequential quantum secret sharing in noisy environments (preprint). arXiv:1501.05582