How it Works

Classical computing is built on bits. A bit is a unit of information that can store either a zero or a one.

By contrast, quantum computing is built on quantum bits, or qubits, which can store zeros and ones. Qubits can represent any combination of both zero and one simultaneously - this is called a superposition.

This superposition of states - along with the other quantum mechanical phenomena of entanglement and tunneling - enables quantum computers to manipulate enormous combinations of states at once.

Whilst quantum computers will not replace your common PC, by using the principles of quantum physics, they will be able to solve very complex statistical problems that today’s computers can’t.

Technological advancements and the growing need for faster and more precise computing are positively impacting the demand for quantum computing.

Classical vs Quantum

Classical algorithms seek the lowest valley by placing the traveller at some point in the landscape and allowing that traveller to move based on local variations.

Such classical algorithms are prone to leading the traveller into nearby valleys that may not be the global minimum.

Numerous trials are typically required, with travellers beginning their journeys from different points.

In contrast, annealing quantum computing begins with the traveller simultaneously occupying many coordinates thanks to the quantum phenomenon of superposition.

Quantum tunnelling allows the traveller to pass through hills - rather than be forced to climb them - reducing the chance of becoming trapped in valleys that are not the global minimum.

Quantum entanglement further improves the outcome by allowing the traveller to discover correlations between the coordinates that lead to deep valleys.