pyqrack-cuda 1.51.0__tar.gz → 1.52.1__tar.gz

{pyqrack_cuda-1.51.0/pyqrack_cuda.egg-info → pyqrack_cuda-1.52.1}/PKG-INFO

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

{pyqrack_cuda-1.51.0 → pyqrack_cuda-1.52.1}/pyqrack/qrack_ace_backend.py

@@ -35,8 +35,7 @@ class QrackAceBackend:
 
     The backend was originally designed assuming an (orbifolded) 2D qubit grid like 2019 Sycamore.
     However, it quickly became apparent that users can basically design their own connectivity topologies,
-    without breaking the concept. (Not all will work equally well.) For maximum flexibility, set
-    "alternating_codes=False". (For best performance on Sycamore-like topologies,leave it "True.")
+    without breaking the concept. (Not all will work equally well.)
 
     Consider distributing the different "patches" to different GPUs with self.sim[sim_id].set_device(gpu_id)!
     (If you have 3+ patches, maybe your discrete GPU can do multiple patches in the time it takes an Intel HD
@@ -44,7 +43,6 @@ class QrackAceBackend:
 
     Attributes:
         sim(QrackSimulator): Array of simulators corresponding to "patches" between boundary rows.
-        alternating_codes(bool): Alternate repetition code elision by index?
         row_length(int): Qubits per row.
         col_length(int): Qubits per column.
         long_range_columns(int): How many ideal rows between QEC boundary rows?
@@ -54,7 +52,6 @@ class QrackAceBackend:
         self,
         qubit_count=1,
         long_range_columns=-1,
-        alternating_codes=True,
         reverse_row_and_col=False,
         isTensorNetwork=False,
         isStabilizerHybrid=False,
@@ -72,7 +69,6 @@ class QrackAceBackend:
             long_range_columns = 3 if (self.row_length % 3) == 1 else 2
         self.long_range_columns = long_range_columns
 
-        self.alternating_codes = alternating_codes
         self._coupling_map = None
 
         # If there's only one or zero "False" columns,
@@ -100,24 +96,24 @@ class QrackAceBackend:
                     self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
                     tot_qubits += 1
                     sim_counts[sim_id] += 1
-                elif not self.alternating_codes or not (r & 1):
-                    self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
-                    tot_qubits += 1
-                    sim_counts[sim_id] += 1
-                    sim_id = (sim_id + 1) % sim_count
+                elif (r & 1):
                     for _ in range(2):
                         self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
                         tot_qubits += 1
                         sim_counts[sim_id] += 1
+                    sim_id = (sim_id + 1) % sim_count
+                    self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
+                    tot_qubits += 1
+                    sim_counts[sim_id] += 1
                 else:
+                    self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
+                    tot_qubits += 1
+                    sim_counts[sim_id] += 1
+                    sim_id = (sim_id + 1) % sim_count
                     for _ in range(2):
                         self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
                         tot_qubits += 1
                         sim_counts[sim_id] += 1
-                    sim_id = (sim_id + 1) % sim_count
-                    self._qubit_dict[tot_qubits] = (sim_id, sim_counts[sim_id])
-                    tot_qubits += 1
-                    sim_counts[sim_id] += 1
 
         self.sim = []
         for i in range(sim_count):
@@ -350,15 +346,6 @@ class QrackAceBackend:
             # Force the syndrome non-pathological.
             self.sim[ancilla_sim].force_m(ancilla, False)
 
-    def _correct_if_like_h(self, th, lq):
-        while th > math.pi:
-            th -= 2 * math.pi
-        while th <= -math.pi:
-            th += 2 * math.pi
-        th = abs(th)
-        if not math.isclose(th, 0):
-            self._correct(lq)
-
     def u(self, lq, th, ph, lm):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -383,7 +370,7 @@ class QrackAceBackend:
             b = hq[2]
             self.sim[b[0]].u(b[1], th, ph, lm)
             self._encode_decode(lq, hq)
-            self._correct_if_like_h(th, lq)
+            self._correct(lq)
         else:
             # Shouldn't produce/destroy superposition
             for b in hq:
@@ -412,7 +399,7 @@ class QrackAceBackend:
             b = hq[2]
             self.sim[b[0]].r(p, th, b[1])
             self._encode_decode(lq, hq)
-            self._correct_if_like_h(th, lq)
+            self._correct(lq)
 
     def h(self, lq):
         hq = self._unpack(lq)
@@ -738,16 +725,23 @@ class QrackAceBackend:
         result = 0
         # Randomize the order of measurement to amortize error.
         # However, locality of collapse matters:
-        # always measure across rows, and by row directionality.
-        rows = list(range(self.col_length))
-        random.shuffle(rows)
-        for lq_row in rows:
+        # measure in row pairs, and always across rows,
+        # and by row directionality.
+        row_pairs = list(range((self.col_length + 1) // 2))
+        random.shuffle(row_pairs)
+        for row_pair in row_pairs:
             col_offset = random.randint(0, self.row_length - 1)
-            col_reverse = self.alternating_codes and (lq_row & 1)
+            lq_row = row_pair << 1
+            for c in range(self.row_length):
+                lq_col = (c + col_offset) % self.row_length
+                lq = lq_row * self.row_length + lq_col
+                if self.m(lq):
+                    result |= 1 << lq
+            lq_row += 1
+            if lq_row == self.col_length:
+                continue
             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_col = ((self.row_length - (c + 1)) + col_offset) % self.row_length
                 lq = lq_row * self.row_length + lq_col
                 if self.m(lq):
                     result |= 1 << lq

{pyqrack_cuda-1.51.0 → pyqrack_cuda-1.52.1/pyqrack_cuda.egg-info}/PKG-INFO

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

{pyqrack_cuda-1.51.0 → pyqrack_cuda-1.52.1}/setup.py

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