Quantum-secure multiparty deep learning
Kfir Sulimany, Sri Krishna Vadlamani, Ryan Hamerly, Prahlad Iyengar, Dirk Englund

TL;DR
This paper introduces a quantum-inspired linear algebra engine for secure multiparty deep learning that ensures data privacy with minimal information leakage, enabling practical quantum-secure cloud AI.
Contribution
It proposes a novel linear algebra engine leveraging quantum light for information-theoretic security in multiparty deep learning, with rigorous bounds on data and weight leakage.
Findings
Achieved over 96% accuracy on MNIST with minimal data leakage.
Leakage is an order of magnitude below quantization thresholds.
Lays groundwork for practical quantum-secure cloud deep learning.
Abstract
Secure multiparty computation enables the joint evaluation of multivariate functions across distributed users while ensuring the privacy of their local inputs. This field has become increasingly urgent due to the exploding demand for computationally intensive deep learning inference. These computations are typically offloaded to cloud computing servers, leading to vulnerabilities that can compromise the security of the clients' data. To solve this problem, we introduce a linear algebra engine that leverages the quantum nature of light for information-theoretically secure multiparty computation using only conventional telecommunication components. We apply this linear algebra engine to deep learning and derive rigorous upper bounds on the information leakage of both the deep neural network weights and the client's data via the Holevo and the Cram\'er-Rao bounds, respectively. Applied to…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
