European Numerical Mathematics and
Advanced Applications Conference 2019
30th sep - 4th okt 2019, Egmond aan Zee, The Netherlands
10:30   MS5: Numerical Mathematics on Quantum Computers (Part 1)
Chair: Matthias Möller
10:30
25 mins
Tutorial on Quantum Computing
Carmen G. Almudever
Abstract: Quantum computing is a very active and promising topic. Since the physicist Richard Feynman proposed the idea of building a quantum computer to simulate quantum systems in the early 80’s, different quantum algorithms have been developed. By exploiting quantum phenomena (superposition and entanglement), they promise to solve complex problems that are intractable for even the most powerful current supercomputers. One of the most famous examples is the factorization of large numbers using Shor’s algorithm. For instance, a 2000-bit number could be decomposed in a bit more than one day using a quantum computer whereas a data center of approx. 400.000 km2 built with the fastest today’s supercomputer would require around 100 years. Great progress has been made in recent years in quantum hardware based on different technologies such are superconducting qubits, ion traps, silicon quantum dots, topological qubits and Nitrogen Vacancy (NV) centers. Although quantum technologies still need to mature to get better coherence times and gate fidelities, quantum computation in the cloud is already a reality with small quantum processors that are capable of handling basic programs. Large companies (Google, Intel, Microsoft, IBM, Alibaba) and research groups are working on building the first universal quantum computer, which requires contributions from several disciplines including physics, mathematics, computer science, informatics and electrical engineering, among others. This tutorial will introduce the basic notions of quantum computing; going from quantum bits, superposition and entanglement, to quantum gates and circuits. The tutorial will also provide some hands-on exercises.
10:55
25 mins
Tutorial on Quantum Computing
Carmen G. Almudever
Abstract: Quantum computing is a very active and promising topic. Since the physicist Richard Feynman proposed the idea of building a quantum computer to simulate quantum systems in the early 80’s, different quantum algorithms have been developed. By exploiting quantum phenomena (superposition and entanglement), they promise to solve complex problems that are intractable for even the most powerful current supercomputers. One of the most famous examples is the factorization of large numbers using Shor’s algorithm. For instance, a 2000-bit number could be decomposed in a bit more than one day using a quantum computer whereas a data center of approx. 400.000 km2 built with the fastest today’s supercomputer would require around 100 years. Great progress has been made in recent years in quantum hardware based on different technologies such are superconducting qubits, ion traps, silicon quantum dots, topological qubits and Nitrogen Vacancy (NV) centers. Although quantum technologies still need to mature to get better coherence times and gate fidelities, quantum computation in the cloud is already a reality with small quantum processors that are capable of handling basic programs. Large companies (Google, Intel, Microsoft, IBM, Alibaba) and research groups are working on building the first universal quantum computer, which requires contributions from several disciplines including physics, mathematics, computer science, informatics and electrical engineering, among others. This tutorial will introduce the basic notions of quantum computing; going from quantum bits, superposition and entanglement, to quantum gates and circuits. The tutorial will also provide some hands-on exercises.
11:20
25 mins
Numerical linear algebra on a quantum computer
Yudong Cao Cao
Abstract: Quantum computers solve problems in ways that are not possible with classical computers. In particular, in the past decade, several methods have been developed for using quantum computers to solve numerical linear algebra problems such as eigenvalue problems, linear systems, linear regression, and differential equations. The goal of this talk is to present some of the representative results in this field, as well as some more recent development, with emphasis on the promises and caveats associated with each of the algorithms.
11:45
25 mins
Quantum Computation for Quantum Chemistry
Sabre Kais
Abstract: I will give a brief overview of the recent advances in quantum information and computation for chemistry. Then present the challenging problems in quantum computing for complex chemical systems focusing on electronic structure calculations and open quantum dynamics. I will present three related approaches to electronic structure calculations: The quantum circuit model, the adiabatic quantum computing model and the quantum machine learning approach. Then I will present our recent developed quantum algorithm for evolving open quantum dynamics on quantum computing devices. Finally, I will discuss the opportunities, open questions and challenges in the field of quantum computing for quantum chemistry.