Fundamentals of Quantum Programming in Ibm's Quantum Computers

ISBN-13: 9783030635855 / Angielski / Miękka / 2021 / 356 str.

Weng-Long Chang; Athanasios V. Vasilakos

Spis treści

Introduction to Quantum Bits and Quantum Gates on IBM’s Quantum Computer.- Boolean Algebra and its Applications.- Quantum Search Algorithm and its Applications.- Quantum Fourier Transform and its Applications.- Order-Finding and Factoring.- Phase Estimationand its Applications.  

O autorze

Weng-Long Chang is currently a Professor in the Department of Computer Science and Information Engineering, National Kaohsiung University of Science and Technology, Jiangong Road, Sanmin District, Kaohsiung City, Taiwan, Republic of China. His research interests include quantum computing, molecular computing, quantum-molecular computing and languages and compilers for parallel computing.He has published more than seventy articles in the international conferences and the international journeys.

Athanasios V. Vasilakos is with the School of Electrical and Data Engineering, University Technology Sydney, Australia. He served or is serving as an Editor for many technical journals,such as the IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT; IEEE TRANSACTIONS ON CLOUD COMPUTING, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY,IEEE TRANSACTIONS ON CYBERNETICS; IEEE TRANSACTIONS ON NANOBIOSCIENCE; IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY INBIOMEDICINE; ACM Transactionson Autonomous and Adaptive Systems; the IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS .He is Web of Science 2017,2018 ,2019,2020 Highly Cited Researcher. He is also General Chair of the European Alliances for Innovation. 

Blurb

This textbook introduces major topics that include quantum bits, superposition, entanglement, logic gates, quantum search algorithm, quantum Fourier transform, inverse quantum Fourier transform, Shor’s order-finding algorithm and phase estimation. Everyone can write algorithms and programs in the cloud making using IBM’s quantum computers that support IBM Q Experience which contains the composer, open quantum assembly language, simulators and real quantum devices. Furthermore, this book teaches you how to use open quantum assembly language to write quantum programs for dealing with complex problems. Through numerous examples and exercises, readers will learn how to write a quantum program with open quantum assembly language for solving any problem from start to complete.   

This book includes six main chapters:  

·Quantum Bits and Quantum Gates—learn what quantum bits are, how to declare and measure them, what quantum gates are and how they work on a simulator or a real device in the cloud.   

·Boolean Algebra and its Applications—learn how to decompose CCNOT gate into six CNOT gates and nine gates of one bit and how to use NOT gates, CNOT gates and CCNOT gates to implement logic operations including NOT, OR, AND, NOR, NAND, Exclusive-OR (XOR) and Exclusive-NOR (XNOR).   

·Quantum Search Algorithm and its Applications—learn core concepts of quantum search algorithm and how to write quantum programs to implement core concepts of quantum search algorithm for solving two famous NP-complete problems that are the satisfiability problem in n Boolean variables and m clauses and the clique problem in a graph with n vertices and q edges.   

·Quantum Fourier Transform and its Applications—learn core concepts of quantum Fourier transform and inverse quantum Fourier transform and how to write quantum programs to implement them for solving two real applications that are to compute the period and the frequency of two given oracular functions.   

·Order-Finding and Factoring—learn core concepts of Shor’s order-finding algorithm and how to write quantum programs to implement Shor’s order-finding algorithm for completing the prime factorization to 15.   

Phase Estimation and its Applications—learn core concepts of phase estimation and quantum counting and how to write quantum programs to implement them to compute the number of solution(s) in the independent set problem in a graph with two vertices and one edge.