4 ms·
LightSolver are shameless charlatans and scammers of the highest order. We may one day see both founders in jail for defrauding their investors. Let's just loo
by light_hue_1 3y ago
LightSolver are shameless charlatans and scammers of the highest order. We may one day see both founders in jail for defrauding their investors.
Let's just look at two of their false claims:
> Taking on the “3-Regular 3-XORSAT Challenge,” LightSolver solved the problem in polynomial time, while all other state-of-the art classical and quantum computers solved it in exponential time.
That is absolutely 100% false in numerous ways.
First of all, they solved this in a simulation, not on their actual LightSolver hardware. So that means that classical computers can solve this problem in polynomial time just fine. Their hardware is totally superflous.
That's not at all surprising because 3R3X is solvable in cubic time with Gaussian elimination or conjugate gradient methods! It's a thorny problem for a class of optimizers, but it poses no problems in general.
Everything they say is just a lie. For example "Faster than TensorFlow". Then you click, and it's a paper comparing their method to one particular max-sat solver implemented in TF, RUN-CSP. And they implement a totally different approach, again, as a simulator on a classical computer. Which then turns out to be faster (not surprising, RUN-CSP is not state of the art in performance, nowhere near). In no sense does this mean they're faster than TF. They're just lying.
- tromp 3y ago> 3R3X is solvable in cubic time with Gaussian elimination As explained on Wikipedia [1]. [1] https://en.wikipedia.org/wiki/Boolean_satisfiability_problem#XOR-satisfiability https://en.wikipedia.org/wiki/Boolean_satisfiability_problem...