Abstract
Today from the viewpoint of computing characteristic, “Computer Science” in fact consists of traditional digital computers (A. Turing: On computable numbers, with an application to the entscheidungsproblem. The proceedings of the London Mathematical Society, Ser. 2, Vol. 42 (19367), pp. 230265; corrections, Ibid, Vol. 43 (1937), 544546.; J. von Neumann: Probabilistic logics and the synthesis of reliable organisms from unreliable components. Princeton University Press, 1956, 329378.), bio-molecular computers (Adleman, .Science 226:10211024, 1994) and quantum computers (D. Deutsch: Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. The proceedings of Royal Society London A (1985), 400497.).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aaronson, S., Chen, L.: Complexity-theoretic foundations of quantum supremacy experiments. In: The 32nd Computational Complexity Conference, vol. 79, pp. 22:1–22:67 (2017)
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 226, 10211024 (1994)
Coles, P.J., Eidenbenz, S., Pakin, S., Adedoyin, A., Ambrosiano, J., Anisimov, P., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H., Gunter, D., Karra, S., Lemons, N., Lin, S., Lokhov, A., Malyzhenkov, A.,Mascarenas, D., Mniszewski, S., Nadiga, B., O'Malley, D., Oyen, D., Prasad, L., Roberts, R., Romero, P., Santhi, N., Sinitsyn, N., Swart, P., Vuffray, M., Wendelberger, J., Yoon, B., Zamora, R., Zhu, W.: Quantum algorithm implementations for beginners. https://arxiv.org/abs/1804.03719 (2018)
Cross, A.W., Bishop, L.S., Smolin, J. A., Gambetta, J.M.: Open quantum assembly language. https://arxiv.org/abs/1707.03429 (2017).
Deutsch, D.: Quantum theory, the Church-turing principle and the universal quantum computer. In: The Proceedings of Royal Society London A (1985), pp. 400497.
Imre, S., Balazs, F.: Quantum Computation and Communications: An Engineering Approach. Wiley, UK (2007). ISBN-10: 047086902X and ISBN-13: 978-0470869024, 2005.
Lipton, R.J., Regan, K.W.: Quantum Algorithms via Linear Algebra: a Primer. The MIT Press (2014). ISBN 978-0-262-02839-4.
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, New York, NY (2000). ISBN-10: 9781107002173 and ISBN-13: 978-1107002173.
Silva, V.: Practical Quantum Computing for Developers: Programming Quantum Rigs in the Cloud using Python, Quantum Assembly Language and IBM Q Experience. Apress, December 13, 2018, ISBN-10: 1484242173 and ISBN-13: 978-1484242179.
The IBM Quantum Experience. https://www.research.ibm.com/quantum/, accessed November 2016.
Turing, A.: On computable numbers, with an application to the entscheidungsproblem. In: The Proceedings of the London Mathematical Society, Ser. 2, vol. 42 (19367), pp. 230265; corrections, Ibid, vol. 43, pp. 544546 (1937)
von Neumann, J.: Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components, pp. 329378. Princeton University Press (1956)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Chang, WL., Vasilakos, A.V. (2021). Introduction to Quantum Bits and Quantum Gates on IBM’s Quantum Computer. In: Fundamentals of Quantum Programming in IBM's Quantum Computers. Studies in Big Data, vol 81. Springer, Cham. https://doi.org/10.1007/978-3-030-63583-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-63583-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63582-4
Online ISBN: 978-3-030-63583-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)