Phase Matching for a Generalized Grover's Algorithm

• URL: http://arxiv.org/abs/2605.13758v1
• Date: Wed, 13 May 2026 16:39:34 GMT
• Title: Phase Matching for a Generalized Grover's Algorithm
• Abstract summary: We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration.<n>We show that for the final iteration the optimal phase changes differ from traditional Grover's algorithm and do not observe phase matching.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical Grover's algorithm and phase matching remains to be optimal till the target probability gets close 1. However, as the probability of observation approaches 1, the optimal phase changes differ from $π$ and no longer observe phase matching. We provide the optimization statement to find the optimal phase changes given the current amplitude vector and the size of the set. To analyze this formula, we approach it from a numerical and analytical perspective, with the analytical perspective focusing on special cases that simplify the optimization and allow for general statements about its behavior. Finally, we provide an example of a 5 qubit system and show that for the final iteration the optimal phase changes differ from traditional Grover's algorithm and do not observe phase matching, but lead to an increase in the probability of the target.

Related papers

• On the conditional equivalence of phase retrieval algorithms [0.34376560669160394]
  We show that the GS magnitude replacement step is exactly a unit gradient descent step on an amplitude least-squares loss.<n>This equivalence enables seamless integration of classical phase retrieval with differentiable physics pipelines.
  arXiv  Detail & Related papers  (2026-06-05T13:31:52Z)
• Local Entropy Search over Descent Sequences for Bayesian Optimization [48.7994415668802]
  A practical alternative is to iteratively refine the neighborhood of an initial design using local optimization methods such as gradient descent.<n>We propose local entropy search (LES), a Bayesian optimization paradigm that explicitly targets the solutions reachable by the descent sequences.
  arXiv  Detail & Related papers  (2025-11-24T15:52:17Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• Optimal phase change for a generalized Grover's algorithm [0.0]
  We study the generalized Grover's algorithm with an arbitrary amplitude vector.<n>We find that a phase change of $pi$ stays optimal until the probability of observing the target is quite close to 1.
  arXiv  Detail & Related papers  (2025-09-24T23:12:20Z)
• Variational Quantum Sensing for Structured Linear Function Estimation [0.977068710930551]
  We study the variational optimization of entangled probe states for quantum sensing tasks.<n>Specifically, we consider scenarios where each qubit in a spin-1/2 array accumulates a phase phi_i = alpha_i * theta.<n>We benchmark the optimized circuits for two relevant cases: (i) uniform encoding, where all qubits contribute equally to the phase function, and (ii) a custom encoding where a central qubit dominates the weight vector.
  arXiv  Detail & Related papers  (2025-07-29T17:48:14Z)
• Enhancing Grover's Search Algorithm: A Modified Approach to Increase the Probability of Good States [0.0]
  This article introduces an enhancement to the Grover search algorithm to speed up computing the probability of finding good states. It suggests incorporating a rotation phase angle determined mathematically from the derivative of the model during the initial iteration.
  arXiv  Detail & Related papers  (2024-01-31T04:55:06Z)
• Robustness of different modifications of Grovers algorithm based on generalized Householder reflections with different phases [0.0]
  We study five Grovers algorithm modifications, where each iteration is constructed by two generalized Householder reflections. By using semi-empirical methods, we investigate various characteristics of the dependence between the probability to find solution and the phase errors.
  arXiv  Detail & Related papers  (2024-01-07T23:04:39Z)
• Amplitude Amplification for Optimization via Subdivided Phase Oracle [0.9176056742068814]
  We propose an algorithm using a modified variant of amplitude amplification to solve optimization problems. We show via numerical simulation that for normal, skew normal, and exponential distribution of objective values, the algorithm can be used to amplify the probability of measuring the optimal solution.
  arXiv  Detail & Related papers  (2022-05-02T01:14:27Z)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• Stochastic batch size for adaptive regularization in deep network optimization [63.68104397173262]
  We propose a first-order optimization algorithm incorporating adaptive regularization applicable to machine learning problems in deep learning framework. We empirically demonstrate the effectiveness of our algorithm using an image classification task based on conventional network models applied to commonly used benchmark datasets.
  arXiv  Detail & Related papers  (2020-04-14T07:54:53Z)

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.