Quantum algorithm for the longest common subsequence problem
Wenxu Xu, Minghong Liao

TL;DR
This paper proposes a quantum algorithm aimed at solving the longest common subsequence problem, but it has been withdrawn due to a critical error in the entanglement of quantum registers.
Contribution
The paper introduces a quantum algorithm for the LCS problem but was withdrawn because of a fundamental flaw in the entanglement process.
Findings
Algorithm was not successfully implemented due to the error.
The error affects the validity of the quantum approach.
No experimental results are available.
Abstract
This paper has been withdrawn by the author(s), due a crucial error on the entanglement of registers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Quantum Computing Algorithms and Architecture
