Abstract
Abstract Secure multi-party computation (SMPC) protocols allow several parties distrusting each other to collectively compute a function on their inputs. 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 security error is shown to be inverse polynomial with respect to the number of rounds in the protocol while it can be boosted to negligible for BQP 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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call