Could you post a few links to these things? Last I remember there were a few PoC around pushing toy-scale examples, but nobody close to "quantum supremacy for application X"?

A cursory google still seems to indicate people are using these things to learn how a hypothetical QC could be used in practice, rather than actually doing stuff in production or anything close to it.

I have seen https://pubsonline.informs.org/doi/10.1287/mnsc.2023.00314 as an example.

> Despite the limitations in size and speed of today’s quantum computers, our algorithm provides quantifiable liquidity savings when applied to the Canadian HVPS using a 30-day sample of transaction data. By reordering batches of 70 payments, we achieve an average of Canadian (C) $240 million in daily liquidity savings, with a settlement delay of approximately 90 seconds

It has to be noted that the technology used (quantum annealing) is at best erm disputed, and that the company DWave has made very wild claims in the past. Also note that many "quantum speedups" have been de-quantumized, i.e. classical algorithms with equal or even better performance have been developed, sometimes by drawing inspiration from the quantum algorithm. Quantum supremacy is still quite unclear.

Now, could the problems we are talking about be efficiently solved on a classical computer? Maybe. But if nobody knows how to do it, we might just as well use the quantum computer.