Abstract
All computer calculations are currently performed on computers constrained by the laws of Newtonian physics, also known as classical physics. However, as Richard Feynman suggested in the 1980s, a quantum computer could take advantage of the superposition and entanglement phenomena of quantum physics to speed up calculations. As prototypes of quantum computers, still very limited in scope, are gradually emerging, start-ups, major digital companies and even governments are gradually orienting their research, strategy and funding so as to be ready to exploit the potential of this future computer.
Starting with the first quantum paradoxes, the opening lecture and the lecture delivered as part of this Chair will present the foundations of quantum cryptography and communication. This will be followed by an introduction to the concepts of quantum computation via circuits, which will enable us to present the main quantum algorithmic methods: the demonstration of algebraic properties enabling secret messages to be deciphered, and optimization opening the way to a vast field of algorithmic applications. We then turn to the limits of quantum computation, both theoretical and technological. Finally, we'll describe some of the current research into the short-term use of limited quantum computer prototypes, with potential applications in artificial intelligence and decentralized Internet applications.
