Quantum Computing Projects
.PNG)
Paper: Error Analysis of 3-qubit Standard and Modified Grover’s Algorithms through Noisy Channels
Unpublished manuscript, completed in summer 2021.
Abstract: Grover's algorithm, a quantum alternative to classical search algorithms, provides a quadratic speedup to time complexity, running in \( O\sqrt{N} \) compared to the classical alternative's \( O(N) \). This quadratic speed up allows for computational advantages on the same hardware. We start by introducing the math underpinning Grover's algorithm and the quantum circuit necessary to obtain a 110 state with highest probability. Our implementations of Grover's algorithm utilize a single MCT gate along with the "compute-copy-uncompute" method (chained Toffolis with an AND gate). Both scenarios are tested on quantum hardware (\(ibmq\_lima \)) along with substantial simulated noisy results (each trial using one million shots on the (\(qasm\_simulator \)). A set of noisy results results are compared with a t-test to check which technique is more effective along with confirming whether the two techniques are statistically distinct.