Expected Optimal Time for the NMR Implementation of Shor's Algorithm for Factorising 15
Abstract
In this paper, we briefly discuss the methodology for simulating a quantum computer which performs 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 calculate 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 s to perform our simulated computation, whereas the expected optimal time under the same energy conditions is 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.
Cite
@article{arxiv.1809.09535,
title = {Expected Optimal Time for the NMR Implementation of Shor's Algorithm for Factorising 15},
author = {Vlad Cărare and Alejandro Cros Carrillo de Albornoz and John Taylor},
journal= {arXiv preprint arXiv:1809.09535},
year = {2019}
}
Comments
6 pages, 2 figures, written as part of a third year group project. [v2] Updated to a more accurate title. [v3] Updated to a more precise abstract, added an acknowledgement, updated second figure for gray-scale print