Sequential quantum secret sharing in noisy environments

TL;DR

This paper investigates the robustness of sequential quantum secret sharing schemes under noisy conditions, demonstrating that secure keys can still be shared effectively despite imperfections and noise in the system.

Contribution

The study analyzes a specific sequential QSS scheme under various noise models, showing its viability and general applicability to other schemes and noise conditions.

Findings

Secure shared keys can be extracted under moderate noise levels.

The method is adaptable to different noise models and other QSS schemes.

Sequential schemes are resilient without relying on entanglement.

Abstract

Sequential Quantum Secret Sharing schemes (QSS) 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.