Classical multiparty computation using quantum resources

  title={Classical multiparty computation using quantum resources},
  author={M. Clementi and A. Pappa and A. Eckstein and I. Walmsley and E. Kashefi and S. Barz},
  journal={Physical Review A},
In this work, we demonstrate a way to perform classical multiparty computing among 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 nonlinear multivariable function that lies beyond their individual capabilities. The clients are only allowed to perform classical xor gates and single-qubit gates on… Expand

Figures from this paper

Secure multi-party computation with a quantum manner
This paper considers the secure multi-party computation for n-variable polynomial functions over the finite field GF(d) and proposes two protocols using quantum resources to compute the function within a one-time execution. Expand
Secure multiparty quantum computation based on Lagrange unitary operator
A secure multiparty quantum computation protocol using the Lagrange unitary operator and the Shamir threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. Expand
Quantum simulation from the bottom up: the case of rebits
This work detail one particular simulation of nonlinearity on a quantum computer, showing how the entire class of $\mathbb{R}$-unitary evolutions can be simulated using a unitary, real-amplitude quantum computer (consisting of $n+1$ qubits in total). Expand
Tsirelson's bound and Landauer's principle in a single-system game
We introduce a simple single-system game inspired by the Clauser-Horne-Shimony-Holt (CHSH) game. For qubit systems subjected to unitary gates and projective measurements, we prove that any strategyExpand
Quantum Advantage from Sequential-Transformation Contextuality.
Within a transformation-based model for quantum computation, strong sequential-transformation contextuality is necessary and sufficient for deterministic computation of nonlinear functions if classical components are restricted to mod2 linearity and matching constraints apply to any underlying ontology. Expand
Correlations for computation and computation for correlations
The connection between quantum correlation and computability shown here has applications in quantum technologies, and is important for networked computing being performed by measurements on distributed multipartite quantum states. Expand
Quantum Advantage in Information Retrieval
It is pinpointed a characteristic of quantum systems that enables quantum advantage in any bounded-memory information retrieval task called sequential contextuality, shown not only to be necessary and sufficient for quantum advantage, but also to quantify the degree of advantage. Expand


Going Beyond Bell’s Theorem
Bell’s Theorem proved that one cannot in general reproduce the results of quantum theory with a classical, deterministic local model. However, Einstein originally considered the case where one couldExpand
Many graphics and vision problems can be expressed as non-linear least squares optimizations of objective functions over visual data, such as images and meshes. The mathematical descriptions of theseExpand
AIV Assembly, Integration, Verification AOA Angle of Attack CAD Computer Aided Design CFD Computational Fluid Dynamics GLOW Gross Lift-Off Mass GNC Guidance Navigation and Control IR Infra-Red LEOExpand
Describes an information system for the management of agricultural research, INFORM, developed by the International Service for National Agricultural Research (ISNAR). The system takes data onExpand
  • Rev. Lett. 106, 013603
  • 2011
6 and I
  • A. Walmsley, Physical Review A 93, 032339
  • 2016
Journal of Quantum Information and Computation
  • 0061
  • 2016
  • Rev. A 93, 032339
  • 2016
  • Rev. A 91, 032326
  • 2015
Optics express 21
  • 13975
  • 2013