Pith. sign in

REVIEW

Approximate Phase Search and Eigen Estimation using Modified Grover's Algorithm

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.11497 v1 pith:34DRVMDG submitted 2020-12-18 quant-ph

Sayantan Pramanik , M Girish Chandra , Shampa Sarkar , Manoj Nambiar This is my paper · ORCID
classification quant-ph
keywords algorithmcostgroverancillaapartapproximateapproximatingattempt
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools