2000 character limit reached
Quantum string comparison method
Published 16 May 2020 in quant-ph and cs.DS | (2005.08950v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.