Quantum computing, a new computational paradigm

Where classical physics describes objects through their position and velocity, quantum mechanics describes them through wave functions, capturing not certainties but probabilities of presence.

In 1981, Richard Feynman, Nobel Prize in Physics, introduced a new computing paradigm built on the properties of quantum mechanics: superposition and entanglement*. A decade later, Shor’s algorithm and Grover’s algorithm demonstrated that quantum computers could tackle problems that would take classical computers an unrealistic amount of time to solve.

More recently, the first quantum computers have been built, steadily accelerating progress in the field. Today, companies like IBM, Google and Pasqal are deeply involved in the path toward commercialisation, bringing a key question into the spotlight: how soon will quantum computing matter for businesses?

* Superposition means that a quantum object, such as a qubit, can exist in multiple states simultaneously, rather than being strictly a 0 or a 1, like a classical bit. Entanglement means that two, or more, qubits can become deeply correlated, measuring one instantly determines the state of the other, no matter the distance between them. Together, these properties allow quantum algorithms to explore vast number of possibilities at once, like trying every key in a lock at once.