RT Journal Article
T1 Homomorphic encryption of the k=2 Bernstein–Vazirani algorithm
A1 Fernández Ortiz, Pablo
A1 Martín-Delgado Alcántara, Miguel Ángel
AB We introduce a class of circuits that solve a particular case of the Bernstein-Vazirani recursive problem for second-level recursion. This class of circuits allows for the implementation of the oracle using a number of T-gates that grows linearly with the number of qubits in the problem. We find an application of this scheme to quantum homomorphic encryption (QHE), which is an important cryptographic technology useful for delegated quantum computing, allowing a remote server to perform quantum computations on encrypted quantum data, so that the server cannot know anything about the client's data. Liang's QHE schemes are suitable for circuits with a polynomial number of gates T/T† dagger. Thus, the simplified circuits we have constructed can be evaluated homomorphically in an efficient manner.
PB IOP Publishing
SN 1751-8113
YR 2024
FD 2024-08-22
LK https://hdl.handle.net/20.500.14352/137164
UL https://hdl.handle.net/20.500.14352/137164
LA eng
NO Pablo Fernández and Miguel A Martin-Delgado 2024 J. Phys. A: Math. Theor. 57 365301
NO ©2024 The Author(s).W911NF-14-1-0103,PRE2019-090517
NO Ministerio de Ciencia, Innovación y Universidades (España)
NO Agencia Estatal de Investigación (España)
NO European Commission
NO Comunidad de Madrid
NO Ministerio de Economía y Competividad (España)
NO Army Research Office (US)
DS Docta Complutense
RD 8 jun 2026