Secure multiparty quantum computation with few qubits

Journal article (2020)

Authors

V. Lipinska QuTech Advanced Research Centre, QID/Wehner Group - QuTech Advanced Research Centre , Kavli institute of nanoscience Delft
J.D. Ribeiro QID/Wehner Group - QuTech Advanced Research Centre , QuTech Advanced Research Centre, Kavli institute of nanoscience Delft
S.D.C. Wehner Quantum Internet Division , Quantum Information and Software - EEMCS , QuTech Advanced Research Centre, Kavli institute of nanoscience Delft
Department
Quantum Internet Division
Copyright: © 2020 V. Lipinska, J.D. Ribeiro, S.D.C. Wehner
DOI
help_outline
https://doi.org/10.1103/PhysRevA.102.022405
More Info
expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Department

Quantum Internet Division

Abstract

We consider the task of secure multiparty 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 n2+4n qubits, as opposed to the previously shown ω(n3+n2s2)logn qubits, where s is a security parameter. Additionally, we reduce the communication complexity by a factor of O(n3log(n)) qubits per node compared to existing protocols. To achieve universal computation, we develop a distributed procedure for verifying magic states, which allows us to apply distributed gate teleportation and which may be of independent interest. We showcase our protocol in a small example for a seven-node network.