Quantum Software with an application to position based cryptography

Abstract

Quantum computers hold great promise as the next generation hardware. They are based on counter-intuitive phenomena from quantum mechanics, like superposition, interference, and entanglement. The basic building block of a quantum computer is a quantum bit or qubit, which unlike a classical bit can be in a quantum superposition (a simultaneous combination) of both 0 and 1. In the 1990s it was demonstrated that, for specific problems, quantum algorithms run on a quantum computer can massively outperform classical computers. The famous quantum algorithm of Peter Shor shows that a quantum computer can factor large numbers and thus breaks most of modern-day cryptography.

Recent years have witnessed important breakthroughs in the development of the hardware for a quantum computer. IBM announced a 50 qubit machine and google recently advertised with a 72 qubit device.  With this growth rate we will have 100 -200 qubits within five years and large scale quantum computers are expected within 5-10 years. What can we compute on a quantum computer and how can it be useful? In this talk I will give a short introduction to quantum computing and quantum software and will highlight an application to position based cryptography.