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.
2024
9783031731242
9783031731259
Combinatorial algorithms
Quantum computing
String algorithms
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/666511
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact