pith. sign in

arxiv: 1708.06144 · v1 · pith:IWIBBGJFnew · submitted 2017-08-21 · 🪐 quant-ph

Classical multiparty computation using quantum resources

classification 🪐 quant-ph
keywords classicalclientsmultipartyquantumresourcescomputationalcomputefunction
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.