8

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

Sanchayan Dutta
  • 17,497
  • 7
  • 48
  • 110
MenzerInternational
  • 83
  • 3
  • 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 Jun 12 '18 at 22:09

1 Answers1

3

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.

user1271772 No more free time
  • 13,847
  • 2
  • 25
  • 71