A Comparative Analysis of the Results Obtained Using a Two-Qubit Quantum Computer and Quirk
ORAL
Abstract
Quantum algorithms utilize qubits for information processing. By applying the principles of superposition, entanglement, and parallelism, algorithms can outperform classical approaches in addressing specific problems. Implementing these algorithms in small-scale quantum computers provides insight into the theoretical fundamentals of algorithms and their limitations in quantum computations. In this work, we compare the performance of a two-qubit quantum computer, based on nuclear magnetic resonance, to the Quirk quantum circuit simulator. In particular, we implement and analyze the Deutsch, Bernstein-Vazirani, and Grover algorithms. After running the same algorithms on both systems, the deviations between the hardware and the simulated results are examined, analyzing sources of error in terms such as gate error and decoherence. Preliminary findings indicate the two-qubit quantum computer exhibits deviations consistent with noise. This project aims to evaluate the performance of small-scale quantum computers and provide a quantitative comparison between simulated and hardware-based computations.
–
Presenters
-
Amanda Flores
- Vassar College