Quantum string comparison method

05/16/2020
by   Vikram Menon, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

research
05/06/2020

Quantum pattern matching Oracle construction

We propose a couple of oracle construction methods for quantum pattern m...
research
09/23/2022

From String Detection to Orthogonal Vector Problem

Considering Grover's Search Algorithm (GSA) with the standard diffuser s...
research
06/30/2021

String Comparison on a Quantum Computer Using Hamming Distance

The Hamming distance is ubiquitous in computing. Its computation gets ex...
research
09/03/2021

Developing Mathematical Oracle Functions for Grover Quantum Search Algorithm

This article highlights some of the key operating principles of Grover a...
research
04/15/2021

Quantum Oracle Separations from Complex but Easily Specified States

A foundational question in quantum computational complexity asks how muc...
research
03/17/2020

A New Implementation of Manacher's Algorithm

Manacher's algorithm is optimal for the longest palindromic substring pr...
research
02/08/2021

Efficient construction of the extended BWT from grammar-compressed DNA sequencing reads

We present an algorithm for building the extended BWT (eBWT) of a string...

Please sign up or login with your details

Forgot password? Click here to reset