2026-07-22T21:25:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17565 2024-03-06T10:59:55Z ddc:004 open_access

Asynchronous Multi-Party Quantum Computation Goyal, Vipul Liu-Zhang, Chen-Da Raizes, Justin Ribeiro, João Quantum Cryptography Multiparty Computation Asynchronous Multi-party quantum computation (MPQC) allows a set of parties to securely compute a quantum circuit over private quantum data. Current MPQC protocols rely on the fact that the network is synchronous, i.e., messages sent are guaranteed to be delivered within a known fixed delay upper bound, and unfortunately completely break down even when only a single message arrives late. Motivated by real-world networks, the seminal work of Ben-Or, Canetti and Goldreich (STOC'93) initiated the study of multi-party computation for classical circuits over asynchronous networks, where the network delay can be arbitrary. In this work, we begin the study of asynchronous multi-party quantum computation (AMPQC) protocols, where the circuit to compute is quantum. Our results completely characterize the optimal achievable corruption threshold: we present an n-party AMPQC protocol secure up to t < n/4 corruptions, and an impossibility result when t ≥ n/4 parties are corrupted. Remarkably, this characterization differs from the analogous classical setting, where the optimal corruption threshold is t < n/3. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vipul Goyal and Chen-Da Liu-Zhang and Justin Raizes and João Ribeiro 2023 Is Part Of LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITCS.2023.62 urn:nbn:de:0030-drops-175655 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.62 eng https://creativecommons.org/licenses/by/4.0/legalcode