Key-updating functions for Liang's quantum homomorphic encryption are implemented as classical-quantum circuits, enabling runtime key updates and linear classically controlled S gates, and the approach is demonstrated on Szegedy quantum and semiclassical walks.
Demonstrating Quantum Homomorphic Encryption Through Simulation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Quantum homomorphic encryption (QHE), allows a quantum cloud server to compute on private data as uploaded by a client. We provide a proof-of-concept software simulation for QHE, according to the "EPR" scheme of Broadbent and Jeffery, for universal quantum circuits. We demonstrate the near-term viability of this scheme and provide verification that the additional cost of homomorphic circuit evaluation is minor when compared to the simulation cost of the quantum operations. Our simulation toolkit is an open-source Python implementation, that serves as a step towards further hardware applications of quantum homomorphic encryption between networked quantum devices.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption
Key-updating functions for Liang's quantum homomorphic encryption are implemented as classical-quantum circuits, enabling runtime key updates and linear classically controlled S gates, and the approach is demonstrated on Szegedy quantum and semiclassical walks.