Quantum algorithm for unstructured search of ranked targets

• URL: http://arxiv.org/abs/2412.00332v2
• Date: Tue, 01 Jul 2025 01:46:37 GMT
• Title: Quantum algorithm for unstructured search of ranked targets
• Abstract summary: Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm.<n>We show that the coherence between multiple marked items tends to increase the probability of finding the most prioritized one in Grover's algorithm with our oracle operator.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple marked items, Grover's algorithm has the property of finding one of them uniformly at random. To further broaden the application range, it was generalized so that it finds marked items with probabilities according to their priority by encoding the priority into amplitudes applied by Grover's oracle operator. In this paper, to achieve a similar generalization, we examine a different encoding that incorporates the priority into phases applied by the oracle operator. We compare the previous and our oracle operators and observe that which one performs better depends on priority parameters. Since the priority parameters can be considered as the magnitude of the correlated phase error on Grover's oracle operator, the analysis of our oracle operator also reveals the robustness of the original Grover's algorithm against correlated noises. We further numerically show that the coherence between multiple marked items tends to increase the probability of finding the most prioritized one in Grover's algorithm with our oracle operator.

Related papers

• Random Grover Search [2.4664400883501956]
  We study a randomized Grover search algorithm that directly uses constraint oracles.<n>We show that highly biased sampling distributions can still achieve near-unit success probability.
  arXiv  Detail & Related papers  (2026-06-10T07:34:05Z)
• Grover Adaptive Search with Problem-Specific State Preparation [0.0345923194452408]
  We build upon previous work by Baertschi and Eidenbenz to construct a state preparation routine for the Traveling Salesperson Problem.<n>With our iterations, we aim to achieve a reasonable approximation ratio with only a number of iterations.
  arXiv  Detail & Related papers  (2026-02-09T09:21:04Z)
• Grover's search with an oracle distinguishing between solutions [0.0]
  modification can be used to maintain a high probability of finding a solution for a number of iterations equal to or more than the one required by the deterministic Grover's algorithm.<n>We use various semiempirical methods to show that the interval of number of iterations for which the algorithm keeps the probability of finding solution high depends on the register size and the oracle phases.
  arXiv  Detail & Related papers  (2025-08-27T11:19:07Z)
• Scalable Private Partition Selection via Adaptive Weighting [66.09199304818928]
  In a private set union, users hold subsets of items from an unbounded universe. The goal is to output as many items as possible from the union of the users' sets while maintaining user-level differential privacy. We propose an algorithm for this problem, MaximumDegree (MAD), which adaptively reroutes weight from items with weight far above the threshold needed for privacy to items with smaller weight.
  arXiv  Detail & Related papers  (2025-02-13T01:27:11Z)
• Distributed exact multi-objective quantum search algorithm [9.09986332387569]
  Grover's algorithm has quadratic acceleration in multi-objection search. Iterated operator in Grover's algorithm is a key element and plays an important role in amplitude amplification.
  arXiv  Detail & Related papers  (2024-09-06T06:16:53Z)
• Near-deterministic quantum search algorithm without phase control [10.754825115553086]
  Grover's algorithm can find the target item with certainty only if searching one out of four. We propose a near-deterministic quantum search algorithm without the phase control.
  arXiv  Detail & Related papers  (2024-07-15T14:20:47Z)
• Accelerated quantum search using partial oracles and Grover's algorithm [0.0]
  Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. We explore the idea of associating a separate oracle with each bit of the matching condition, obtaining multiple partial oracle functions which can be tested independently. The algorithm is validated against the simplest kind of search scenario, where the incoming index bits are scrambled using a permutation operation.
  arXiv  Detail & Related papers  (2024-03-19T11:32:02Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Triangle and Four Cycle Counting with Predictions in Graph Streams [59.05440236993604]
  We propose data-driven one-pass streaming algorithms for estimating the number of triangles and four cycles. We use a trained oracle that can predict certain properties of the stream elements to improve on prior "classical" algorithms. Our methodology expands upon prior work on "classical" streaming algorithms, as previous multi-pass and random order streaming algorithms can be seen as special cases.
  arXiv  Detail & Related papers  (2022-03-17T19:26:00Z)
• Deterministic Grover search with a restricted oracle [2.976027966501599]
  Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms. We present a modified version to return the correct result with certainty without having user control over the quantum search oracle.
  arXiv  Detail & Related papers  (2022-01-01T02:04:11Z)
• Grover's Algorithm with Diffusion and Amplitude Steering [0.0]
  We present a generalization of Grover's algorithm that searches an arbitrary subspace of the multi-dimensional Hilbert space. We also outline a generalized Grover's algorithm that takes into account higher level correlations that could exist between database elements.
  arXiv  Detail & Related papers  (2021-10-21T14:15:32Z)
• Bayesian decision-making under misspecified priors with applications to meta-learning [64.38020203019013]
  Thompson sampling and other sequential decision-making algorithms are popular approaches to tackle explore/exploit trade-offs in contextual bandits. We show that performance degrades gracefully with misspecified priors.
  arXiv  Detail & Related papers  (2021-07-03T23:17:26Z)
• Determinantal Beam Search [75.84501052642361]
  Beam search is a go-to strategy for decoding neural sequence models. In use-cases that call for multiple solutions, a diverse or representative set is often desired. By posing iterations in beam search as a series of subdeterminant problems, we can turn the algorithm into a diverse subset selection process.
  arXiv  Detail & Related papers  (2021-06-14T13:01:46Z)
• Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
  This paper investigates the classical integer least-squares problem which estimates signals integer from linear models. The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning. We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
  arXiv  Detail & Related papers  (2021-01-07T08:00:02Z)
• Quantum Search with Prior Knowledge [15.384459603233978]
  We propose a new generalization of Grover's search algorithm which performs better than the standard Grover algorithm in average under this setting. We prove that our new algorithm achieves the optimal expected success probability of finding the solution if the number of queries is fixed.
  arXiv  Detail & Related papers  (2020-09-18T09:50:33Z)
• Differentially Private Clustering: Tight Approximation Ratios [57.89473217052714]
  We give efficient differentially private algorithms for basic clustering problems. Our results imply an improved algorithm for the Sample and Aggregate privacy framework. One of the tools used in our 1-Cluster algorithm can be employed to get a faster quantum algorithm for ClosestPair in a moderate number of dimensions.
  arXiv  Detail & Related papers  (2020-08-18T16:22:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.