The effect of the Hadamard gate decomposition in the simulation of Grover’s algorithm
Abstract
Simulation of Grover’s algorithm in an Ising nuclear spin chain computer with first- and second-nearest neighbor interaction is considered. The most frequently used quantum gate in the algorithm is the Hadamard gate. We investigate the effect of its decomposition into several rotation matrices and numerically calculate the fidelity and probability of success of finding the target state. Using an appropriate decomposition, we obtain a high fidelity for different numbers of iterations. The probability of finding the target state also increased and is much closer to the ideal result.
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.
