{"id":26445401,"url":"https://github.com/antonioscardace/practical-quantum-esm","last_synced_at":"2026-01-15T23:02:16.332Z","repository":{"id":283055073,"uuid":"941708924","full_name":"antonioscardace/Practical-Quantum-ESM","owner":"antonioscardace","description":" [ACM, 2024] Official implementation of \"Practical Implementation of a Quantum String Matching Algorithm\"","archived":false,"fork":false,"pushed_at":"2025-11-20T11:45:21.000Z","size":131,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-11-20T13:18:40.766Z","etag":null,"topics":["acm","exact-string-matching","grovers-algorithm","ibm","qiskit","quantum","quantum-computing","string-matching"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/antonioscardace.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-03-02T22:46:57.000Z","updated_at":"2025-11-20T11:45:24.000Z","dependencies_parsed_at":null,"dependency_job_id":"da396a0c-bf02-45b1-89e4-797a40318924","html_url":"https://github.com/antonioscardace/Practical-Quantum-ESM","commit_stats":null,"previous_names":["antonioscardace/practical-quantum-esm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/antonioscardace/Practical-Quantum-ESM","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/antonioscardace%2FPractical-Quantum-ESM","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/antonioscardace%2FPractical-Quantum-ESM/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/antonioscardace%2FPractical-Quantum-ESM/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/antonioscardace%2FPractical-Quantum-ESM/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/antonioscardace","download_url":"https://codeload.github.com/antonioscardace/Practical-Quantum-ESM/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/antonioscardace%2FPractical-Quantum-ESM/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28473974,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-15T22:27:41.514Z","status":"ssl_error","status_checked_at":"2026-01-15T21:54:47.910Z","response_time":62,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["acm","exact-string-matching","grovers-algorithm","ibm","qiskit","quantum","quantum-computing","string-matching"],"created_at":"2025-03-18T11:18:16.773Z","updated_at":"2026-01-15T23:02:16.318Z","avatar_url":"https://github.com/antonioscardace.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cimg src=\"docs/images/readme.png\" alt=\"Quantum ESM Logo\"/\u003e\n\n\u003cp align=\"center\"\u003e\n    \u003cstrong\u003ePractical Implementation of a Quantum String Matching Algorithm\u003c/strong\u003e\u003cbr/\u003e\n    \u003ca href=\"https://scholar.google.com/citations?user=4-fzfJEAAAAJ\"\u003eSimone Faro\u003c/a\u003e,\n    \u003ca href=\"https://scholar.google.com/citations?user=QJDxRrsAAAAJ\"\u003eFrancesco Pio Marino\u003c/a\u003e, and\n    \u003ca href=\"https://scholar.google.com/citations?user=VNQ6auUAAAAJ\"\u003eAntonio Scardace\u003c/a\u003e\n\u003c/p\u003e\n\n\u003cdiv align=\"center\"\u003e\n    \u003ca href=\"https://img.shields.io/badge/Python-3.9%2B-blue?style=for-the-badge\" alt=\"Python\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-3.9%2B-blue?style=for-the-badge\" alt=\"Python\"\u003e\u003c/a\u003e\n    \u003ca href=\"https://dl.acm.org/doi/10.1145/3660318.3660327\"\u003e\u003cimg src=\"https://img.shields.io/badge/Paper-pdf-green?style=for-the-badge\u0026logo=adobeacrobatreader\u0026logoWidth=20\u0026logoColor=white\u0026color=94DD15\" alt=\"Paper PDF\"\u003e\u003c/a\u003e\n    \u003ca href=\"https://colab.research.google.com/github/antonioscardace/Practical-Quantum-ESM/blob/main/tutorial.ipynb\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Open%20in-Colab-red?style=for-the-badge\" alt=\"Open in Colab\"\u003e\u003c/a\u003e\n    \u003ca href=\"https://github.com/antonioscardace/Practical-Quantum-ESM/blob/master/LICENSE\"\u003e\u003cimg src=\"https://img.shields.io/badge/License-MIT-lightgrey?style=for-the-badge\" alt=\"License\"\u003e\u003c/a\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\nThis repository contains the official code for our paper on Exact String Matching.\u003cbr/\u003e\nIn 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**.\n\nA 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**.\n\nWe 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.\n\n## Citation\n\nPlease, reference this publication if you find this code useful:\n\n```BibTeX\n@inproceedings{10.1145/3660318.3660327,\n    author = {Marino, Francesco Pio and Faro, Simone and Scardace, Antonio},\n    title = {Practical Implementation of a Quantum String Matching Algorithm},\n    year = {2024},\n    publisher = {Association for Computing Machinery},\n    url = {https://doi.org/10.1145/3660318.3660327}\n}\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fantonioscardace%2Fpractical-quantum-esm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fantonioscardace%2Fpractical-quantum-esm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fantonioscardace%2Fpractical-quantum-esm/lists"}