TY  - JOUR
AU  - Giordano, Sara
AU  - Martín-Delgado Alcántara, Miguel Ángel
PY  - 2026
DO  - 10.1016/j.aop.2025.170305
SN  - 0003-4916
UR  - https://hdl.handle.net/20.500.14352/129045
T2  - Annals of Physics
AB  - Testing graph completeness is a critical problem in computer science and network theory. Leveraging quantum computation, we present an efficient algorithm using the Szegedy quantum walk and quantum phase estimation (QPE). Our algorithm, which takes...
LA  - eng
M2  - 170305-1
PB  - Elsevier
KW  - Quantum computing
KW  - Quantum algorithms
KW  - Szegedy quantum walk
KW  - Quantum phase estimation
KW  - Graphs
KW  - Complete graphs
TI  - Quantum algorithm for testing graph completeness
TY  - journal article
VL  - 484
ER  -