Secure multi-party quantum computation with few qubits

Abstract

We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. That is, each of the $n$ nodes in our protocol requires an operational workspace of $n^2+\Theta (s)n$ qubits, as opposed to previously shown $\Omega ((n^3+n^2{s}^2)\log n)$ qubits, where $s$ is a security parameter. To achieve universal computation, we develop a distributed procedure for verifying magic states based on magic state distillation and statistical testing of randomly selected states. This allows us to apply distributed $T$ gate and which may be of independent interest. We showcase our protocol on a small example for a 7-node network.

12 + 5 (appendix) + 5 pages (erratum), 5 figures

References in corpus (1)

• Restrictions on Transversal Encoded Quantum Gate Sets

Cited by in corpus (6)

• Security in Quantum Cryptography
• Quantum cryptography beyond key distribution: theory and experiment
• Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
• Quantum-secure multiparty deep learning
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes
• Secure Two-Party Quantum Computation Over Classical Channels