reactivated ML based sparse matrix mult algorithm decision

eclipse-qrisp · Jun 17, 2024 · a5d18b7 · a5d18b7
1 parent fa92b2a
commit a5d18b7
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/src/qrisp/simulator/bi_array_helper.py b/src/qrisp/simulator/bi_array_helper.py
@@ -541,7 +541,7 @@ def sparse_matrix_mult(A, B):
         log_sparsity_a = -np.log2(B.nnz/(B.shape[0]*B.shape[1]))
         log_sparsity_b = -np.log2(A.nnz/(A.shape[0]*A.shape[1]))
 
-    if get_prediction(log_shape_0_a, log_shape_1_b, log_sparsity_a, log_sparsity_b) and False:
+    if get_prediction(log_shape_0_a, log_shape_1_b, log_sparsity_a, log_sparsity_b):
         return (A @ B).tocoo()
     else:
         return  coo_sparse_matrix_mult(A, B)

diff --git a/tests/test_unitary_calculation.py b/tests/test_unitary_calculation.py
@@ -36,9 +36,9 @@ def test_unitary_calculation():
     x = QuantumFloat(n, 0, qs, signed=True)
     y = QuantumFloat(n, 0, qs, signed=False)
 
-    s = x * y
+    s = x + y
     # qs = s.qs
-    qc = qs.compile(1)
+    qc = qs.compile()
 
     start = time.time()
     test_unitary_1 = qc.get_unitary()