Hacker News Reader

A fine question!

> Our solvers include the binary quadratic model solver, the discrete quadratic model solver, and the constrained quadratic model solver.

Apparently this include graph colouring and travelling salesman problems, as well as things expressible in https://github.com/MQLib/MQLib .

What was the time complexity of the solution to salesman problem?

Or are quantum algorithms not measured in the same way?

The problem is np hard and d-wave runs quantum annealers, so the ultimate benchmark is likely wall time.

How far off is the tech to be able to run Shor’s algorithm?

It is not general purpose quantum computer, so it will not run Shor algorithm.

Isn’t it, anything but slower and more costly than anything you could do with a convention computer?

Oh wait, it’s just a very small subset of problems, nvm.

Constrained optimization

You can find the prime factors of the number 15.