This presentation is about how to program quantum computers.
Why is quantum computing more powerful than classical computing? The reason is that a quantum computer enables a massive state space by using a few qubits instead of many bits (0s and 1s). Qubits are better than bits because they can do exponentially more work. Indeed, a few hundred qubits may be sufficient for quantum computers to outperform all current classical computers. Quantum computers with 72 cubits exist today and people expect that larger quantum computers will achieve a quantum advantage soon.
Do we have algorithms for quantum computers? Yes, we do! From the 1990s we have algorithms such as Shor’s algorithm, Grover’s algorithm, and Simon’s algorithm. Today we have algorithms for chemistry, machine learning, and optimization, and future quantum algorithms may break cryptography.
How do we run quantum algorithms on quantum computers? Attend this presentation and learn how. I will discuss the foundations, algorithms, and languages of quantum computing, and I will show how to run quantum programs on real and simulated quantum computers.
Wed 23 Oct Times are displayed in time zone: Beirut change
|14:00 - 14:45|
Jens PalsbergUniversity of California, Los Angeles
|14:45 - 15:30|
Phillip Stanley-MarbellUniversity of Cambridge