Homomorphic Encryption for Quantum Annealing with Spin Reversal Transformations
Daniel O'Malley, John K. Golden

TL;DR
This paper introduces a homomorphic encryption method for quantum annealing using spin reversal transformations, enabling secure cloud-based quantum computations with minimal performance loss, crucial for privacy-sensitive applications.
Contribution
It presents a novel homomorphic encryption approach for quantum annealing that maintains efficiency, reducing the performance gap between quantum and classical computing in secure environments.
Findings
Encryption incurs little or no performance penalty
Reduces the gap between quantum and classical computing performance
Enables privacy-preserving quantum computations in the cloud
Abstract
Homomorphic encryption has been an area of study in classical computing for decades. The fundamental goal of homomorphic encryption is to enable (untrusted) Oscar to perform a computation for Alice without Oscar knowing the input to the computation or the output from the computation. Alice encrypts the input before sending it to Oscar, and Oscar performs the computation directly on the encrypted data, producing an encrypted result. Oscar then sends the encrypted result of the computation back to Alice, who can decrypt it. We describe an approach to homomorphic encryption for quantum annealing based on spin reversal transformations and show that it comes with little or no performance penalty. This is in contrast to approaches to homomorphic encryption for classical computing, which incur a significant additional computational cost. This implies that the performance gap between quantum…
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.
