• Corpus ID: 248069648

Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model

  title={Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model},
  author={Massimo Equi and Arianne Meijer-van de Griend and Veli Makinen},
Many problems that can be solved in quadratic time have bit-parallel speed-ups with factor $w$, where $w$ is the computer word size. For example, edit distance of two strings of length $n$ can be solved in $O(n^2/w)$ time. In a reasonable classical model of computation, one can assume $w=\Theta(\log n)$. There are conditional lower bounds for such problems stating that speed-ups with factor $n^\epsilon$ for any $\epsilon>0$ would lead to breakthroughs in complexity theory. However, these… 

Figures from this paper

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce

This work provides a quantum constant approximation algorithm for computing the edit distance in truly subquadratic time, and provides a MapReduce algorithm to approximate edit distance within a factor of $3, with sublinearly many machines and sublinear memory.

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems

This work presents sublinear time quantum algorithms for longest common substring, longest palindrome substring and Ulam distance along with quantum lower bounds and proves that LCS needs at least time to solve these problems.

Parallelizing the queries in a bucket-brigade quantum random access memory

It is concluded that, in theory, fault-tolerant bucket- Brigade quantum RAM queries can be performed approximately with the speed of classical RAM, and the exponentially many ancillas from the bucket-brigade addressing scheme are a tradeoff cost for achieving exponential query speedup compared to quantum read-only memories whose queries are sequential by design.

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

This paper shows that, if the edit distance can be computed in time O(n2-δ) for some constant δ>0, then the satisfiability of conjunctive normal form formulas with N variables and M clauses can be solved in time MO(1) 2(1-ε)N for a constant ε>0.

A fast quantum mechanical algorithm for database search

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .

Limit on the Speed of Quantum Computation in Determining Parity

It is shown that any quantum algorithm capable of determining the parity of f contains at least N/2 applications of the unitary operator which evaluates f and quantum computers cannot outperform classical computers.

On the robustness of bucket brigade quantum RAM

It is argued that quantum error correction for the circuit causes the quantum bucket brigade architecture to lose its primary advantage of a small number of ‘active’ gates, since all components have to be actively error corrected.

String Matching in ˜ O ( √ n + √ m ) Quantum Time

This algorithm combines quantum searching algorithms with a technique from parallel string matching, called Deterministic Sampling, to determine whether a given pattern p of length m occurs in a given text t of length n in ˜ O ( √ n + √ m ) 1 time, with inverse polynomial failure probability.

On the Complexity of String Matching for Graphs

A conditional lower bound is proved stating that, for any constant ϵ > 0, an O(|E|1 − ϵ m)-time algorithm for exact string matching in graphs, with node labels and pattern drawn from a binary alphabet, cannot be achieved unless the Strong Exponential Time Hypothesis (SETH) is false.

Design and Analysis of Pattern Matching Algorithms Based on QuRAM Processing

The main objective is to design quantum algorithm for both single and multiple patterns on a processing architecture of quantum random access memory QuRAM and justify that the algorithms outperform the classical and quantum solutions and they are competent for implementing over quantum computer.