filter counts, updated sparse computation logic

UST-QuAntiL · Sep 22, 2022 · 4d389ea · 4d389ea
1 parent a33e8cf
commit 4d389ea
Show file tree

Hide file tree

Showing 3 changed files with 5 additions and 3 deletions.
diff --git a/app/database/minio_db.py b/app/database/minio_db.py
@@ -5,7 +5,7 @@
 from config import Config
 import os
 from datetime import datetime
-
+from scipy.sparse import *
 
 client = Minio(
     Config.MINIO_ENDPOINT,

diff --git a/app/services/rem_services/mitigation_application.py b/app/services/rem_services/mitigation_application.py
@@ -24,7 +24,7 @@ def appyl_mitigation(self, mitigator, **kwargs):
         counts = kwargs["counts"]
         array_counts = dict_to_array(counts, n_qubits)
         if issparse(mitigator):
-            res = list(np.matmul(mitigator.toarray(), array_counts))
+            res = mitigator.dot(array_counts)
         else:
             res = list(np.matmul(mitigator, array_counts))
         return array_to_dict(res, n_qubits)

diff --git a/app/utils/helper_functions.py b/app/utils/helper_functions.py
@@ -16,7 +16,9 @@ def dict_to_array(counts_dict: dict, n_qubits: int):
 def array_to_dict(counts_array: list, n_qubits: int):
     dict = {}
     for i, e in enumerate(counts_array):
-        dict["{:0{}b}".format(i, n_qubits)] = e
+        # Remove all counts da occur less than once -> this drastically decreases the number of total counts
+        if (e >= 1):
+            dict["{:0{}b}".format(i, n_qubits)] = e
     return dict