|
|
|
|
|
|
by eigenket
931 days ago
|
|
|
They have exponentially many classical oscillators, but then they simulate them with their quantum algorithm with exponential speed up. The two exponential factors cancel and you end up with a quantum algorithm for a BQP complete problem which runs in polynomial time. |
|
|