Quantum search algorithm on weighted databases

Yifan Sun

doi:10.1038/s41598-024-81701-7

Return

Quantum search algorithm on weighted databases

2024-12-04

Yifan Sun *

Lian-Ao Wu *

DOI：10.1038/s41598-024-81701-7

Original

Save

View PDF

Abstract

En 中文

The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research extensively investigates Grover's search methodology within non-uniformly distributed databases, a scenario frequently encountered in practical applications. Our analysis reveals that the behavior of the Grover evolution differs significantly when applied to non-uniform databases compared to uniform or 'unstructured databases'. Based on the property of differential equation, it is observed that the search process facilitated by this evolution does not consistently result in a speed-up, and we have identified specific criteria for such situations. Furthermore, we have extended this investigation to databases characterized by coherent states, confirming the speed-up achieved through Grover evolution via rigorous numerical verification. In conclusion, our study provides an enhancement to the original Grover algorithm, offering insights to optimize implementation strategies and broaden its range of applications.

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.