Pith. sign in

REVIEW

Quantum secret sharing for a multipartite system under energy dissipation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1712.10219 v1 pith:46M5GPU5 submitted 2017-12-29 quant-ph cs.ITmath.IT

Quantum secret sharing for a multipartite system under energy dissipation

classification quant-ph cs.ITmath.IT
keywords informationtextitchannelprotocolquantumdissipationenergysecret
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose a protocol for multipartite secret sharing of quantum information through an \textit{amplitude damping} quantum channel. This network is, for example, of two organizations communicating with their own employees connected via classical channels locally. We consider a GHZ state distributed among four members in an asymmetric fashion where the members of a sub-party collaborate to decode the received information at their end. The target is to send two bits of information in \textit{one execution} of the protocol. Firstly, we consider an ideal channel and observe that our protocol enables decoding of a secret 2-bit information with unit probability. This is accomplished by one of the senders by the use of a globally operated \textit{quantum teleportation operator}. Secondly, we implement the same protocol in a realistic scenario under energy dissipation by the use of a parameterized \textit{amplitude damping channel} with variable noise. This noise is associated with energy dissipation and hence, loss of probability to distinguish and decode the information at the receiving end. Finally, we make this task possible through an optimization algorithm. Various channel \textit{quality measures} are also quantitatively ascertained.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.