Timeline for Would it be possible to solve an linear programming problem with quantum computing, obtaining the same result as in an solver
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 27 at 17:52 | comment | added | Ron Cohen | Yes. Check this guide docs.classiq.io/latest/explore/applications/optimization/… | |
| Nov 27 at 13:59 | comment | added | Martin Vesely | You could probably be able to reach the same result provided quantum computers are more matured technology. However, D-Wave is really close to a marketable device, so you can try so solve with their Leap environment. Just note, LP problems can be usually solved in polynomial time (in worst case unfortunately, simplex algorithm is exp. complex). So, I see a little benefit of QC for LP. On the other hand, QC can be very useful for binary, discrete or mixed programming. | |
| Nov 27 at 13:56 | history | edited | Martin Vesely | CC BY-SA 4.0 |
deleted 4 characters in body
|
| S Nov 26 at 17:54 | review | First questions | |||
| Nov 27 at 13:59 | |||||
| S Nov 26 at 17:54 | history | asked | RazerPlays | CC BY-SA 4.0 |