Classical multiparty computation using quantum resources
Marco Clementi, Anna Pappa, Andreas Eckstein, Ian A. Walmsley, Elham, Kashefi, Stefanie Barz

TL;DR
This paper introduces a quantum-assisted method for classical multiparty computation, enabling resource-limited clients to jointly compute non-linear functions securely using minimal classical and quantum operations.
Contribution
It presents a novel approach combining classical and quantum resources to perform complex multiparty computations beyond classical limitations.
Findings
Clients can compute non-linear functions using only XOR and single-qubit gates.
Secure multiparty computation is feasible with limited classical and quantum operations.
Proof-of-concept demonstrates practical implementation with photonic qubits for four clients.
Abstract
In this work, we demonstrate a new way to perform classical multiparty computing amongst parties with limited computational resources. Our method harnesses quantum resources to increase the computational power of the individual parties. We show how a set of clients restricted to linear classical processing are able to jointly compute a non-linear multivariable function that lies beyond their individual capabilities. The clients are only allowed to perform classical XOR gates and single-qubit gates on quantum states. We also examine the type of security that can be achieved in this limited setting. Finally, we provide a proof-of-concept implementation using photonic qubits, that allows four clients to compute a specific example of a multiparty function, the pairwise AND.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
