Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes

Abstract

Secure multi-party quantum computation (MPQC) protocol is a cryptographic primitive allowing error-free distributed quantum computation to a group of $n$ mutually distrustful quantum nodes even when some quantum nodes disobey the instructions of the protocol. Here we suggest a modified MPQC protocol that adopts unconventional quantum error-correcting codes and as a consequence reduces the number of qubits required for the protocol execution. In particular, the replacement of the self-dual Calderbank-Shor-Steane quantum error-correcting codes with triply-even ones permits us to avoid the previously indispensable but resource-intensive procedure of the ``magic'' state verification. Besides, since every extra qubit reduces the credibility of physical devices, our suggestion makes the MPQC protocol more accessible for the near-future technology by reducing the number of necessary qubits per quantum node from $n^2+\Theta (r)n$, where $r$ is the security parameter, to $n^2+3n$.

21 pages, 6 figures, 4 tables

References in corpus (13)

• Quantum Teleportation is a Universal Computational Primitive
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• How to share a quantum secret
• A Theory of Fault-Tolerant Quantum Computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Magic state distillation with low overhead
• Active stabilisation, quantum computation and quantum state synthesis
• On Optimality of CSS Codes for Transversal $T$
• On triply even binary codes
• Verifiable Hybrid Secret Sharing With Few Qubits
• Classification of Small Triorthogonal Codes
• Secure multi-party quantum computation with few qubits
• Error suppression via complementary gauge choices in Reed-Muller codes