Noise robustness of a multiparty quantum summation protocol

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.

References in corpus (16)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Optimal local implementation of non-local quantum gates
• Qubit teleportation between non-neighboring nodes in a quantum network
• Efficient Distributed Quantum Computing
• Addition on a Quantum Computer
• Quantum arithmetic with the Quantum Fourier Transform
• Distributed quantum computing: A distributed Shor algorithm
• Distributed Quantum Computing and Network Control for Accelerated VQE
• Error per single-qubit gate below $10^{-4}$ in a superconducting qubit
• Experimental Demonstration of Robust Bidirectional Quantum Optical Communications
• Quantum parameter estimation with imperfect reference frames
• Distributed Quantum Machine Learning
• Generalized GHZ States and Distributed Quantum Computing
• Efficient Quantum Voting with Information-Theoretic Security