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

  • $\begingroup$ 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. $\endgroup$
    – peterh
    Jun 12 '18 at 22:09

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.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.