Quantum Computing: Random Number Generator & Quantum Safe Digital Certification
Details
Introduce the topic in about two hours. By Bhairav Mehta, Principal Manager at Microsoft in Azure Core Operating System and Security
Agenda
6:45 Zoom Networking stars Click the link below to preregister:
https://www.aicamp.ai/event/eventdetails/W2021091519
7:00 Presentation, Streaming to SFBayACM YouTube Channel:
https://youtu.be/oF2AqagQz4Y
Abstract
In recent years, there has been a substantial amount of research on quantum computers – machines that exploit quantum mechanical phenomena to solve mathematical problems that are difficult or intractable for conventional computers. If large-scale quantum computers are ever built, they will be able to break many of the public-key cryptosystems currently in use. This would seriously compromise the confidentiality and integrity of digital communications on the Internet and elsewhere. The goal of post-quantum cryptography (also called quantum-resistant cryptography) is to develop cryptographic systems that are secure against both quantum and classical computers, and can interoperate with existing communications protocols and networks.
Event description
Quantum computing promises unprecedented possibilities for important computing tasks such as quantum simulations in chemistry and materials science or optimization and machine learning. The development of novel and efficient methods and algorithms that explicitly take advantage of such emerging disruptive computing architectures is a huge challenge and opportunity.
Quantum algorithms for gate-based quantum computers and quantum annealers are different. On a gate-based quantum computer, a quantum algorithm consists of a sequence of quantum circuit operations (gates) that are performed on the qubits. In case of quantum annealing, a quantum algorithm is the continuous time (natural) evolution of a system of qubits to find the lowest-energy state of a system representing an optimization problem.
Quantum computing is increasingly attracting interest from industry and scientific groups that use high-performance computing for their applications. These pilot users of quantum computing are primarily interested in testing whether available quantum computing technologies are suitable today or in the foreseeable future for solving problems relevant to them. An important question to be answered is, which of these problems can be formulated such that a quantum or a hybrid quantum-classical algorithm can be developed to solve them.
Topics we will cover in the talk about 2 hours.
Introduction:
What is quantum computing?
What use is quantum computing?
Overview of Quantum Systems
Dirac notation & wave functions
Two level systems
Classical Computation
Turing machine mode
Circuit model
Quantum Computation
Qubits
Circuit model of quantum computation
Deutsch's algorithm,
Shor's algorithm
Grover Algorithm
Quantum Fourier Transform
Quantum Random Number Generator
How to Break Encryption using Quantum Computing Shor Algorithm Factorization
Quantum Safe Digital Certificate
Quantum Encryption
Physical implementation
Summary
Speaker Bio
Bhairav Mehta is Principal Data Scientist Manager and Technical Program Manager with 18 years experience in Analytics, Data Science, AI/ML, Big-Data and Program/Product management at Fortune 10 companies (Microsoft, Apple, Qualcomm, Ford) and startups (MIT Startup) in various industry verticals. Focused, highly dependable and detail-oriented solutions architect offering exceptional problem solving, troubleshooting skills and a talent for developing innovative solutions to unusual and difficult problems.
Bhairav leads team of Senior Data Scientists at Microsoft Azure Edge and Platform Enterprise Security team. He works on Edge IoT Telemetry, Core Operating Systems and Edge Security solutions development. Some of the key projects he is leading currently are AI Security, Robustness and Defense, Post Quantum Digital Certification and Edge Operating systems security.
