Tutorials

This year, the SAMOS conference is hosting two tutorials, given by leading experts in various fields.

◊◊ ◊◊ ◊◊

Tutorial on Quantum Computing

Tutorial Organizer: Carmen G. Almudéver (Delft University of Technology)

Abstract: Quantum computers hold the promise for solving efficiently important problems in computational sciences that are intractable nowadays by exploiting quantum phenomena such are superposition and entanglement. 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.

This extraordinary property of quantum computers together with the great evolution of the quantum technology in the last past years has made that large companies as Google, Lockheed Martin, Microsoft, IBM and Intel are substantially investing in quantum computing.

Up to now, quantum computing has been a field mostly dominated by physicists. They are working on the design and fabrication of the basic units of any quantum system, called quantum bits or qubits. However, building a quantum computer involves more than producing ‘good’ qubits. It requires the development on an entire quantum computer architecture.

This tutorial will introduce the basic notions of quantum computing; going from quantum bits, superposition and entanglement, to quantum gates and circuits, up to quantum algorithms. The tutorial will provide hands-on exercises based on our QX simulator platform (http://quantum-studio.net), allowing the participants to implement some simple quantum circuits/algorithms. We will also address the main challenges when building a large-scale quantum computer.

The objective of this tutorial is to introduce the basics of quantum computing and show where the scientific challenges are.

◊◊ ◊◊ ◊◊

Tutorial on Memory Systems

Tutorial Organizer: Onur MutluETH Zurich

Abstract: TBA

◊◊ ◊◊ ◊◊