Abstract
We propose a quantum string comparison method whose main building blocks are a specially designed oracle construction followed by Grover's search algorithm. The purpose of the oracle is to compare all alphabets of the string in parallel. This requires a unique input state preparation, which when combined with some ancillas will result in a deterministic binary success and failure compare outcome.
📄 Full Paper Available as PDF
This paper is available as a downloadable PDF.
📄 Download PDF
Comments (0)
No comments yet. Be the first to comment.
Research
