This paper focuses on the practical implementation of quantum computation for various combinatorial problems in strings. We provide a detailed description of all the operators involved in solving the problems addressed in this paper, along with practical implementation details of our solution. The algorithms developed for quantum computation provide polylogarithmic solutions, showcasing a complexity improvement compared to classical solutions, with the best results achieving linear complexity.
Practical Quantum Combinatorial String Matching
Cantone D.;Faro S.;Marino F. P.
;Viola C.
2024-01-01
Abstract
This paper focuses on the practical implementation of quantum computation for various combinatorial problems in strings. We provide a detailed description of all the operators involved in solving the problems addressed in this paper, along with practical implementation details of our solution. The algorithms developed for quantum computation provide polylogarithmic solutions, showcasing a complexity improvement compared to classical solutions, with the best results achieving linear complexity.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
