Approximate Phase Search and Eigen Estimation using Modified Grover's Algorithm
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:34DRVMDGrecord.jsonopen to challenge →
classification
quant-ph
keywords
algorithmcostgroverancillaapartapproximateapproximatingattempt
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.