REVIEW 1 cited by
Demonstrating Quantum Homomorphic Encryption Through Simulation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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...
Discussion (0). Continue with ORCID to comment.