pyqrack-cuda 1.47.0__tar.gz → 1.48.0__tar.gz

{pyqrack_cuda-1.47.0/pyqrack_cuda.egg-info → pyqrack_cuda-1.48.0}/PKG-INFO

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

{pyqrack_cuda-1.47.0 → pyqrack_cuda-1.48.0}/pyqrack/qrack_ace_backend.py

@@ -34,16 +34,15 @@ class QrackAceBackend:
     Attributes:
         sim(QrackSimulator): Corresponding simulator.
         alternating_codes(bool): Alternate repetition code elision by index?
-        recursive_stack_depth(int): How many recursive nestings?
         row_length(int): Qubits per row.
         col_length(int): Qubits per column.
+        long_range_columns(int): How many ideal rows between QEC boundary rows?
     """
 
     def __init__(
         self,
         qubit_count=1,
-        long_range_rows=0,
-        recursive_stack_depth=1,
+        long_range_columns=0,
         alternating_codes=True,
         reverse_row_and_col=False,
         isTensorNetwork=False,
@@ -51,62 +50,41 @@ class QrackAceBackend:
         isBinaryDecisionTree=False,
         toClone=None,
     ):
+        if long_range_columns < 0:
+            long_range_columns = 0
+        if qubit_count < 0:
+            qubit_count = 0
         if toClone:
             qubit_count = toClone.num_qubits()
-            recursive_stack_depth = toClone.recursive_stack_depth
-        if recursive_stack_depth < 1:
-            recursive_stack_depth = 1
-        if long_range_rows < 0:
-            long_range_rows = 0
+            long_range_columns = toClone.long_range_columns
 
-        self.recursive_stack_depth = recursive_stack_depth
         self._factor_width(qubit_count, reverse_row_and_col)
         self.alternating_codes = alternating_codes
+        self.long_range_columns = long_range_columns
         self._is_init = [False] * qubit_count
 
-        col_seq = [False] + [True] * long_range_rows
-        self._is_col_long_range = col_seq * (self.row_length // len(col_seq))
-        self._is_col_long_range += [True] * (
-            self.row_length - len(self._is_col_long_range)
-        )
+        col_seq = [False] + [True] * long_range_columns
+        len_col_seq = len(col_seq)
+        self._is_col_long_range = (col_seq * ((self.row_length + len_col_seq - 1) // len_col_seq))[:self.row_length]
         self._hardware_offset = []
         tot_qubits = 0
-        for _ in range(self.row_length):
+        for _ in range(self.col_length):
             for c in self._is_col_long_range:
                 self._hardware_offset.append(tot_qubits)
                 tot_qubits += 1 if c else 3
         self._ancilla = tot_qubits
         tot_qubits += 1
 
-        if recursive_stack_depth > 1:
-            recursive_stack_depth -= 1
-            self.sim = (
-                toClone.sim
-                if toClone
-                else QrackAceBackend(
-                    tot_qubits,
-                    recursive_stack_depth,
-                    alternating_codes,
-                    reverse_row_and_col,
-                    isTensorNetwork,
-                    isStabilizerHybrid,
-                    isBinaryDecisionTree,
-                )
-            )
-            # This leaves an "odd-man-out" ancillary qubit.
-            self.sim.row_length = 3 * self.row_length
-            self.sim.col_length = self.col_length
-        else:
-            self.sim = (
-                toClone.sim.clone()
-                if toClone
-                else QrackSimulator(
-                    tot_qubits,
-                    isTensorNetwork=isTensorNetwork,
-                    isStabilizerHybrid=isStabilizerHybrid,
-                    isBinaryDecisionTree=isBinaryDecisionTree,
-                )
+        self.sim = (
+            toClone.sim.clone()
+            if toClone
+            else QrackSimulator(
+                tot_qubits,
+                isTensorNetwork=isTensorNetwork,
+                isStabilizerHybrid=isStabilizerHybrid,
+                isBinaryDecisionTree=isBinaryDecisionTree,
             )
+        )
 
     def clone(self):
         return QrackAceBackend(toClone=self)
@@ -621,6 +599,7 @@ class QrackAceBackend:
         self.swap(lq1, lq2)
 
     def m(self, lq):
+        self._is_init[lq] = False
         hq = self._unpack(lq)
         if self._is_col_long_range[lq % self.row_length]:
             return self.sim.m(hq[0])
@@ -639,19 +618,18 @@ class QrackAceBackend:
         # but not non-locally, via entanglement.
         # Collapse the other separable part toward agreement.
         syndrome += self.sim.force_m(hq[single_bit], bool(syndrome))
-        self._is_init[lq] = False
 
         return True if (syndrome > 1) else False
 
     def force_m(self, lq, c):
         hq = self._unpack(lq)
+        self._is_init[lq] = False
         if self._is_col_long_range[lq % self.row_length]:
             return self.sim.force_m(hq[0])
 
         self._correct(lq)
         for q in hq:
             self.sim.force_m(q, c)
-        self._is_init[lq] = False
 
         return c
 

{pyqrack_cuda-1.47.0 → pyqrack_cuda-1.48.0/pyqrack_cuda.egg-info}/PKG-INFO

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

{pyqrack_cuda-1.47.0 → pyqrack_cuda-1.48.0}/setup.py

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