An improved phase error tolerance in Quantum search algorithm
Jin-Yuan Hsieh, Che-Ming Li, Der-San Chuu
Abstract
As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a given degree of maximum success, we have derive the generalized and imroved criterion for tolerated error and corresponding size of quantum database under the inevitable gate imperfections. The vanished inaccurancy to this condition has also been shown. Besides, a concise formula for evaluating minimum number of iterations is also presented in this work.
Create a lesson
Related papers
Gaussian entanglement and quantum communication: geodesic optimization and multimode bounds
Hemant K. Mishra, Mark M. Wilde
On the coincidence of discrete and continuous definitions of Entanglement of Formation
Haobo Ma, Maksim E. Shirokov, Wenlin Zhang
EFI1PRS
Rishabh Batra
Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization
Farzin Salek, Masahito Hayashi
Deterministic and programmable generation of mechanical multipartite entangled states
Isabelle Franzen, Max-Emanuel Kern, Q. Rumman Rahman et al.
Quantum-enhanced mechanical sensing with machine-learning estimation
Finn Müßigbrodt, Andraž Omahen, Q. Rumman Rahman et al.