https://github.com/antonioscardace/practical-quantum-esm
[ACM, 2024] Official implementation of "Practical Implementation of a Quantum String Matching Algorithm"
https://github.com/antonioscardace/practical-quantum-esm
acm exact-string-matching grovers-algorithm ibm qiskit quantum quantum-computing string-matching
Last synced: 29 days ago
JSON representation
[ACM, 2024] Official implementation of "Practical Implementation of a Quantum String Matching Algorithm"
- Host: GitHub
- URL: https://github.com/antonioscardace/practical-quantum-esm
- Owner: antonioscardace
- License: mit
- Created: 2025-03-02T22:46:57.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2025-11-20T11:45:21.000Z (3 months ago)
- Last Synced: 2025-11-20T13:18:40.766Z (3 months ago)
- Topics: acm, exact-string-matching, grovers-algorithm, ibm, qiskit, quantum, quantum-computing, string-matching
- Language: Jupyter Notebook
- Homepage:
- Size: 128 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Practical Implementation of a Quantum String Matching Algorithm
Simone Faro,
Francesco Pio Marino, and
Antonio Scardace
This repository contains the official code for our paper on Exact String Matching.
In our paper, we present the implementation of a quantum ESM algorithm, which identifies occurrences of a specified pattern $x$ of length $m$, within a text $y$ of length $n$ $\geq$ $m$, where both sequences are composed of characters taken from an alphabet $\Sigma$ of size $\sigma$. Our article presents an initial practical implementation of a quantum circuit tailored to address the ESM problem, with a particular focus on **binary strings**.
A classical **naïve** approach exhibits a worst-case time complexity of $\mathcal{O}(n+m)$, contrasting with the capability of quantum computation to achieve a $\tilde{O}(\sqrt{n})$ complexity using **Grover's search**.
We use the **Qiskit** open-source toolkit developed by **IBM**. While current real-world hardware often struggles to produce valid results due to **decoherence** and **quantum errors**, this study presents experimental results from a circuit **simulation** on classical hardware, validating the proposed implementation's efficacy.
## Citation
Please, reference this publication if you find this code useful:
```BibTeX
@inproceedings{10.1145/3660318.3660327,
author = {Marino, Francesco Pio and Faro, Simone and Scardace, Antonio},
title = {Practical Implementation of a Quantum String Matching Algorithm},
year = {2024},
publisher = {Association for Computing Machinery},
url = {https://doi.org/10.1145/3660318.3660327}
}
```