pyqrack-cuda 1.49.0__tar.gz → 1.49.2__tar.gz

{pyqrack_cuda-1.49.0/pyqrack_cuda.egg-info → pyqrack_cuda-1.49.2}/PKG-INFO

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

{pyqrack_cuda-1.49.0 → pyqrack_cuda-1.49.2}/pyqrack/qrack_ace_backend.py

@@ -63,13 +63,17 @@ class QrackAceBackend:
         self.long_range_columns = long_range_columns
         self._is_init = [False] * qubit_count
 
-        col_seq = [True] * long_range_columns + [False]
-        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]
-        if long_range_columns < self.row_length:
-            self._is_col_long_range[-1] = False
+        if long_range_columns >= self.row_length:
+            self._is_col_long_range = [True] * long_range_columns
+        else:
+            col_seq = [True] * long_range_columns + [False]
+            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]
+            if long_range_columns < self.row_length:
+                self._is_col_long_range[-1] = False
+
         self._hardware_offset = []
         tot_qubits = 0
         for _ in range(self.col_length):
@@ -455,8 +459,30 @@ class QrackAceBackend:
 
         lq1_lr = self._is_col_long_range[lq1 % self.row_length]
         lq2_lr = self._is_col_long_range[lq2 % self.row_length]
+
+        lq1_row = lq1 // self.row_length
+        lq1_col = lq1 % self.row_length
+        lq2_row = lq2 // self.row_length
+        lq2_col = lq2 % self.row_length
+
+        connected_cols = []
+        c = (lq1_col - 1) % self.row_length
+        while self._is_col_long_range[c] and (len(connected_cols) < (self.row_length - 1)):
+            connected_cols.append(c)
+            c = (c - 1) % self.row_length
+        connected_cols.append(c)
+        boundary = len(connected_cols)
+        c = (lq1_col + 1) % self.row_length
+        while self._is_col_long_range[c] and (len(connected_cols) < (self.row_length - 1)):
+            connected_cols.append(c)
+            c = (c + 1) % self.row_length
+        connected_cols.append(c)
+
         if lq1_lr and lq2_lr:
-            gate(self._unpack(lq1), self._unpack(lq2)[0])
+            if lq2_col in connected_cols:
+                gate(self._unpack(lq1), self._unpack(lq2)[0])
+            else:
+                shadow(self._unpack(lq1)[0], self._unpack(lq2)[0])
             return
 
         self._correct(lq1)
@@ -479,14 +505,9 @@ class QrackAceBackend:
 
             return
 
-        lq1_row = lq1 // self.row_length
-        lq1_col = lq1 % self.row_length
-        lq2_row = lq2 // self.row_length
-        lq2_col = lq2 % self.row_length
-
         hq1 = None
         hq2 = None
-        if (lq2_row == lq1_row) and (((lq1_col + 1) % self.row_length) == lq2_col):
+        if (lq2_col in connected_cols) and (connected_cols.index(lq2_col) < boundary):
             if lq1_lr:
                 self._correct(lq2)
                 hq1 = self._unpack(lq1)
@@ -509,7 +530,7 @@ class QrackAceBackend:
                 gate([hq1[0]], hq2[0])
                 self._encode(lq2, hq2, False)
                 self._encode(lq1, hq1, True)
-        elif (lq1_row == lq2_row) and (((lq2_col + 1) % self.row_length) == lq1_col):
+        elif lq2_col in connected_cols:
             if lq1_lr:
                 self._correct(lq2)
                 hq2 = self._unpack(lq2, True)
@@ -532,7 +553,7 @@ class QrackAceBackend:
                 gate([hq1[0]], hq2[0])
                 self._encode(lq1, hq1, False)
                 self._encode(lq2, hq2, True)
-        else:
+        elif lq1_col == lq2_col:
             hq1 = self._unpack(lq1)
             hq2 = self._unpack(lq2)
             if lq1_lr:
@@ -551,6 +572,22 @@ class QrackAceBackend:
                 else:
                     gate([hq1[1]], hq2[1])
                 gate([hq1[2]], hq2[2])
+        else:
+            hq1 = self._unpack(lq1)
+            hq2 = self._unpack(lq2)
+            if lq1_lr:
+                self._correct(lq2)
+                self._decode(lq2, hq2)
+                shadow(hq1[0], hq2[0])
+                self._encode(lq2, hq2)
+            elif lq2_lr:
+                self._decode(lq1, hq1)
+                shadow(hq1[0], hq2[0])
+                self._encode(lq1, hq1)
+            else:
+                shadow(hq1[0], hq2[0])
+                shadow(hq1[1], hq2[1])
+                shadow(hq1[2], hq2[2])
 
     def cx(self, lq1, lq2):
         self._cpauli(lq1, lq2, False, Pauli.PauliX)
@@ -1050,17 +1087,43 @@ class QrackAceBackend:
             "measure",
         ]
 
-    # Provided by Elara (custom OpenAI GPT)
-    def generate_logical_coupling_map(self):
-        coupling_map = []
-        for y in range(self._col_length):
-            for x in range(self._row_length):
-                q = y * self._row_length + x
-                # Define neighbors with orbifolding
-                neighbors = []
-                neighbors.append((x + 1) % self._row_length + y * self._row_length)
-                neighbors.append(x + ((y + 1) % self._col_length) * self._row_length)
-                for nq in neighbors:
-                    coupling_map.append([q, nq])
-
-        return coupling_map
+    # Mostly written by Dan, but with a little help from Elara (custom OpenAI GPT)
+    def get_logical_coupling_map(self):
+        coupling_map = set()
+        rows, cols = self.row_length, self.col_length
+
+        # Map each column index to its full list of logical qubit indices
+        def logical_index(row, col):
+            return row * cols + col
+
+        for col in range(cols):
+            connected_cols = [col]
+            c = (col - 1) % cols
+            while self._is_col_long_range[c] and (len(connected_cols) < self.row_length):
+                connected_cols.append(c)
+                c = (c - 1) % cols
+            connected_cols.append(c)
+            c = (col + 1) % cols
+            while self._is_col_long_range[c] and (len(connected_cols) < self.row_length):
+                connected_cols.append(c)
+                c = (c + 1) % cols
+            connected_cols.append(c)
+
+            is_long = self._is_col_long_range[col]
+            if is_long:
+                for row in range(rows):
+                    a = logical_index(row, col)
+                    for c in connected_cols:
+                        for r in range(0, rows):
+                            b = logical_index(r, c)
+                            if a != b:
+                                coupling_map.add((a, b))
+            else:
+                for row in range(rows):
+                    a = logical_index(row, col)
+                    for c in connected_cols:
+                        for r in range(0, rows):
+                            b = logical_index(r, c)
+                            coupling_map.add((a, b))
+
+        return sorted(coupling_map)

{pyqrack_cuda-1.49.0 → pyqrack_cuda-1.49.2/pyqrack_cuda.egg-info}/PKG-INFO

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

{pyqrack_cuda-1.49.0 → pyqrack_cuda-1.49.2}/setup.py

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