I don’t really know if there would be a quantum algorithm that would outperform classical algorithms — I don’t even know if there’s a classical algorithm better than greedy search!

]]>@Nathaniel – Thanks for your response. Do you reckon it makes for a good problem in quantum algorithm domain and whether anyone has already come up with one to solve this ?

Cheers,

S

As per the arxiv paper should it be considered that the superpermutation problem is now resolved (in terms of algorithm to find one) ?

Thanks,

S