pyqrack-cuda 1.46.5__tar.gz → 1.46.7__tar.gz

{pyqrack_cuda-1.46.5/pyqrack_cuda.egg-info → pyqrack_cuda-1.46.7}/PKG-INFO

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

{pyqrack_cuda-1.46.5 → pyqrack_cuda-1.46.7}/pyqrack/qrack_ace_backend.py

@@ -54,6 +54,10 @@ class QrackAceBackend:
         if recursive_stack_depth < 1:
             recursive_stack_depth = 1
         self.recursive_stack_depth = recursive_stack_depth
+        self._ancilla = 3 * qubit_count
+        self._factor_width(qubit_count)
+        self.alternating_codes = alternating_codes
+        self._is_init = [False] * qubit_count
         if recursive_stack_depth > 1:
             recursive_stack_depth -= 1
             self.sim = (
@@ -61,16 +65,15 @@ class QrackAceBackend:
                 if toClone
                 else QrackAceBackend(3 * qubit_count + 1, recursive_stack_depth=recursive_stack_depth, alternating_codes=alternating_codes, isTensorNetwork=isTensorNetwork, isStabilizerHybrid=isStabilizerHybrid, isBinaryDecisionTree=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(3 * qubit_count + 1, isTensorNetwork=isTensorNetwork, isStabilizerHybrid=isStabilizerHybrid, isBinaryDecisionTree=isBinaryDecisionTree)
             )
-        self._ancilla = 3 * qubit_count
-        self._factor_width(qubit_count)
-        self.alternating_codes = alternating_codes
-        self._is_init = [False] * qubit_count
 
     def clone(self):
         return QrackAceBackend(toClone=self)
@@ -135,19 +138,13 @@ class QrackAceBackend:
 
     def _encode(self, hq, reverse=False):
         lq = hq[0] // 3
-        row = lq // self.row_length
-        even_row = not (row & 1)
+        even_row = not ((lq // self.row_length) & 1)
+        # Encode shadow-first
+        if self._is_init[lq]:
+            self._cx_shadow(hq[0], hq[2])
         if ((not self.alternating_codes) and reverse) or (even_row == reverse):
-            if self._is_init[lq]:
-                # Encode shadow-first
-                self._cx_shadow(hq[0], hq[1])
-                self.sim.mcx([hq[1]], hq[2])
-            else:
-                self.sim.mcx([hq[2]], hq[1])
+            self.sim.mcx([hq[2]], hq[1])
         else:
-            if self._is_init[lq]:
-                # Encode shadow-first
-                self._cx_shadow(hq[0], hq[2])
             self.sim.mcx([hq[0]], hq[1])
         self._is_init[lq] = True
 
@@ -155,16 +152,14 @@ class QrackAceBackend:
         lq = hq[0] // 3
         if not self._is_init[lq]:
             return
-        row = lq // self.row_length
-        even_row = not (row & 1)
+        even_row = not ((lq // self.row_length) & 1)
         if ((not self.alternating_codes) and reverse) or (even_row == reverse):
             # Decode entangled-first
-            self.sim.mcx([hq[1]], hq[2])
-            self._cx_shadow(hq[0], hq[1])
+            self.sim.mcx([hq[2]], hq[1])
         else:
             # Decode entangled-first
             self.sim.mcx([hq[0]], hq[1])
-            self._cx_shadow(hq[0], hq[2])
+        self._cx_shadow(hq[0], hq[2])
 
     def _correct(self, lq):
         if not self._is_init[lq]:
@@ -172,20 +167,23 @@ class QrackAceBackend:
         # We can't use true syndrome-based error correction,
         # because one of the qubits in the code is separated.
         # However, we can get pretty close!
-        shots = 1024
-        even_row = not ((lq // self.row_length) & 1)
+        shots = 512
+
         single_bit = 0
         other_bits = []
-        if not self.alternating_codes or even_row:
+        if not self.alternating_codes or not ((lq // self.row_length) & 1):
             single_bit = 2
             other_bits = [0, 1]
         else:
             single_bit = 0
             other_bits = [1, 2]
+
         hq = self._unpack(lq)
+
         single_bit_value = self.sim.prob(hq[single_bit])
         single_bit_polarization = max(single_bit_value, 1 - single_bit_value)
         samples = self.sim.measure_shots([hq[other_bits[0]], hq[other_bits[1]]], shots)
+
         syndrome_indices = (
             [other_bits[1], other_bits[0]]
             if (single_bit_value >= 0.5)
@@ -278,6 +276,7 @@ class QrackAceBackend:
             lm += 2 * math.pi
         hq = self._unpack(lq)
         if not math.isclose(ph, -lm) and not math.isclose(abs(ph), math.pi / 2):
+            # Produces/destroys superposition
             self._correct_if_like_h(th, lq)
             self._decode(hq)
             self.sim.u(hq[0], th, ph, lm)
@@ -285,6 +284,7 @@ class QrackAceBackend:
                 self.sim.u(hq[2], th, ph, lm)
             self._encode(hq)
         else:
+            # Shouldn't produce/destroy superposition
             for b in hq:
                 self.sim.u(b, th, ph, lm)
 
@@ -297,9 +297,11 @@ class QrackAceBackend:
             self._correct_if_like_h(th, lq)
         hq = self._unpack(lq)
         if (p == Pauli.PauliZ) or math.isclose(abs(th), math.pi):
+            # Doesn't produce/destroy superposition
             for b in hq:
                 self.sim.r(p, th, b)
         else:
+            # Produces/destroys superposition
             self._decode(hq)
             self.sim.r(p, th, hq[0])
             if not self._is_init[lq]:
@@ -374,14 +376,14 @@ class QrackAceBackend:
 
             return
 
-        lq1_col = lq1 // self.row_length
-        lq1_row = lq1 % self.row_length
-        lq2_col = lq2 // self.row_length
-        lq2_row = 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
 
         hq1 = None
         hq2 = None
-        if (lq2_col == lq1_col) and (((lq1_row + 1) % self.row_length) == lq2_row):
+        if (lq2_row == lq1_row) and (((lq1_col + 1) % self.row_length) == lq2_col):
             self._correct(lq2)
             hq1 = self._unpack(lq1, True)
             hq2 = self._unpack(lq2, False)
@@ -390,7 +392,7 @@ class QrackAceBackend:
             gate([hq1[0]], hq2[0])
             self._encode(hq2, False)
             self._encode(hq1, True)
-        elif (lq1_col == lq2_col) and (((lq2_row + 1) % self.row_length) == lq1_row):
+        elif (lq1_row == lq2_row) and (((lq2_col + 1) % self.row_length) == lq1_col):
             self._correct(lq2)
             hq2 = self._unpack(lq2, True)
             hq1 = self._unpack(lq1, False)
@@ -403,7 +405,7 @@ class QrackAceBackend:
             hq1 = self._unpack(lq1)
             hq2 = self._unpack(lq2)
             gate([hq1[0]], hq2[0])
-            if self.alternating_codes and ((lq2_col & 1) != (lq1_col & 1)):
+            if self.alternating_codes and ((lq2_row & 1) != (lq1_row & 1)):
                 shadow(hq1[1], hq2[1])
             else:
                 gate([hq1[1]], hq2[1])
@@ -476,8 +478,7 @@ class QrackAceBackend:
 
     def m(self, lq):
         hq = self._unpack(lq)
-        even_row = not ((lq // self.row_length) & 1)
-        if not self.alternating_codes or even_row:
+        if not self.alternating_codes or not ((lq // self.row_length) & 1):
             single_bit = 2
             other_bits = [0, 1]
         else:
@@ -485,18 +486,12 @@ class QrackAceBackend:
             other_bits = [1, 2]
         # The syndrome of "other_bits" is guaranteed to be fixed, after this.
         self._correct(lq)
-        syndrome = 0
-        for q in other_bits:
-            syndrome += self.sim.m(hq[q])
+        syndrome = self.sim.m(hq[other_bits[0]])
+        syndrome += self.sim.force_m(hq[other_bits[1]], bool(syndrome))
         # The two separable parts of the code are correlated,
         # but not non-locally, via entanglement.
         # Collapse the other separable part toward agreement.
-        if syndrome == 0:
-            self.sim.force_m(hq[single_bit], False)
-        elif syndrome == 2:
-            syndrome += self.sim.force_m(hq[single_bit], True)
-        else:
-            raise RuntimeError("Unexpected syndrome in m()!")
+        syndrome += self.sim.force_m(hq[single_bit], bool(syndrome))
         self._is_init[lq] = False
 
         return True if (syndrome > 1) else False
@@ -514,11 +509,11 @@ class QrackAceBackend:
         result = 0
         # Randomize the order of measurement to amortize error.
         # However, locality of collapse matters:
-        # always measure across rows, and by consecutive rows.
-        rows = list(range(range(self.col_length)))
+        # always measure across rows, and by row directionality.
+        rows = list(range(self.col_length))
         random.shuffle(rows)
         for lq_row in rows:
-            col_offset = rand.randint(0, self.row_length - 1)
+            col_offset = random.randint(0, self.row_length - 1)
             col_reverse = self.alternating_codes and (lq_row & 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
@@ -532,7 +527,7 @@ class QrackAceBackend:
         if high_accuracy:
             samples = []
             for _ in range(s):
-                clone = self.sim.clone()
+                clone = self.clone()
                 _sample = clone.m_all()
                 sample = 0
                 for i in range(len(q)):
@@ -569,8 +564,7 @@ class QrackAceBackend:
     def prob(self, lq):
         self._correct(lq)
         hq = self._unpack(lq)
-        even_row = not ((lq // self.row_length) & 1)
-        if not self.alternating_codes or even_row:
+        if not self.alternating_codes or not ((lq // self.row_length) & 1):
             other_bits = [0, 1]
         else:
             other_bits = [1, 2]

{pyqrack_cuda-1.46.5 → pyqrack_cuda-1.46.7/pyqrack_cuda.egg-info}/PKG-INFO

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

{pyqrack_cuda-1.46.5 → pyqrack_cuda-1.46.7}/setup.py

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