pyqrack-cpu-complex128 2.26.0__tar.gz → 2.26.1__tar.gz

{pyqrack_cpu_complex128-2.26.0/pyqrack_cpu_complex128.egg-info → pyqrack_cpu_complex128-2.26.1}/PKG-INFO

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

{pyqrack_cpu_complex128-2.26.0 → pyqrack_cpu_complex128-2.26.1}/pyqrack/qrack_ace_backend.py

@@ -1813,39 +1813,6 @@ class QrackAceBackend:
         sims1 = {r[0] for r in hq1}
         sims2 = {r[0] for r in hq2}
 
-        if sims1.isdisjoint(sims2):
-            self._correct(lq1)
-            self._correct(lq2)
-
-            # Once fully resolved, the swap itself is nothing but a
-            # reference exchange: self._qubits[lq] is a reference to the
-            # replica-list object, so swapping which index points to
-            # which object IS the swap -- no separate content to copy.
-            self._qubits[lq1], self._qubits[lq2] = self._qubits[lq2], self._qubits[lq1]
-
-            lhv1 = self._lhv.pop(lq1, None)
-            lhv2 = self._lhv.pop(lq2, None)
-            if lhv2 is not None:
-                self._lhv[lq1] = lhv2
-            if lhv1 is not None:
-                self._lhv[lq2] = lhv1
-
-            # Boundary repetition code needs no bookkeeping here, unlike
-            # self._qubits/self._lhv just above: it's on-demand now, not
-            # a permanent, per-logical-index dict of pre-allocated
-            # partners -- eligibility is just len(self._qubits[lq]) > 1,
-            # computed fresh on every coupling event, so the reference
-            # swap of self._qubits above already, automatically carries
-            # the right eligibility with it. Nothing else to move.
-            return
-
-        # Boundary-to-boundary handling
-        if (len(hq1) > 1) and (len(hq2) > 1):
-            self.cx(lq1, lq2)
-            self.cx(lq2, lq1)
-            self.cx(lq1, lq2)
-            return
-
         # Fast/exact path: every replica of lq1 lines up, position-for-
         # position, with the corresponding replica of lq2 on the SAME
         # underlying simulator. A native swap() there is pure index
@@ -1872,8 +1839,6 @@ class QrackAceBackend:
         # two sides can land on different simulators (the partial-match
         # branches below) needs separate, careful treatment -- not
         # reused as-is from _cpauli's helper.
-        self._correct(lq1)
-        self._correct(lq2)
 
         if len(hq1) == len(hq2) and all(hq1[i][0] == hq2[i][0] for i in range(len(hq1))):
             for i in range(len(hq1)):
@@ -1887,6 +1852,36 @@ class QrackAceBackend:
             # with or without this call).
             return
 
+        if sims1.isdisjoint(sims2):
+            # Once fully resolved, the swap itself is nothing but a
+            # reference exchange: self._qubits[lq] is a reference to the
+            # replica-list object, so swapping which index points to
+            # which object IS the swap -- no separate content to copy.
+            self._qubits[lq1], self._qubits[lq2] = self._qubits[lq2], self._qubits[lq1]
+
+            lhv1 = self._lhv.pop(lq1, None)
+            lhv2 = self._lhv.pop(lq2, None)
+            if lhv2 is not None:
+                self._lhv[lq1] = lhv2
+            if lhv1 is not None:
+                self._lhv[lq2] = lhv1
+
+            # Boundary repetition code needs no bookkeeping here, unlike
+            # self._qubits/self._lhv just above: it's on-demand now, not
+            # a permanent, per-logical-index dict of pre-allocated
+            # partners -- eligibility is just len(self._qubits[lq]) > 1,
+            # computed fresh on every coupling event, so the reference
+            # swap of self._qubits above already, automatically carries
+            # the right eligibility with it. Nothing else to move.
+            return
+
+        # Boundary-to-boundary handling
+        if (len(hq1) > 1) and (len(hq2) > 1):
+            self.cx(lq1, lq2)
+            self.cx(lq2, lq1)
+            self.cx(lq1, lq2)
+            return
+
         anc1, anc2 = None, None
         if self.is_error_detection and not self._in_gadget_capture and ((len(hq1) > 1) or (len(hq2) > 1)):
             t_sims = {y[0] for y in hq2 if y[0] >= 0}
@@ -1902,6 +1897,9 @@ class QrackAceBackend:
             self.cx(lq2, anc2)
             self._in_gadget_capture = False
 
+        self._correct(lq1)
+        self._correct(lq2)
+
         # Partial-match cases: one side is a simple (single-replica) qubit,
         # the other has multiple replicas. For the multi-replica side's
         # non-matching replicas, the correct decomposition (verified
@@ -2001,10 +1999,6 @@ class QrackAceBackend:
             self.mcx([c1, c2], t)
             return
 
-        if not self._in_gadget_capture:
-            self._correct(c1)
-            self._correct(c2)
-
         # Control-protection ancillas (anc1/anc1b/anc2/anc2b, checking
         # whether c1/c2's own values held still) removed entirely, same
         # basis as _apply_coupling: instrumented and stress-tested
@@ -2070,6 +2064,9 @@ class QrackAceBackend:
                 self.ccx(c1, c2, anc_and)
             self._in_gadget_capture = False
 
+        self._correct(c1)
+        self._correct(c2)
+
         qb1, _ = QrackAceBackend._get_qb_lhv_indices(hq1)
         qb2, _ = QrackAceBackend._get_qb_lhv_indices(hq2)
         qbt, _ = QrackAceBackend._get_qb_lhv_indices(hqt)
@@ -2136,6 +2133,8 @@ class QrackAceBackend:
             for (b1, b2, bt) in witnesses:
                 self.sim[b1[0]].mcx([b1[1], b2[1]], bt[1])
 
+        self._correct(t)
+
         self._in_gadget_capture = True
 
         if anc_and is not None:
@@ -2153,9 +2152,6 @@ class QrackAceBackend:
 
         self._in_gadget_capture = False
 
-        if not self._in_gadget_capture:
-            self._correct(t)
-
     def ccz(self, c1, c2, t):
         self.h(t)
         self.ccx(c1, c2, t)

{pyqrack_cpu_complex128-2.26.0 → pyqrack_cpu_complex128-2.26.1/pyqrack_cpu_complex128.egg-info}/PKG-INFO

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

{pyqrack_cpu_complex128-2.26.0 → pyqrack_cpu_complex128-2.26.1}/pyqrack_cpu_complex128.egg-info/SOURCES.txt

@@ -17,6 +17,9 @@ pyqrack/qrack_stabilizer.py
 pyqrack/quimb_circuit_type.py
 pyqrack/qrack_system/__init__.py
 pyqrack/qrack_system/qrack_system.py
+pyqrack/qrack_system/qrack_cl_precompile/qrack_cl_precompile
+pyqrack/qrack_system/qrack_lib/libqrack_pinvoke.so
+pyqrack/qrack_system/qrack_lib/libqrack_pinvoke.so.10.13.1
 pyqrack/stats/__init__.py
 pyqrack/stats/load_quantized_data.py
 pyqrack/stats/quantize_by_range.py

{pyqrack_cpu_complex128-2.26.0 → pyqrack_cpu_complex128-2.26.1}/setup.py

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