Classical multiparty computation using quantum resources
arXiv:1708.06144 · doi:10.1103/PhysRevA.96.062317
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.
6 pages, 4 figures
References in corpus (8)
- Contextuality in Measurement-based Quantum Computation
- A bright, pulsed two-mode squeezer
- Computational power of correlations
- An Optimized Photon Pair Source for Quantum Circuits
- Attacks exploiting deviation of mean photon number in quantum key distribution and coin tossing
- Non-adaptive Measurement-based Quantum Computation and Multi-party Bell Inequalities
- Secure Multi-Party Computation with a Dishonest Majority via Quantum Means
- Enhanced delegated computing using coherence
Cited by in corpus (7)
- Quantum Advantage from Sequential-Transformation Contextuality
- Multi-client distributed blind quantum computation with the Qline architecture
- Quantum Advantage in Information Retrieval
- Tsirelson's bound and Landauer's principle in a single-system game
- Quantum cryptography beyond key distribution: theory and experiment
- Correlations for computation and computation for correlations
- Quantum advantage in temporally flat measurement-based quantum computation