Physics – Quantum Physics
Scientific paper
2000-02-25
Physics
Quantum Physics
LaTeX, 5 pages
Scientific paper
10.1103/PhysRevE.62.7532
Quantum search algorithms are considered in the context of protein sequence comparison in biocomputing. Given a sample protein sequence of length m (i.e m residues), the problem considered is to find an optimal match in a large database containing N residues. Initially, Grover's quantum search algorithm is applied to a simple illustrative case - namely where the database forms a complete set of states over the 2^m basis states of a m qubit register, and thus is known to contain the exact sequence of interest. This example demonstrates explicitly the typical O(sqrt{N}) speedup on the classical O(N) requirements. An algorithm is then presented for the (more realistic) case where the database may contain repeat sequences, and may not necessarily contain an exact match to the sample sequence. In terms of minimizing the Hamming distance between the sample sequence and the database subsequences the algorithm finds an optimal alignment, in O(sqrt{N}) steps, by employing an extension of Grover's algorithm, due to Boyer, Brassard, Hoyer and Tapp for the case when the number of matches is not a priori known.
No associations
LandOfFree
Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-226813