Comparisons of Classic and Quantum String Matching Algorithms✱-Reference-Cited by-同舟云学术

Comparisons of Classic and Quantum String Matching Algorithms✱

Published:2022-11-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 4th International Conference on Advanced Information Science and System
language:
Short-container-title:

Author:

Gao Margaret¹^ORCID,Huang Rachel¹^ORCID,Mazumder Arul Rhik²^ORCID,Li Fei³^ORCID

Affiliation:

1. Thomas Jefferson High School for Science and Technology, USA

2. Massachusetts Academy of Math and Science at WPI, USA

3. Department of Computer Science,, George Mason University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3573834.3574498

Reference21 articles.

1. Alfred V. Aho , John E. Hopcroft , and Jeffrey D. Ullman . 1974. The design and analysis of computer algorithms . Addison-Wesley . Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison-Wesley.

2. Quantum Speedups for Exponential-Time Dynamic Programming Algorithms

3. Fernando G. S. L. Brandão , Amir Kalev , Tongyang Li , Cedric Yen-Yu Lin , Krysta M. Svore , and Xiaodi Wu . 2019 . Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning . In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP). Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu. 2019. Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP).

4. Quantum amplitude amplification and estimation

5. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication