Improving D2p Grover's algorithm to reach performance upper bound under phase noise

Leng，Jian1; Yang，Fan1; Wang，Xiang Bin1,2,3,4,5

2023-04-01

10.1103/PhysRevResearch.5.023202

Physical Review Research   Impact Factor & Quartile

2643-1564

2643-1564

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.

ESCI

English

Others

National Natural Science Foundation of China["11974204","12174215"]

Physics

Physics, Multidisciplinary

WOS:001049156100002

AMER PHYSICAL SOC

2-s2.0-85164239959

Scopus

1.State Key Laboratory of Low Dimensional Quantum Physics,Department of Physics,Tsinghua University,Beijing,100084,China
2.Jinan Institute of Quantum Technology,SAICT,Jinan,250101,China
3.Shanghai Branch,CAS Center for Excellence,Synergetic Innovation Center in Quantum Information and Quantum Physics,University of Science and Technology of China,Shanghai,201315,China
4.Shenzhen Institute for Quantum Science and Engineering,Physics Department,Southern University of Science and Technology,Shenzhen,518055,China
5.Frontier Science Center for Quantum Information,Beijing,100193,China

Leng，Jian,Yang，Fan,Wang，Xiang Bin. Improving D2p Grover's algorithm to reach performance upper bound under phase noise[J]. Physical Review Research,2023,5(2).

Leng，Jian,Yang，Fan,&Wang，Xiang Bin.(2023).Improving D2p Grover's algorithm to reach performance upper bound under phase noise.Physical Review Research,5(2).

Leng，Jian,et al."Improving D2p Grover's algorithm to reach performance upper bound under phase noise".Physical Review Research 5.2(2023).