Are Genetic Programming runtimes faster on QCs than on classical computers?


If this isn't known, would they theoretically be? I'm particularly interested in knowing whether a QC would be faster at evaluating the fitness function of the possible solutions than a classical machine


Posted 2018-06-12T21:10:13.010

Reputation: 83

I think it depends on the fitness function calculation algorithm. But in the case of most genetical optimization it is not particularly complex. I think it could help more, how to find better pairs. – peterh - Reinstate Monica – 2018-06-12T22:09:44.030



There are quantum algorithms for genetic programming which would theoretically have advantages over the corresponding classical genetic programming algorithms but you would need a full-fledged quantum computer with more qubits than any quantum computer we currently have, in order to observe such an advantage.


Posted 2018-06-12T21:10:13.010

Reputation: 8 162