Classical shadows algorithm performance can be greatly improved by doing appropriate parallelization of the loop for shadow computation and in other places within the code (see comments throughout the code).
UPDATE 06/11/23: let's use this issue for testing also the performance of the bitstring corruption routines which might be quite inefficient. Up to how many qubits can we go?
Roland-djee
commented
4 months ago
Classical shadows algorithm performance can be greatly improved by doing appropriate parallelization of the loop for shadow computation and in other places within the code (see comments throughout the code).
UPDATE 06/11/23: let's use this issue for testing also the performance of the bitstring corruption routines which might be quite inefficient. Up to how many qubits can we go?