Noise robustness of a multiparty quantum summation protocol
Ant\'on Rodr\'iguez Otero, Niels M. P. Neumann, Ward van der, Schoot, Robert Wezeman

TL;DR
This paper analyzes how noise affects the correctness and security of a multiparty quantum summation protocol over noisy quantum networks, proposing improvements to eliminate the need for a trusted third party.
Contribution
It provides an analytical study of depolarising and dephasing noise impacts on quantum summation protocols and introduces a method to remove the trusted third party requirement.
Findings
Noise significantly impacts protocol correctness and security.
Analytical models of noise patterns in probability distributions.
Elimination of trusted third party using secret sharing.
Abstract
Connecting quantum computers to a quantum network opens a wide array of new applications, such as securely performing computations on distributed data sets. Near-term quantum networks are noisy, however, and hence correctness and security of protocols are not guaranteed. To study the impact of noise, we consider a multiparty summation protocol with imperfect shared entangled states. We study analytically the impact of both depolarising and dephasing noise on this protocol and the noise patterns arising in the probability distributions. We conclude by eliminating the need for a trusted third party in the protocol using Shamir's secret sharing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
