Open TimWeaving opened 2 years ago
Parallelization of Pauli multiplication was assessed in #44 also, though it was not found to provide any performance benefit due to the overhead of spawning many simultaneous processes. The final cleanup was optimized by switching out the lexsort operation for a 'void view' numpy implementation.
Benchmarks have already been completed on my modest laptop (see the README), although still worth running a larger scale benchmark on a supercomputer one of these days.
Assess our performance against various quantum computing packages such as Qiskit, Cirq, Stim (the holy grail) etc.