Slide 1

Slide 1 text

Introduction to Qiskit Shadab Hussain

Slide 2

Slide 2 text

Session Overview What is Quantum Computing Introduction to Qiskit Qiskit Elements IBM Quantum Composer IBM Quantum Lab Single Qubit Gates 01 02 03 04 05 06 Shor's Algorithm 07 https://quantumcomputingindia.com/

Slide 3

Slide 3 text

What is Quantum Computing? https://quantumcomputingindia.com/

Slide 4

Slide 4 text

“A quantum machine is a kind of analog calculator that computes by encoding information in the ephemeral waves that comprise light and matter at the nanoscale.” Microsoft researcher David Reilly https://quantumcomputingindia.com/

Slide 5

Slide 5 text

Use of quantum mechanical phenomena such as superposition and entanglement to perform computation https://quantumcomputingindia.com/

Slide 6

Slide 6 text

What is superposition? What is entanglement? https://quantumcomputingindia.com/

Slide 7

Slide 7 text

https://quantumcomputingindia.com/

Slide 8

Slide 8 text

https://quantumcomputingindia.com/

Slide 9

Slide 9 text

Superposition A combination of states we would ordinarily describe independently. Assume a cat and a sealed bottle of poison in a closed box together. The question now is, how would we know if the poison bottle broke open and the cat died or if the cat is still alive inside the box? https://quantumcomputingindia.com/

Slide 10

Slide 10 text

Entanglement Entanglement is a physical phenomenon that refers to the relation between two or more particles — or, to generalize it, qubits — that affect their properties such that we can not describe the state of one of them independently of the others. One of the most commonly used qubits is photon spins. A photon can either have spin up (one state) or spin down (zero states). If we have two entangled photons, then they must have opposite spins, if one is up then the other must be down. https://quantumcomputingindia.com/

Slide 11

Slide 11 text

From Bits to Qubits Classical Bit |0> |1> Quantum Bit (QuBit) https://quantumcomputingindia.com/

Slide 12

Slide 12 text

Qiskit Qiskit [quiss-kit] is an open-source SDK for working with quantum computers at the level of pulses, circuits, and application modules. Qiskit is made up of elements that work together to enable quantum computing. This is a simple meta-package to install the elements of Qiskit altogether. https://qiskit.org/ https://quantumcomputingindia.com/

Slide 13

Slide 13 text

Qiskit (Terra) SOLID FOUNDATION FOR QUANTUM COMPUTING Qiskit Experiments (Ignis) UNDERSTANDING & MITIGATING NOISE IN QUANTUM SYSTEMS Qiskit Application (Aqua) ALGORITHMS FOR QUANTUM COMPUTING APPLICATIONS Qiskit Simulator (Aer) HIGH-PERFORMANCE SIMULATOR FRAMEWORK FOR QUANTUM CIRCUITS Qiskit Elements The four elements of Qiskit are the essential parts that give Qiskit its power https://quantumcomputingindia.com/

Slide 14

Slide 14 text

Qiskit Stack https://quantumcomputingindia.com/

Slide 15

Slide 15 text

Qiskit Terra 4 5 Q I S K I T . P U L S E Q I S K I T . C I R C U I T Q I S K I T . T R A N S P I L E R 1 2 3 Q I S K I T . P R O V I D E R S Q I S K I T . Q U A N T U M _ I N F O Q I S K I T . V I S U A L I Z A T I O N 6 Modules quantum programs at the level of circuits and pulses optimize program for the constraints of a particular device manage execution of batches of experiments on remote-access devices https://quantumcomputingindia.com/

Slide 16

Slide 16 text

Qiskit AER 4 5 S T A T E V E C T O R S I M U L A T O R Q A S M S I M U L A T O R 1 2 P U L S E S S I M U L A T O R U N I T A R Y S I M U L A T O R Simulators verify current and near-future quantum computers function correctly high performance simulator framework for quantum circuits tools for constructing highly configurable noise models https://quantumcomputingindia.com/

Slide 17

Slide 17 text

Qiskit Ignis 1 2 F I L T E R S C I R C U I T S F I T T E R S 1 2 3 Q I S K I T . I G N I S . C H A R A C T E R I Z A T I O N Q I S K I T . I G N I S . V E R I F I C A T I O N Q I S K I T . I G N I S . M I T I G A T I O N 3 Building Blocks dedicated to fight noise and errors design quantum error correction codes Experiments https://quantumcomputingindia.com/

Slide 18

Slide 18 text

Qiskit Aqua used to build applications for quantum computing accessible to domain experts in chemistry, finance, AI https://quantumcomputingindia.com/

Slide 19

Slide 19 text

https://quantumcomputingindia.com/

Slide 20

Slide 20 text

IBM Quantum Composer and Lab https://quantumcomputingindia.com/

Slide 21

Slide 21 text

Quantum Gates Programing quantum computers is now done on a gate level, similar to classical gates. https://quantumcomputingindia.com/

Slide 22

Slide 22 text

The Identity gate (has a symbol I) is a single qubit gate that leaves the state of the qubit unchanged. I D E N T I T Y G A T E https://quantumcomputingindia.com/

Slide 23

Slide 23 text

The NOT gate takes a qubits and flips its state N O T G A T E https://quantumcomputingindia.com/

Slide 24

Slide 24 text

The Hadamard gate (H) is the magic gate. It is the gate responsible for creating the superposition of states. This gate puts the qubit in 50/50 superposition of states |0⟩ and |1⟩ despite whether the input state was |0⟩ or|1⟩. H A D A M A R D G A T E https://quantumcomputingindia.com/

Slide 25

Slide 25 text

The C-NOT is a 2-qubit gate that uses one qubit to control the state of the other. C O N T R O L L E D - N O T G A T E https://quantumcomputingindia.com/

Slide 26

Slide 26 text

Shor's Algorithm Shor’s Algorithm is a quantum algorithm for integer factorisation. Given an odd integer N it will find it’s prime factors. https://quantumcomputingindia.com/

Slide 27

Slide 27 text

Classical part which reduces the factorisation to a problem of finding the period of the function. This is done classically using a normal computer. Quantum part which uses a quantum computer to find the period using the Quantum Fourier Transform. The algorithm consists of 2 parts: 1. 2. https://quantumcomputingindia.com/

Slide 28

Slide 28 text

Pick a random number A such that A < N Computer the greatest common divisor (GCD) of and N if the gcd != 1 then we found a factor of N If not then run the quantum circuit that uses a Quantum Fourier Transform If the period is odd then go back to step 1 Otherwise we have found the factors of N For the algorithm the steps are as follows: 1. 2. 3. 4. 5. 6. https://quantumcomputingindia.com/

Slide 29

Slide 29 text

Contact +91-983-926-1116 [email protected] https://www.linkedin.com/in/shadabhussain96/ https://quantumcomputingindia.com/