# Limitations on information theoretically secure quantum homomorphic encryption

arXiv: https://arxiv.org/abs/1406.2456 · HTML: https://mlsanity.com/paper/1406.2456/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Jun 2014.

## Built on by (most cited first, 2 of 2)

- [STIQ: Safeguarding Training and Inferencing of Quantum Neural Networks from Untrusted Cloud](https://mlsanity.com/paper/2405.18746/) (2024)
- [Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers](https://mlsanity.com/paper/2311.13546/) (2023)

## Abstract (arXiv)

Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information theoretically secure fully homomorphic encryption. Here we show, via an information localisation argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.