The Comparison of the computing ability of quantum and conventional computer

Abstract

Contemporarily, whether quantum computing performs better than conventional computers remain an unresolved issue. In this paper, we compare the time complexity between quantum and conventional computers for a specific type of issue. Theoretically, quantum computation is better in solving nonlinear calculations, the quantitative evaluation of the computing ability should be investigated. In this paper, the Fourier transform was applied in both classical and quantum logical circuits to calculate the theoretical time complexities respectively and make a comparison after that. According to the analysis, the ideal quantum computer performed really fast as the number of tasks increased, but the gate-level accurate quantum circuit, which was a simulated circuit was running slower. The paper shows that the current technology cannot perform the perfect quantum computer, but the future of it would be very promising. Overall, these results shed light on guiding further exploration of quantum computing.