|
|
|
|
|
by orlp
1454 days ago
|
|
> running experiments to verify strength gain all takes a lot of compute Fun fact, in my master thesis I proved that quantum computers can verify this using quadratically fewer iterations than on a classical computer. That is, if it takes a classical computer c*n iterations to say with 99% certainty that agent A is stronger than agent B, a quantum computer can do it in d*sqrt(n) iterations, where c and d are agent-independent constants (obviously n is not agent-independent as two closely matched agents are harder to distinguish than a steamroll). The number of qubits needed put this into the far future of quantum computing, but it's neat nonetheless. |
|