Expected Optimal Time for the NMR Implementation of Shor's Algorithm for Factorising 15
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
In this paper, we briefly discuss the methodology for simulating a quantum computer which per-forms Shor’s algorithm on a 7-qubit system to factorise 15. Using this simulation and the overlooked quantum brachistochrone method, we devised a Monte Carlo algorithm to estimate the expected time a theoretical quantum computer could perform this calculation under the same energy conditions as current working quantum computers. We found that, experimentally, a nuclear magnetic resonance quantum computer would take 1 . 59 ± 0 . 04s to perform our simulated computation, whereas the expected optimal time under the same energy conditions is 0 . 955 ± 0 . 004 ms. Moreover, we found that the expected time is inversely proportional to the energy variance of our qubit states (as expected). Finally, we propose this theoretical method for analysing the time-efficiency of future quantum computing experiments.