Trimming Grover's Quantum Search Algorithm

Grover’s quantum algorithm is a complicated search algorithm made to run on a quantum computer. The algorithm allows users to search a database for a word in a significantly shorter time than a conventional computer. Past experiments have attempted to run iterations of the algorithm on a quantum computer and failed because of the complexity. My research modifies and simplifies the theory of Grover’s algorithm by utilizing results from previous work that studied the diffusion of wave functions across a hypercube. I have directly applied this diffusion process to an edited and simplified version of Grover’s algorithm based on the premise of simplifying the connections and paths between q-bits represented on a hypercube. The algorithm I have created has been run and tested on the open-source quantum computer simulations provided by IBM on their IBM Q website. My results display a trimmed and practical version of Grover’s quantum search algorithm.