Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption

As cloud services continue to expand, the security of private data stored and processed in these environments has become paramount. This work delves into quantum homomorphic encryption (QHE), an emerging technology that facilitates secure computation on encrypted quantum data without revealing the u...

Descripción completa

Detalles Bibliográficos
Autores: Ortega, Sergio A., Fernández, Pablo, Martín-Delgado Alcántara, Miguel Ángel
Tipo de recurso: artículo
Fecha de publicación:2025
País:España
Institución:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
Idioma:inglés
OAI Identifier:oai:docta.ucm.es:20.500.14352/122421
Acceso en línea:https://hdl.handle.net/20.500.14352/122421
Access Level:acceso abierto
Palabra clave:53
Quantum computation
Quantum communication
Homomorphic encryption
Quantum algorithms
Quantum walks
Física (Física)
2212 Física Teórica
id ES_945bf6911ff4524ef3fc2565fbda9225
oai_identifier_str oai:docta.ucm.es:20.500.14352/122421
network_acronym_str ES
network_name_str España
repository_id_str
spelling Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryptionOrtega, Sergio A.Fernández, PabloMartín-Delgado Alcántara, Miguel Ángel53Quantum computationQuantum communicationHomomorphic encryptionQuantum algorithmsQuantum walksFísica (Física)2212 Física TeóricaAs cloud services continue to expand, the security of private data stored and processed in these environments has become paramount. This work delves into quantum homomorphic encryption (QHE), an emerging technology that facilitates secure computation on encrypted quantum data without revealing the underlying information. We reinterpret QHE schemes through classical-quantum circuits (CQC), enhancing efficiency and addressing previous limitations related to key computations. Our approach eliminates the need for exponential key preparation by calculating keys in real-time during simulation, leading to a linear complexity in classically controlled gates. We also investigate the T/T dagger-gate complexity associated with various quantum walks, particularly Szegedy quantum and semiclassical algorithms, demonstrating efficient homomorphic implementations across different graph structures. Our simulations, conducted in Qiskit, validate the effectiveness of QHE for both standard and semiclassical walks. The rules for the homomorphic evaluation of the reset and intermediate measurement operations have also been included to perform the QHE of semiclassical walks. Additionally, we introduce the CQC-QHE library, a comprehensive tool that simplifies the construction and simulation of CQC tailored for QHE. Future work will focus on optimizing classical functions within this framework and exploring broader graph types to enhance QHE applications in practical scenarios.IOP PublishingUniversidad Complutense de Madrid20252025-05-1520252025-05-15journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/20.500.14352/122421reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/1224212026-06-02T12:44:21Z
dc.title.none.fl_str_mv Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
title Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
spellingShingle Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
Ortega, Sergio A.
53
Quantum computation
Quantum communication
Homomorphic encryption
Quantum algorithms
Quantum walks
Física (Física)
2212 Física Teórica
title_short Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
title_full Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
title_fullStr Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
title_full_unstemmed Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
title_sort Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
dc.creator.none.fl_str_mv Ortega, Sergio A.
Fernández, Pablo
Martín-Delgado Alcántara, Miguel Ángel
author Ortega, Sergio A.
author_facet Ortega, Sergio A.
Fernández, Pablo
Martín-Delgado Alcántara, Miguel Ángel
author_role author
author2 Fernández, Pablo
Martín-Delgado Alcántara, Miguel Ángel
author2_role author
author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv 53
Quantum computation
Quantum communication
Homomorphic encryption
Quantum algorithms
Quantum walks
Física (Física)
2212 Física Teórica
topic 53
Quantum computation
Quantum communication
Homomorphic encryption
Quantum algorithms
Quantum walks
Física (Física)
2212 Física Teórica
description As cloud services continue to expand, the security of private data stored and processed in these environments has become paramount. This work delves into quantum homomorphic encryption (QHE), an emerging technology that facilitates secure computation on encrypted quantum data without revealing the underlying information. We reinterpret QHE schemes through classical-quantum circuits (CQC), enhancing efficiency and addressing previous limitations related to key computations. Our approach eliminates the need for exponential key preparation by calculating keys in real-time during simulation, leading to a linear complexity in classically controlled gates. We also investigate the T/T dagger-gate complexity associated with various quantum walks, particularly Szegedy quantum and semiclassical algorithms, demonstrating efficient homomorphic implementations across different graph structures. Our simulations, conducted in Qiskit, validate the effectiveness of QHE for both standard and semiclassical walks. The rules for the homomorphic evaluation of the reset and intermediate measurement operations have also been included to perform the QHE of semiclassical walks. Additionally, we introduce the CQC-QHE library, a comprehensive tool that simplifies the construction and simulation of CQC tailored for QHE. Future work will focus on optimizing classical functions within this framework and exploring broader graph types to enhance QHE applications in practical scenarios.
publishDate 2025
dc.date.none.fl_str_mv 2025
2025-05-15
2025
2025-05-15
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/122421
url https://hdl.handle.net/20.500.14352/122421
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv IOP Publishing
publisher.none.fl_str_mv IOP Publishing
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869413687813472256
score 15,81155

Similares en LA Referencia