Articles

Can magnets help make better business decisions? The Ising model and QUBO

· 2 min readquantumerp

In 1925, the physicist Ernst Ising studied how tiny magnets interact with one another. The results disappointed him so much that he left physics. More than 20 years later he learned, by chance, that his “failure” already had a name of its own, the Ising model, and had become one of the most famous models in physics.

Today the model bearing his name is used far beyond physics, among other things in mathematical optimisation problems.

What do magnets have to do with ERP?

In my day job I develop an ERP system for manufacturing companies, and I know one thing: in a factory it is hard to make a decision that doesn’t affect something else. We have limited resources, conflicting goals and countless dependencies. A solution that is good for one area is not necessarily the best for the whole organisation.

Ising’s magnets are similar. Each can take one of two states, and its orientation affects the others. The whole system tends towards the configuration with the lowest possible energy.

Hence the idea: what if certain business problems were written down as a system of interacting magnets? Mathematically, it is possible. What’s more, quantum computers may turn out to be particularly effective at solving such problems. Whether they will beat classical algorithms is still an open question.

How a magnet turns into a decision

A physicist describes such a system with a single expression, its energy:

E=−∑i<jJij sisj  −  ∑ihisi,si∈{−1,+1}E = -\sum_{i<j} J_{ij}\, s_i s_j \;-\; \sum_i h_i s_i, \qquad s_i \in \{-1,+1\}

Here si=±1s_i = \pm 1 is the direction of a magnet (up or down). JijJ_{ij} says whether two magnets prefer to align in the same or opposite directions, and how strongly. And hih_i is an external field that pushes a single magnet one way.

Now all it takes is swapping the words:

From magnets to QUBO

A simple change of variables turns the magnets into ordinary bits (0/1) and the energy into a quadratic function of bits:

si=2xi−1,xi∈{0,1}⟹E(x)=x⊤Q x+consts_i = 2x_i - 1, \quad x_i \in \{0,1\} \qquad\Longrightarrow\qquad E(\mathbf{x}) = \mathbf{x}^{\top} Q\, \mathbf{x} + \text{const}

In computer science this is called QUBO (Quadratic Unconstrained Binary Optimization). And here is the crux: the same formulation describes the problem of choosing the best combination out of 2n2^n possible ones.

Why it’s hard

Because you can’t satisfy every pair at the same time. With a few hundred decisions, the number of combinations exceeds the number of atoms in the universe, and getting one pair right breaks another. Physicists call this frustration; managers call it conflicting goals.

What surprises me most is that the same formula can describe a system of magnets and, at the same time, decisions in a factory. A hundred years ago this equation described iron. Whether it can describe a factory well enough to base real optimisation on it, or whether it’s just a neat analogy, is worth testing on concrete problems.

All articles

See also

quantumerp

Are quantum computers ready to plan production yet?

Nine teams at QPoland Quantum Hackathon 2026 produced an optimal production plan, but in only one project did the quantum algorithm do clearly better than random guessing. Who really computed the…

quantumPL

QBronze

QBronze to szkolenie przygotowane przez organizację QWorld, które wprowadza w świat komputerów kwantowych. Na początku poznajemy zagadnienia matematyczne, czyli głównie operacje macierzowe, które są…

quantumPL

Technologie kwantowe konferencja UODO

Czy Quantum Act to wróżenie z fusów, czy klucz do przyszłości? Świat się nie skończy. Ale się zmieni. I jeśli nie zrobimy nic, to zostaniemy z tyłu w wyścigu, który już trwa – choć większość jeszcze…