Asymmetric secure multi-party quantum computation with weak clients against dishonest majority
- 6 February 2025
- journal article
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (2) , 025015
Abstract
Secure multi-party computation (SMPC) protocols allow several parties distrusting each other to collectively compute a function on their inputs, without revealing the input values. In this paper, we introduce a protocol that lifts SMPC to its quantum counterpart—secure multi-party quantum computation (SMPQC) for classical inputs and outputs—in a composable and statistically secure way, even for a single honest party. The soundness error—the maximum cheating probability of malicious parties—is shown to be proportional to the inverse of a polynomial with respect to the number of rounds in the protocol, and can be further decreased to a negligible quantity for bounded-error quantum-polynomial-time computations. Unlike previous SMPQC protocols, our proposal only requires very limited quantum resources from all but one party. In addition, the protocol exhibits some noise robustness that can facilitate small-scale implementations with near-future technologies. The protocol is based on a new technique for quantum verification that requires only the collective remote preparation of quantum states in a single plane of the Bloch sphere. To demonstrate the ability of verifying the computation with such limited clients, we uncover and use a fundamental invariance that is inherent to measurement-based quantum computing.Keywords
All Related Versions
Funding Information
- Hybdrid HPC Quantum Initiative
- Agence Nationale de la Recherche (ANR-21-CE47-0014)
- HORIZON EUROPE Digital, Industry and Space (101135288)
- Bpifrance (DOS0148633/00)
- Leverhulme Early Career Fellowship
This publication has 32 references indexed in Scilit:
- Secure multiparty quantum computation protocol for quantum circuits: The exploitation of triply even quantum error-correcting codesPhysical Review A, 2024
- Erratum: Secure multiparty quantum computation with few qubits [Phys. Rev. A 102 , 022405 (2020)]Physical Review A, 2024
- Unifying quantum verification and error-detection: theory and tools for optimisationsQuantum Science and Technology, 2024
- Multi-client distributed blind quantum computation with the Qline architectureNature Communications, 2023
- Satellite-based quantum information networks: use cases, architecture, and roadmapCommunications Physics, 2023
- QEnclave - A practical solution for secure quantum cloud computingnpj Quantum Information, 2022
- Secure multiparty quantum computation with few qubitsPhysical Review A, 2020
- Verification of Quantum Computation: An Overview of Existing ApproachesTheory of Computing Systems, 2018
- Optimised resource construction for verifiable quantum computationJournal of Physics A: Mathematical and Theoretical, 2017
- Multiparty entanglement in graph statesPhysical Review A, 2004