Reducing T-count in quantum string matching algorithm using relative-phase Fredkin gate

DOI10.2478/QIC-2025-0016MaRDI QIDQ7295909zbMATH OpenFDO

Authors Byeongyong Park, Hansol Noh, Doyeol (David) Ahn

Publication date 14 July 2026

Published in Quantum Information \& Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/QIC-2025-0016

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum computation (81P68)

Cites work

• A flexible representation of quantum images for polynomial preparation, image compression, and processing operations
• Design and simulation of quantum image binarization using quantum comparator
• Fast string matching for DNA sequences
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Improved quantum image median filtering in the spatial domain
• Introduction to Information Retrieval
• NEQR: a novel enhanced quantum representation of digital images
• Quantum accuracy threshold for concatenated distance-3 code
• Quantum image median filtering in the spatial domain
• Quantum pattern matching fast on average
• String matching in O( n+ m) quantum time
• Universal quantum computation with ideal Clifford gates and noisy ancillas

This page was built for publication: Reducing T-count in quantum string matching algorithm using relative-phase Fredkin gate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295909)