Approximate Phase Search and Eigen Estimation using Modified Grover's Algorithm
arXiv:2012.11497
Abstract
An attempt has been made in this paper to modify Grover's Algorithm to find the binary string solutions approximating a target cost value. In that direction, new Controlled Oracle and the Local Diffusion Operator are suggested, apart from incorporating suitable ancilla qubits. A possible strategy to estimate eigenvalues and eigenstates of a given cost Hamiltonian, extending the reasoning of the methodology, is also pointed out. Typical results and relevant discussions are captured to support the propositions.
arXiv comment6 pages, 6 figures
References in corpus (8)
- A variational eigenvalue solver on a quantum processor
- A Quantum Approximate Optimization Algorithm
- Variational Quantum Computation of Excited States
- Grover Adaptive Search for Constrained Polynomial Binary Optimization
- Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
- Multi-phase matching in the Grover algorithm
- Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm
- Graph Cut Segmentation Methods Revisited with a Quantum Algorithm