Understand Noise on Universal Quantum Adder Circuit
Article Sidebar
Main Article Content
Abstract
Quantum Fourier Transform (QFT) is an essential algorithm for quantum computers. There are many uses of QFT in the application of quantum computing. In this work, we proposed a generalized adder circuit that was fundamental for QFT. We designed and ran the experiments with the proposed adder circuit on an IBM quantum computer facility. We observed that the number of qubits was one factor in the error rate. We found that our proposed two-qubits adder circuit running on the IBM quantum computer had an error rate of around 25%. The complexity of the adder circuit includes qubit connectivity, physical devices, and error from noise due to the environment. We demonstrated the constraints of the proposed adder circuit.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright Transfer Statement
The copyright of this article is transferred to Current Applied Science and Technology journal with effect if and when the article is accepted for publication. The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, electronic form (offline, online) or any other reproductions of similar nature.
The author warrants that this contribution is original and that he/she has full power to make this grant. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors.
Here is the link for download: Copyright transfer form.pdf
References
Grover, L.K., 1996. A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. Philadelphia, Pennsylvania, USA., May 22-24, 1996, pp. 212-219.
Shor, P.W., 1997.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), https://doi.org/10.1137/S0097539795293172.
Wikipedia, 2019. RSA (cryptosystem). [online] Available at: https://en.wikipedia.org/wiki/RSA_(cryptosystem).
Draper, T.G., 2000. Addition on a Quantum Computer. [online] Available at: https://arxiv.org/abs/quant-ph/0008033.
Vandersypen, L.M.K., Steffen, M., Breyta, G., Yannoni, C.S., Sherwood, S. and Chuang, I.L., 2001. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. Nature, 414(883-887), https://doi.org/10.1038/414883a.
Beauregard, S., 2003. Circuit for Shor's algorithm using 2n+3 qubits. Quantum Information and Computation, 3(2), 175-185.
Cross, A.W., Bishop, L.S., Smolin, J.A. and Gambetta, J.M., 2017. Open Quantum Assembly Language. [online] Available at: https://arxiv.org/abs/1707.03429.
Cross, A.W., Bishop, L.S., Sheldon, S., Nation, P.D. and Gambetta, J.M., 2019. Validating quantum computers using randomized model circuits, Physical Review A, 100(3), https://doi.org/10.1103/PhysRevA.100.032328.
Methachawalit, W. and Chongstitvatana P., 2020. Adder circuit on IBM universal quantum computers. Proceedings of The 17th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, Phuket, Thailand, June 24-27, 2020, pp. 92-95.
Nielsen, M.A. and Chuang, I.L., 2011. Quantum Computation and Quantum Information. Cambridge: Cambridge University Press.
Shor, P.W., 2003. Why haven’t more quantum algorithms been found? Journal of the ACM, 50(1), 87-90, https://doi.org/10.1145/602382.602408.
IBM Corporation, 2022. IBM Quantum. [online] Available at: https://quantum-computing.ibm.com.
Qiskit, 2022. Qiskit. [online] Available at: https://qiskit.org.
Qiskit, 2022. qiskit.providers.aer.noise.NoiseModel.from_backend — Qiskit 0.37.1 documentation. [online] Available at: https://qiskit.org/documentation/stubs/qiskit. providers.aer.noise.NoiseModel.from_backend.html#qiskit.providers.aer.noise.NoiseModel.from_backend.
IBM Research, 2021. The IBM Quantum Heavy Hex Lattice. [online] Available at : https://research.ibm.com/blog/heavy-hex-lattice.
Gambetta, J.M., Chow, J.M. and Steffen, M., 2017. Building logical qubits in a superconducting quantum computing system. NPJ Quantum Information, 3, https://doi.org/10.1038/s41534-016-0004-0.
Bronn, N.T., Abdo, B., Inoue, K., Lekuch, S., Córcoles, A.D., Hertzberg, J.B., Takita, M., Bishop, L.S., Gambetta, J.M. and Chow, J.M., 2017. Fast, high-fidelity readout of multiple qubits. Journal of Physics: Conference Series, 834, https://dx.doi.org/10.1088/1742-6596/834/1/012003.
Qiskit, 2022. IBM Quantum. [online] Available at: https://quantum-computing.ibm.com/services/resources?type=Falcon&system=ibmq_manila.
Qiskit, 2022. IBM Quantum. [online] Available at: https://quantum-computing.ibm.com/services/resources?system=ibmq_quito.
Qiskit, 2022. Transpiler (qiskit.transpiler) — Qiskit 0.37.1 documentation. [online] Available at: https://qiskit.org/documentation/apidoc/transpiler.html.