References
- L. K. Grover (1997). “Quantum mechanics helps in searching for a needle in a haystack.” Physical Review Letters, 79, 325–328.
- G. Brassard, P. Høyer, M. Mosca and A. Tapp (2002). “Quantum amplitude amplification and estimation”, in Contemporary Mathematics Series Millennium, Vol. 305. New York: American Mathematical Society, pp. 53–74.
- H. Ramesh and V. Vinay (2003). “String matching in
quantum time.” Journal of Discrete Algorithms, 1, 103–110.
- P. Niroula and Y. Nam (2021). “A quantum algorithm for string matching.” npj Quantum Information, 7, 37.
- S. I. Hakak, A. Kamsin, P. Shivakumara, G. A. Gilkar, W. Z. Khan and M. Imran (2019). “Exact string matching algorithms: survey, issues, and future research directions.” IEEE Access, 7, 69614–69637.
- H. Schütze, C. D. Manning and P. Raghavan (2008). Introduction to Information Retrieval. Cambridge: Cambridge University Press.
- R. R. Naik, M. B. Landge and C. N. Mahender (2015). “A review on plagiarism detection tools.” International Journal of Computer Applications, 125.
- M. K. Vijaymeena and K. Kavitha (2016). “A survey on similarity measures in text mining.” Machine Learning with Applications: International Journal, 3, 19–28.
- H. Lu, K. Zheng, B. Liu, X. Zhang and Y. Liu (2006). “A memory-efficient parallel string matching architecture for high-speed intrusion detection.” IEEE Journal on Selected Areas in Communications, 24, 1793–1804.
- R.-T. Liu, N.-F. Huang, C.-H. Chen and C.-N. Kao (2004). “A fast string-matching algorithm for network processor-based intrusion detection system.” ACM Transactions on Embedded Computing Systems, 3, 614–633.
- A. Lopez (2008). “Statistical machine translation.” ACM Computing Surveys, 40, 1–49.
- J. Tarhio and H. Peltola (1997). “String matching in the DNA alphabet.” Software: Practice and Experience, 27, 851–861.
- C. Ryu, T. Lecroq and K. Park (2020). “Fast string matching for DNA sequences.” Theoretical Computer Science, 812, 137–148.
- A. A. Karcioglu and H. Bulut (2021). “Improving hash-q exact string matching algorithm with perfect hashing for DNA sequences.” Computers in Biology and Medicine, 131, 104292.
- I. Alsmadi and M. Nuser (2012). “String matching evaluation methods for DNA comparison.” International Journal of Advanced Science and Technology, 47, 13–32.
- E. T. Campbell, B. M. Terhal and C. Vuillot (2017). “Roads towards fault-tolerant universal quantum computatio.” Nature, 549, 172–179.
- A. G. Fowler, M. Mariantoni, J. M. Martinis and A. N. Cleland (2012). “Surface codes: Towards practical large-scale quantum computation.” Physical Review A, 86, 032324.
- E. Knill (2004). “Fault-tolerant postselected quantum computation: schemes.” arXiv:0402171.
- S. Bravyi and A. Kitaev (2005). “Universal quantum computation with ideal Clifford gates and noisy ancillas.” Physical Review A, 71, 022316.
- P. Aliferis, D. Gottesman and J. Preskill (2006). “Quantum accuracy threshold for concatenated distance-3 codes.” Quantum Information & Computation, 6, 97–165.
- A. G. Fowler, A. M. Stephens and P. Groszkowski (2009). “High-threshold universal quantum computation on the surface code.” Physical Review A, 80, 052312.
- A. Montanaro (2017). “Quantum pattern matching fast on average.” Algorithmica, 77, 16–39.
- D. Maslov (2016). “Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization.” Physical Review A, 93, 022311.
- J. A. Smolin and D. P. DiVincenzo (1996). “Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate.” Physical Review A, 53, 2855–2856.
- A. Javadi-Abhari, M. Treinish, K. Krsulich, C.J. Wood, J. Lishman, J. Gacon, S. Martiel, P.D. Nation, L.S. Bishop, A.W. Cross, B.R. Johnson and J.M. Gambetta (2024). “Quantum computing with Qiskit.” arXiv:2405.08810.
- P. Selinger (2013). “Quantum circuits of T-depth one.” Physical Review A, 87, 042302.
- Y. Nam, Y. Su and D. Maslov (2020). “Approximate quantum Fourier transform with O(n log(n)) T gates.” npj Quantum Information, 6, 26.
- K. Oonishi, T. Tanaka, S. Uno, T. Satoh, R. Van Meter and N. Kunihiro (2021). “Efficient construction of a control modular adder on a carry-lookahead adder using relative-phase Toffoli gates.” IEEE Transactions on Quantum Engineering, 3, 1–18.
- C. Jones (2013). “Low-overhead constructions for the fault-tolerant Toffoli gate.” Physical Review A, 87, 022328.
- K. Prousalis, A. Kydros and N. Konofaos (2025). “A quantum string-matching algorithm.” Advanced Quantum Technologies, 8, 2400250.
- Y. Zhang, K. Lu, Y. Gao and M. Wang (2013). “NEQR: A novel enhanced quantum representation of digital images.” Quantum Information Processing, 12, 2833.
- P. Q. Le, F. Dong and K. Hirota (2011). “A flexible representation of quantum images for polynomial preparation, image compression, and processing operations.” Quantum Information Processing, 10, 63.
- S. Jiang, R.-G. Zhou, W. Hu and Y. Li (2019). “Improved quantum image median filtering in the spatial domain.” International Journal of Theoretical Physics, 58, 2115.
- P. Li, X. Liu and H. Xiao (2018). “Quantum image median filtering in the spatial domain.” Quantum Information Processing, 17, 1.
- T. Li, P. Zhao, Y. Zhou and Y. Zhang (2023). “Quantum image processing algorithm using line detection mask based on NEQR.” Entropy, 25, 738.
- D. Wang, Z.-H. Liu, W.-N. Zhu and S.-Z. Li (2012). “Design of quantum comparator based on extended general Toffoli gates with multiple targets.” Computer Science, 39, 302.
- H.-Y. Xia, H. Zhang, S.-X. Song, H. Li, Y.-J. Zhou and X. Chen (2020). “Design and simulation of quantum image binarization using quantum comparator.” Modern Physics Letters A 35, 2050049.