Can afford O(n^2) Gray search complexity per thread

Author: WrathfulSpatula

pyproject.toml

@@ -10,7 +10,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "pyqrackising"
-version = "9.5.13"
+version = "9.6.0"
 requires-python = ">=3.8"
 description = "Fast MAXCUT, TSP, and sampling heuristics from near-ideal transverse field Ising model (TFIM)"
 readme = {file = "README.txt", content-type = "text/markdown"}

pyqrackising/spin_glass_solver.py

@@ -308,7 +308,7 @@ def spin_glass_solver(
     best_theta = np.array([b == "1" for b in list(bitstring)], dtype=np.bool_)
 
     if gray_iterations is None:
-        gray_iterations = n_qubits * os.cpu_count()
+        gray_iterations = n_qubits * n_qubits * os.cpu_count()
 
     if gray_seed_multiple is None:
         gray_seed_multiple = os.cpu_count()

setup.py

@@ -7,7 +7,7 @@
 
 setup(
     name='pyqrackising',
-    version='9.5.13',
+    version='9.6.0',
     author='Dan Strano',
     author_email='stranoj@gmail.com',
     description='Fast MAXCUT, TSP, and sampling heuristics from near-ideal transverse field Ising model (TFIM)',