arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.2383quant-ph
收藏

噪声环境下弱测量辅助下的序贯量子秘密共享

Sequential Quantum Secret Sharing in a Noisy Environment aided with Weak Measurements

Maharshi Ray, Sourav Chatterjee, Indranil Chakrabarty

摘要:

本文首次给出了一个$(n,n)$ -门限的量子信息序贯秘密共享协议。通过顺序秘密共享,我们指的是在协议开始时,经销商没有同时拥有所有秘密的情况;但是,如果经销商希望在后续阶段共享秘密,她/他可以在我们的协议的帮助下实现它。首先,我们提出了我们的协议为三方,后来我们推广的情况下,我们有$(n>3)$党。此外,在更现实的情况下,我们考虑通过两种噪声通道,即相位阻尼通道(PDC)和振幅阻尼通道(ADC)共享量子比特。当我们在存在噪声的情况下进行顺序秘密共享时,我们观察到在$k^{th}$迭代时秘密共享的保真度与在$(k-1)^{th}$迭代时噪声的影响无关。在ADC的情况下,我们已经看到秘密共享的平均保真度下降到$\frac{1}{2}$,这相当于量子秘密的随机猜测。有趣的是,我们发现通过应用弱测量可以提高平均保真度。平均保真度的这种增加可以通过与弱测量的成功概率进行某种权衡来实现。

英文摘要:

In this work we give a $(n,n)$-threshold protocol for sequential secret sharing of quantum information for the first time. By sequential secret sharing we refer to a situation where the dealer is not having all the secrets at the same time, at the beginning of the protocol; however if the dealer wishes to share secrets at subsequent phases she/he can realize it with the help of our protocol. First of all we present our protocol for three parties and later we generalize it for the situation where we have $(n>3)$ parties. Further in a much more realistic situation, we consider the sharing of qubits through two kinds of noisy channels, namely the phase damping channel (PDC) and the amplitude damping channel (ADC). When we carry out the sequential secret sharing in the presence of noise we observe that the fidelity of secret sharing at the $k^{th}$ iteration is independent of the effect of noise at the $(k-1)^{th}$ iteration. In case of ADC we have seen that the average fidelity of secret sharing drops down to $\frac{1}{2}$ which is equivalent to a random guess of the quantum secret. Interestingly, we find that by applying weak measurements one can enhance the average fidelity. This increase of the average fidelity can be achieved with certain trade off with the success probability of the weak measurements.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑