Have a personal or library account? Click to login
Reducing T-Count In Quantum String Matching Algorithm Using Relative-Phase Fredkin Gate Cover

Reducing T-Count In Quantum String Matching Algorithm Using Relative-Phase Fredkin Gate

Quantum Information & Computation
Volume 25 (2025): Issue 4 (August 2025)
By: Byeongyong Park,  Hansol Noh and  Doyeol Ahn  
Open Access
|Aug 2025

Authors

Byeongyong Park

Department of Electrical and Computer Engineering and Center for Quantum Information Processing, University of Seoul, Dongdaemun-gu, Seoul, Republic of Korea

Hansol Noh

Department of Electrical and Computer Engineering and Center for Quantum Information Processing, University of Seoul, Dongdaemun-gu, Seoul, Republic of Korea

Doyeol Ahn

dahn@uos.ac.kr

Department of Electrical and Computer Engineering and Center for Quantum Information Processing, University of Seoul, Dongdaemun-gu, Seoul, Republic of Korea
DOI: https://doi.org/10.2478/qic-2025-0016 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
Journal RSS Feed
Language: English
Page range: 299 - 314
Submitted on: Oct 25, 2024
Accepted on: Jun 2, 2025
Published on: Aug 22, 2025
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
quantum circuit,
quantum string matching,
T-count,
relative phase Fredkin gate,
Grover’s search algorithm
Related subjects:
Physics,
Quantum physics,
Mathematics,
Applied mathematics,
Computer sciences,
Computer sciences in the humanities,
Computer sciences,
Computer sciences in natural sciences

© 2025 Byeongyong Park, Hansol Noh, Doyeol Ahn, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 25 (2025): Issue 4 (August 2025)Next article