pyqrack-cuda 1.46.1__tar.gz → 1.46.3__tar.gz

{pyqrack_cuda-1.46.1/pyqrack_cuda.egg-info → pyqrack_cuda-1.46.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pyqrack-cuda
-Version: 1.46.1
+Version: 1.46.3
 Summary: pyqrack - Pure Python vm6502q/qrack Wrapper
 Home-page: https://github.com/vm6502q/pyqrack
 Author: Daniel Strano

{pyqrack_cuda-1.46.1 → pyqrack_cuda-1.46.3}/pyqrack/qrack_ace_backend.py

@@ -48,10 +48,12 @@ class QrackAceBackend:
         isBinaryDecisionTree=False,
         toClone=None,
     ):
-        if recursive_stack_depth < 1:
-            recursive_stack_depth = 1
         if toClone:
             qubit_count = toClone.num_qubits()
+            recursive_stack_depth = toClone.recursive_stack_depth
+        if recursive_stack_depth < 1:
+            recursive_stack_depth = 1
+        self.recursive_stack_depth = recursive_stack_depth
         if recursive_stack_depth > 1:
             recursive_stack_depth -= 1
             self.sim = (
@@ -510,28 +512,38 @@ class QrackAceBackend:
 
     def m_all(self):
         result = 0
-        # Whenever a nonzero syndrome occurs (so the code has an error),
-        # we insert the more-probable results and collapse towards it.
-        # Randomize the order of post-selection to amortize error.
-        lqubits = list(range(self.sim.num_qubits() // 3))
-        random.shuffle(lqubits)
-        for lq in lqubits:
-            if self.m(lq):
-                result |= 1 << lq
+        # Randomize the order of measurement to amortize error.
+        # However, locality of collapse matters:
+        # always measure across rows, and by consecutive rows.
+        row_offset = rand.randint(0, self.col_length - 1)
+        row_reverse = bool(random.randint(0, 1))
+        row_alternate = bool(random.randint(0, 1))
+        for row in range(self.col_length):
+            r = row
+            if row_alternate:
+                half_row = row >> 1
+                r = (self.col_length // 2) + (half_row if row & 1 else -half_row)
+            lq_row = (((self.col_length - r) if row_reverse else r) + row_offset) % self.col_length
+            col_offset = rand.randint(0, self.row_length - 1)
+            col_reverse = self.alternating_codes and (r & 1)
+            for c in range(self.row_length):
+                lq_col = (((self.row_length - (c + 1)) if col_reverse else c) + col_offset) % self.row_length
+                lq = lq_row * self.row_length + lq_col
+                if self.m(lq):
+                    result |= 1 << lq
 
         return result
 
     def measure_shots(self, q, s, high_accuracy=True):
         if high_accuracy:
             samples = []
-            _q = q.copy()
             for _ in range(s):
                 clone = self.sim.clone()
+                _sample = clone.m_all()
                 sample = 0
-                random.shuffle(_q)
-                for b in _q:
-                    if clone.m(b):
-                        sample |= 1 << q.index(b)
+                for i in range(len(q)):
+                    if (_sample >> q[i]) & 1:
+                        sample |= 1 << i
                 samples.append(sample)
 
             return samples

{pyqrack_cuda-1.46.1 → pyqrack_cuda-1.46.3/pyqrack_cuda.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pyqrack-cuda
-Version: 1.46.1
+Version: 1.46.3
 Summary: pyqrack - Pure Python vm6502q/qrack Wrapper
 Home-page: https://github.com/vm6502q/pyqrack
 Author: Daniel Strano

{pyqrack_cuda-1.46.1 → pyqrack_cuda-1.46.3}/setup.py

@@ -7,7 +7,7 @@ from setuptools import setup
 from setuptools.command.build_py import build_py
 
 
-VERSION = "1.46.1"
+VERSION = "1.46.3"
 
 # Read long description from README.
 README_PATH = os.path.join(os.path.abspath(os.path.dirname(__file__)), 'README.md')