A “Supremely” light Introduction to Quantum Computing - Pydata 2019

Transcript

1. MercadoLibre 2019 A “Supremely” light Introduction to Quantum Computing Rodolfo Bonnin
2. The need for a new kind of computing
3. Cerebras’ Chip Moore’s law: Overall processing power for computers will double every two years Single atom transistor
4. Quantum phenomena and how it can be used for computing. • Classical computing is based on transistors • The limit is uni atoms transistors, where quantum effects take a great role (Tunnel effect) • Quantum effects have to be taken in account, lets use these properties to our own good!
5. 1981: A new paradigm appears
6. Richard Feynman, 1981(First Conference on the Physics of Computation) • Quantum computers would use quantum physics to emulate the physical world. • We could solve problems that classical computers would never have the power to tackle.
7. Quantum Mechanics 101
8. “If you think you understand quantum mechanics, you don't understand quantum mechanics” Feymann? Bohr? Other?
9. Main Quantum phenomena
10. 1. Superposition
11. 2. Measurement 1. Measurements destroy the quantum state in most cases. 2. Energy enters and leaves the system.
12. 3. Entanglement
13. From Quantum Mechanics to Quantum Information
14. What is a Qubit • Can be seen as a Quantum Mechanical System, which • Under certain circunstances, can be considered as having only 2 quantum levels. • It is used to store quantum information • You can superpose the states, and entangle them (Exponentially large set of states.) Presenting: The Qubit
15. Bit to Qbit A Qbit is not any element or device, its a logical concept, that can be implemented in a wide range of systems with quantum behaviour
16. Bit to Qbit Classical bits store exclusive states of 0 or 1. Superposition implies 2 states at the same time, with an associated probability. This is how we represente it: In linear algebra, we always have a couple of basis vector generating all the vector space. We can directly map from bits to certain Qbits: But this two “Pure” states are mixed, wich can also be represented as a linear combination Again: Superposition == Linear combination! They are and behave like classical bits! |α|²: probability of |0> |b|²: probability of |1>
17. From Maths to Geometry: Bloch’s Sphere |α|²: probability of |0> |b|²: probability of |1> But! there is a logical constraint for probabilities SURPRISE! ALPHA AND BETA ARE COMPLEX! So, they can be represented parametrically as: Which defines, with all this constraints, a point in a 3d Sphere, the Bloch sphere
18. BraKet notation Column Basis vector Row Basis Vector Bra-Ket, or inner product of both Whats with the | > Symbols? • Basis vector generate a Vector space (Linear Algebra) • Our vectors, generate an special space, called Hilbert Space. • In Hilbert spaces, basis vectors are represented with the | > notation, and called kets. • And the complementary vectors, use the sign < |, and are called Bra. • When you combine both, applying the inner product, you get a Bra-Ket, which is the real generator of this field. |p| of c2 collapses into c1
19. Bloch sphere The Bloch sphere • We represent the state as angles, we know the elements are unit vectors • Poles represent the classical bits • Qubits cover the whole sphere. • Classical Bits: North/south. Superposition: Equator • When the qubit is measured, it collapses to one of the two poles. • If the arrow is closer to the north pole, there is larger probability to collapse to that pole; similarly for the south pole.
20. Historical development of Quantum Possible Qubit states at the same time = 2^n Possible Bit states at measure time=2*n (1 and 0 are mutually exclusive)
21. Historical development of Quantum 1981 Benioff/ Feynmann 1994 Schor’s Algorithm 1998 First 2 Qbits computer 2005 First Quantum byte 2017 First 16-Qbit computer 2019 53 Qbit computer Quantum Supremacy https://www.cbinsights.com/research/report/quantum-computing/
22. Types of qbits
23. Quantum Circuits And Programs
24. The life of a qubit. Initialize qubits to their lowest energy state (|0>) Apply gates to those qubits, moving around the sphere. Measure 2 1 3
25. Quantum Circuits
26. Quantum gate types
27. • Quantum Gates: H gate Hadamard Gate (H): Goes from the classical space, to the superposition state, and back, if applied again. H
28. Quantum Gates: Pauli X, Y and Z gates Pauli X gate: like bit flip, turns 180 degrees the vector, for example from 0 to 1 state. Also Y and Z versions. X Pauli X Pauli Y Pauli Z
29. Quantum Gates: CNOT gate CNOT GATE: Conditional rotations, based on the state of a QBit
30. Quantum Gates: Toffoli Gate (CCNOT) It has 3-bit inputs and outputs; if the first two bits are both set to 1, it inverts the third bit, otherwise all bits stay the same.
31. Hands on Quantum Computing in Python
32. Practical Quantum platforms: Amazon Braket A Fully managed service A Development environment to • Explore and design quantum algorithms, • Test them on simulated quantum computers,and • Run them on your choice of different quantum hardware technologies. Providers:
33. Practical Quantum platforms IBM Quantum experience Rigetti Quantum Cloud Services Real quantum computers, from 2 to 5 qbits, including classic simulators. • Quantum composer: • Jupyter instances with Quiskit Quantum Machine Image/QPU Lattices A (QPUTM), also referred to as a quantum chip, is a physical chip that contains connected sets of qubits, known as lattices.
34. Future Cloud quantum platforms Google DWave Leap Azure Quantum Wrapper for • Honeywell’s quantum computer (Trapped-ion) • IonQ (Trapped-ion) • QCI
35. Quantum Computing Frameworks
36. IBM qiskit Terra: Common infrastructure for communicating with Quantum devices and simulators Aqua: Application bridge between classical computers and Quantum devices (Chemistry, IA, optimization). Ignis: noise controlling and quantum error correction utilities Aer: Quantum simulations utilities Rigetti / Forest SDK Rigetti is also building quantum computers, having reached a peak of 16 qbits. It offers a range of quantum computers, ranging from 2 to 13 qbits. Computers can be programmed using Rigetti’s own framework, Forest. It is based on pyquil, a library for quantum programming using Quil, the quantum instruction language developed at Rigetti.
37. Dwave Leap Azure Q#/Quantum development kit
38. Special Mentions: Xanadu (Pennylane & Strawberry fields)
39. A couple of “Hello World” samples
40. • 2 bits Adder Just 1 bit is 1: flip the first output 2 simultaneous 1: double flip first bit to 0, and Toffolo gate activates to 1
41. • Qubit Entangler 1. We will add the Hadamard gate (H) with 1 qubit for adding superposition property. H gate has the property to maps X→Z, and Z→X. 2. We add Controlled-NOT gate (CX) , a two-qubit gate that flips the target qubit if the control is in state 1. This gate is required to generate entanglement.
42. Machine Learning/ Applications / Our work at Meli
43. Quantum Machine Learning map https://github.com/krishnakumarsekar/awesome-quantum-machine-learning
44. Q-Nearest Neigbors IBM Q Best Paper Award
45. Q-Nearest Neigbors Shipping date estimation
46. Title
47. Title Dimension > 70 cms? (2.29659 ft) Non machineable items classification
48. The Future
49. Future trends • More Qubits! • Less Noise! • Huge adoption thanks to Cloud offerings • More practical examples of Supremacy • Topological Quantum computers?
50. Questions?
51. Thank you!