Conversation
|
Thank you for the PR. Could you provide benchmarks to show the performance under different numbers of cores for surface code decoding? Thanks |
|
@quantumgizmos Here are the benchmark results:
|
|
It's reassuring to see that the time is decreasing. However, I don't think timing over a single syndrome provides a realstic benchmark. Could you time over a number of syndromes dervied from randomly generated error patterns? It would also be useful to show how the advantage of parallisation changes with different pysical error rates Benchmaking procedure
|
|
@quantumgizmos I have enhanced the benchmark to incorporate your feedback. Running this benchmark for p=0.01 and 0.03. The p=0.05 on single thread is taking a quite bit of time to run... I will update once I have more info.
|
|
Thanks for the new bencmarks. It seems like the parallisation overhead is slowing the decoder. Could you review sections where you've used the OMP critical directive to see whether further parallelisation is possible? |
|
@quantumgizmos
|
|
@quantumgizmos Also, just a gentle reminder that Monday was mentioned as the last day for reviewing open PRs. If there are any specific changes or clarifications you'd like me to make on this one, I’d be happy to take care of them promptly late Sunday. And if it’s helpful to keep iterating, I’d be more than happy to continue working on it if the issue gets assigned to me. |
|
If you are interested on working on this further, we can set up a call to discuss. I think we will have to rethink the way the algorithm has been implemented from the bottom up. It doesn't look like OpenMP makes much of a difference with the current data structures. |
I'd be happy to continue working on this! Is there a preferred channel where I can reach out to you? |
|
@WingCode Great! For future discussions, my email is joschka@roffe.eu |
closes #73