REVIEW 1 cited by
Improving D2p Grover's algorithm to reach performance upper bound under phase noise
Not yet reviewed by Pith; the record is open.
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
Improving D2p Grover's algorithm to reach performance upper bound under phase noise
read the original abstract
The original Grover's algorithm has a success probability to output a correct solution, while deterministic Grover's algorithms improve the success probability to 100%. However, the success probability of deterministic Grover's algorithm decreases in noisy environment. Here we improve the deterministic two-parameter (D2p) Grover's algorithm to reach the upper bound for success probability under phase noise. We prove that it is not possible to design any deterministic Grover's algorithm whose success probability is higher than our improved D2p protocol's under phase noise.
Forward citations
Cited by 1 Pith paper
-
Bridging the Information Gap: Semantic Densification and Hindsight Distillation for Cold-Start Prediction
SemRaD improves cold-start LTV and CVR prediction by encoding LLM-written semantic profiles with a learned gate and distilling a hindsight-reconciled future target through per-user distillation experts, confirmed by a...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.