{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:08:20Z","timestamp":1775815700345,"version":"3.50.1"},"reference-count":24,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:00:00Z","timestamp":1726099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Bioinform."],"abstract":"<jats:p>The application of quantum principles in computing has garnered interest since the 1980s. Today, this concept is not only theoretical, but we have the means to design and execute techniques that leverage the quantum principles to perform calculations. The emergence of the quantum walk search technique exemplifies the practical application of quantum concepts and their potential to revolutionize information technologies. It promises to be versatile and may be applied to various problems. For example, the coined quantum walk search allows for identifying a marked item in a combinatorial search space, such as the quantum hypercube. The quantum hypercube organizes the qubits such that the qubit states represent the vertices and the edges represent the transitions to the states differing by one qubit state. It offers a novel framework to represent k-mer graphs in the quantum realm. Thus, the quantum hypercube facilitates the exploitation of parallelism, which is made possible through superposition and entanglement to search for a marked k-mer. However, as found in the analysis of the results, the search is only sometimes successful in hitting the target. Thus, through a meticulous examination of the quantum walk search circuit outcomes, evaluating what input-target combinations are useful, and a visionary exploration of DNA k-mer search, this paper opens the door to innovative possibilities, laying down the groundwork for further research to bridge the gap between theoretical conjecture in quantum computing and a tangible impact in bioinformatics.<\/jats:p>","DOI":"10.3389\/fbinf.2024.1401223","type":"journal-article","created":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T11:24:16Z","timestamp":1726140256000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The quantum hypercube as a k-mer graph"],"prefix":"10.3389","volume":"4","author":[{"given":"Gustavo","family":"Becerra-Gavino","sequence":"first","affiliation":[]},{"given":"Liliana Ibeth","family":"Barbosa-Santillan","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2024,9,12]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/bf01342185","article-title":"Quantum mechanical Hamiltonian models of turing machines","volume":"29","author":"Benioff","year":"1982","journal-title":"J. Stat. Phys."},{"key":"B2","doi-asserted-by":"publisher","first-page":"052330","DOI":"10.1103\/physreva.91.052330","article-title":"Relation between random walks and quantum walks","volume":"91","author":"Boettcher","year":"2015","journal-title":"Phys. Rev. A"},{"key":"B3","volume-title":"Quantum mechanics of collision processes","author":"Born","year":"1926"},{"key":"B4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1140\/epjqt\/s40507-021-00091-1","article-title":"Commercial applications of quantum computing","volume":"8","author":"Bova","year":"2021","journal-title":"EPJ quantum Technol."},{"key":"B5","doi-asserted-by":"publisher","first-page":"11032","DOI":"10.1073\/pnas.95.19.11032","article-title":"Quantum computing","volume":"95","author":"Brassard","year":"1998","journal-title":"Proc. Natl. Acad. Sci."},{"key":"B6","article-title":"The IBM Q experience and QISKit open-source quantum computing software","author":"Cross","year":"2018","journal-title":"Bull. Am. Phys. Soc"},{"key":"B7","volume-title":"Open quantum assembly language","author":"Cross","year":"2017"},{"key":"B8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1017\/s0305004100021162","article-title":"A new notation for quantum mechanics","volume":"35","author":"Dirac","year":"1939","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"B9","doi-asserted-by":"publisher","first-page":"bbae020","DOI":"10.1093\/bib\/bbae020","article-title":"Likelihood-based feature representation learning combined with neighborhood information for predicting circrna\u2013mirna associations","volume":"25","author":"Guo","year":"2024","journal-title":"Briefings Bioinforma."},{"key":"B10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-61601-4","volume-title":"Quantum computing for the quantum curious","author":"Hughes","year":"2021"},{"key":"B11","volume-title":"Algorithms for DNA sequencing","author":"Langmead","year":"2016"},{"key":"B12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.55056\/cte.117","article-title":"Hardware and software tools for teaching the basics of quantum informatics to students of specialized (high) schools","volume":"9","author":"Lehka","year":"2022","journal-title":"CTE Workshop Proc."},{"key":"B13","doi-asserted-by":"crossref","DOI":"10.14569\/IJACSA.2018.090354","volume-title":"The impact of quantum computing on present cryptography","author":"Mavroeidis","year":"2018"},{"key":"B14","doi-asserted-by":"publisher","first-page":"23838","DOI":"10.1109\/access.2020.2969038","article-title":"Simple and efficient pattern matching algorithms for biological sequences","volume":"8","author":"Neamatollahi","year":"2020","journal-title":"IEEE Access"},{"key":"B15","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.biosystems.2017.03.001","article-title":"A binary representation of the genetic code","volume":"155","author":"Nemzer","year":"2017","journal-title":"Biosystems"},{"key":"B16","volume-title":"Quantum computation and quantum information","author":"Nielsen","year":"2000"},{"key":"B17","volume-title":"Qiskit: an open-source framework for quantum computing","year":"2023"},{"key":"B18","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.26438\/ijcse\/v6i5.10671074","article-title":"Comparative study of string matching algorithms for dna dataset","volume":"6","author":"Rahate","year":"2018","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"B19","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1103\/physreva.51.2738","article-title":"Quantum coding","volume":"51","author":"Schumacher","year":"1995","journal-title":"Phys. Rev. A"},{"key":"B20","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/physreva.67.052307","article-title":"Quantum random-walk search algorithm","volume":"67","author":"Shenvi","year":"2003","journal-title":"Phys. Rev. A"},{"key":"B21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1088\/0034-4885\/61\/2\/002","article-title":"Quantum computing","volume":"61","author":"Steane","year":"1998","journal-title":"Rep. Prog. Phys."},{"key":"B22","volume-title":"Qiskit textbook","year":"2023"},{"key":"B23","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1109\/ASE51524.2021.9678792","article-title":"Qdiff: differential testing of quantum software stacks","volume-title":"2021 36th IEEE\/ACM international conference on automated software engineering (ASE)","author":"Wang","year":"2021"},{"key":"B24","volume-title":"Quantum computing: implementing hitting time for coined quantum walks on regular graphs","author":"Wanzambi","year":"2021"}],"container-title":["Frontiers in Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fbinf.2024.1401223\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T11:24:26Z","timestamp":1726140266000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fbinf.2024.1401223\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,12]]},"references-count":24,"alternative-id":["10.3389\/fbinf.2024.1401223"],"URL":"https:\/\/doi.org\/10.3389\/fbinf.2024.1401223","relation":{},"ISSN":["2673-7647"],"issn-type":[{"value":"2673-7647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,12]]},"article-number":"1401223"}}