Quantum-secure multiparty deep learning
<|reference_start|>Quantum-secure multiparty deep learning: 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 the MNIST classification task, we obtain test accuracies exceeding $96\%$ while leaking less than $0.1$ bits per weight symbol and $0.01$ bits per data symbol. This weight leakage is an order of magnitude below the minimum bit precision required for accurate deep learning using state-of-the-art quantization techniques. Our work lays the foundation for practical quantum-secure computation and unlocks secure cloud deep learning as a field.<|reference_end|>
@article{sulimany2024quantum-secure,
    title={Quantum-secure multiparty deep learning},
    author={Kfir Sulimany, Sri Krishna Vadlamani, Ryan Hamerly, Prahlad Iyengar,
  Dirk Englund},
    journal={arXiv preprint arXiv:2408.05629},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.05629},
    primaryClass={quant-ph cs.AI cs.IT cs.LG math.IT physics.optics}
}