-
Notifications
You must be signed in to change notification settings - Fork 2
Open
Description
We need to do quantitative benchmarks to:
- confirm the asymptotic scaling of the implementation to avoid negative surprise
- compare with N^3 implementation (see Feature: $O(N^3)$ Pauli flow-finding algorithm qat-inria/graphix#19 for draft of new algorithm) and potentially think about its rust implementation
Metadata
Metadata
Assignees
Labels
No labels