Optimizing the damped quantum search algorithm
Abstract
An optimization of the damped quantum search is introduced by calculating the damping parameter that gives the minimum probability of failure per iteration. The resulting damping parameter is compared with the critical damping. The result shows that the optimized damping is generally not equal to the critical damping if the degeneracy of the target state is not comparable to the size of the database. The probability of failure for the optimized damping and critical damping does not differ significantly for the first two iterations. This difference is relatively large for the third iteration. This suggests that for greater number of iterations, the critically damped search is not optimized.
Downloads
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.
