Open WrathfulSpatula opened 2 years ago
For reporting big-O complexity of quantum (or adjacent) algorithms, we can't generally rely on just a numerical metric value.
How do we programmatically collect and compare big-O for algorithms? How do we graphically present the state-of-the-art in terms of big-O complexity?
I see where this can go more long term. For now though I'd propose we focus on the existing topic categories of implementations rather than theory updates.
For reporting big-O complexity of quantum (or adjacent) algorithms, we can't generally rely on just a numerical metric value.
How do we programmatically collect and compare big-O for algorithms? How do we graphically present the state-of-the-art in terms of big-O complexity?