pyqrack-cuda-complex128 2.2.1__tar.gz → 2.2.2__tar.gz

{pyqrack_cuda_complex128-2.2.1/pyqrack_cuda_complex128.egg-info → pyqrack_cuda_complex128-2.2.2}/PKG-INFO

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

{pyqrack_cuda_complex128-2.2.1 → pyqrack_cuda_complex128-2.2.2}/pyqrack/qrack_ace_backend.py

@@ -29,6 +29,169 @@ except ImportError:
     _IS_QISKIT_AER_AVAILABLE = False
 
 
+# Initial stub and concept produced through conversation with Elara
+# (the custom OpenAI GPT)
+class LHVQubit:
+    def __init__(self, to_clone=None):
+        # Initial state in "Bloch vector" terms, defaults to |0⟩
+        if to_clone:
+            self.bloch = to_clone.bloch.copy()
+        else:
+            self.reset()
+
+    def reset(self):
+        self.bloch = [0.0, 0.0, 1.0]
+
+    def h(self):
+        # Hadamard: rotate around Y-axis then X-axis (simplified for LHV)
+        x, y, z = self.bloch
+        self.bloch = [(x + z) / math.sqrt(2), y, (z - x) / math.sqrt(2)]
+
+    def x(self):
+        x, y, z = self.bloch
+        self.bloch = [x, y, -z]
+
+    def y(self):
+        x, y, z = self.bloch
+        self.bloch = [-x, y, z]
+
+    def z(self):
+        x, y, z = self.bloch
+        self.bloch = [x, -y, z]
+
+    def rx(self, theta):
+        # Rotate Bloch vector around X-axis by angle theta
+        x, y, z = self.bloch
+        cos_theta = math.cos(theta)
+        sin_theta = math.sin(theta)
+        new_y = cos_theta * y - sin_theta * z
+        new_z = sin_theta * y + cos_theta * z
+        self.bloch = [x, new_y, new_z]
+
+    def ry(self, theta):
+        # Rotate Bloch vector around Y-axis by angle theta
+        x, y, z = self.bloch
+        cos_theta = math.cos(theta)
+        sin_theta = math.sin(theta)
+        new_x = cos_theta * x + sin_theta * z
+        new_z = -sin_theta * x + cos_theta * z
+        self.bloch = [new_x, y, new_z]
+
+    def rz(self, theta):
+        # Rotate Bloch vector around Z-axis by angle theta (in radians)
+        x, y, z = self.bloch
+        cos_theta = math.cos(theta)
+        sin_theta = math.sin(theta)
+        new_x = cos_theta * x - sin_theta * y
+        new_y = sin_theta * x + cos_theta * y
+        self.bloch = [new_x, new_y, z]
+
+    def s(self):
+        self.rz(math.pi / 2)
+
+    def adjs(self):
+        self.rz(-math.pi / 2)
+
+    def t(self):
+        self.rz(math.pi / 4)
+
+    def adjt(self):
+        self.rz(-math.pi / 4)
+
+    def u(self, theta, phi, lam):
+        # Apply general single-qubit unitary gate
+        self.rz(lam)
+        self.ry(theta)
+        self.rz(phi)
+
+    # Provided verbatim by Elara (the custom OpenAI GPT):
+    def mtrx(self, matrix):
+        """
+        Apply a 2x2 unitary matrix to the LHV Bloch vector using only standard math/cmath.
+        Matrix format: [a, b, c, d] for [[a, b], [c, d]]
+        """
+        a, b, c, d = matrix
+
+        # Current Bloch vector
+        x, y, z = self.bloch
+
+        # Convert to density matrix ρ = ½ (I + xσx + yσy + zσz)
+        rho = [[(1 + z) / 2, (x - 1j * y) / 2], [(x + 1j * y) / 2, (1 - z) / 2]]
+
+        # Compute U * ρ
+        u_rho = [
+            [a * rho[0][0] + b * rho[1][0], a * rho[0][1] + b * rho[1][1]],
+            [c * rho[0][0] + d * rho[1][0], c * rho[0][1] + d * rho[1][1]],
+        ]
+
+        # Compute (U * ρ) * U†
+        rho_prime = [
+            [
+                u_rho[0][0] * a.conjugate() + u_rho[0][1] * b.conjugate(),
+                u_rho[0][0] * c.conjugate() + u_rho[0][1] * d.conjugate(),
+            ],
+            [
+                u_rho[1][0] * a.conjugate() + u_rho[1][1] * b.conjugate(),
+                u_rho[1][0] * c.conjugate() + u_rho[1][1] * d.conjugate(),
+            ],
+        ]
+
+        # Extract Bloch components: Tr(ρ'σi) = 2 * Re[...]
+        new_x = 2 * rho_prime[0][1].real + 2 * rho_prime[1][0].real
+        new_y = 2 * (rho_prime[0][1].imag - rho_prime[1][0].imag)
+        new_z = 2 * rho_prime[0][0].real - 1  # since Tr(ρ') = 1
+
+        p = math.sqrt(new_x**2 + new_y**2 + new_z**2)
+
+        new_x /= p
+        new_y /= p
+        new_z /= p
+
+        self.bloch = [new_x, new_y, new_z]
+
+    def prob(self, basis=Pauli.PauliZ):
+        """Sample a classical outcome from the current 'quantum' state"""
+        if basis == Pauli.PauliZ:
+            prob_1 = (1 - self.bloch[2]) / 2
+        elif basis == Pauli.PauliX:
+            prob_1 = (1 - self.bloch[0]) / 2
+        elif basis == Pauli.PauliY:
+            prob_1 = (1 - self.bloch[1]) / 2
+        else:
+            raise ValueError(f"Unsupported basis: {basis}")
+        return prob_1
+
+    def m(self):
+        result = random.random() < self.prob()
+        self.reset()
+        if result:
+            self.x()
+        return result
+
+
+# Provided by Elara (the custom OpenAI GPT)
+def _cpauli_lhv(prob, targ, axis, anti, theta=math.pi):
+    """
+    Apply a 'soft' controlled-Pauli gate: rotate target qubit
+    proportionally to control's Z expectation value.
+
+    theta: full rotation angle if control in |1⟩
+    """
+    # Control influence is (1 - ctrl.bloch[2]) / 2 = P(|1⟩)
+    # BUT we avoid collapse by using the expectation value:
+    control_influence = (1 - prob) if anti else prob
+
+    effective_theta = control_influence * theta
+
+    # Apply partial rotation to target qubit:
+    if axis == Pauli.PauliX:
+        targ.rx(effective_theta)
+    elif axis == Pauli.PauliY:
+        targ.ry(effective_theta)
+    elif axis == Pauli.PauliZ:
+        targ.rz(effective_theta)
+
+
 class QrackAceBackend:
     """A back end for elided quantum error correction
 
@@ -113,18 +276,6 @@ class QrackAceBackend:
                 self._is_row_long_range[-1] = False
         sim_count = col_patch_count * row_patch_count
 
-        # Boundary qubits no longer carry a private classical LHV proxy.
-        # Instead, every boundary site (row- and/or column-boundary alike)
-        # gets a real qubit in one single, shared "crossbar" QrackSimulator.
-        # That simulator's own greedy elision (set_sdrp) is trusted to
-        # automatically factor apart whatever boundary sites turn out to be
-        # separable (e.g. disjoint rails, rail intersections), exactly the
-        # same way it already factors apart unentangled subspaces within
-        # any other single QrackSimulator instance. We don't need to special
-        # -case "crossbar intersections" by hand; the elision does it for us.
-        boundary_sim_id = sim_count
-        boundary_count = 0
-
         self._qubits = []
         sim_counts = [0] * sim_count
         sim_id = 0
@@ -139,8 +290,9 @@ class QrackAceBackend:
                     qubit.append((t_sim_id, sim_counts[t_sim_id]))
                     sim_counts[t_sim_id] += 1
 
-                    qubit.append((boundary_sim_id, boundary_count))
-                    boundary_count += 1
+                    qubit.append(
+                        LHVQubit(to_clone=(to_clone._qubits[tot_qubits][2] if to_clone else None))
+                    )
 
                 if (not c) and (not r):
                     t_sim_id = (sim_id + col_patch_count) % sim_count
@@ -157,23 +309,8 @@ class QrackAceBackend:
                 self._qubits.append(qubit)
                 tot_qubits += 1
 
-        # The crossbar's size is fixed by how many boundary sites exist.
-        # When there are none (e.g. a grid small enough, relative to
-        # long_range_rows/columns, that the whole thing is "fully
-        # connected" with no QEC boundary at all), we must NOT allocate a
-        # 0-qubit QrackSimulator for the crossbar: a 0-qubit QrackSimulator
-        # can be constructed, but calling .clone() on one crashes the
-        # native Qrack core (segfault), and clone() is called routinely by
-        # measure_shots()/clone(). So the boundary sim is only created when
-        # boundary_count > 0, exactly mirroring how the original LHV-based
-        # code never instantiated anything for the boundary case when
-        # there were no boundary sites.
-        has_boundary = boundary_count > 0
-        if has_boundary:
-            sim_counts.append(boundary_count)
-
         self.sim = []
-        for i in range(sim_count + (1 if has_boundary else 0)):
+        for i in range(sim_count):
             self.sim.append(
                 to_clone.sim[i].clone()
                 if to_clone
@@ -189,16 +326,18 @@ class QrackAceBackend:
                 )
             )
 
-            # You can still "monkey-patch" this, after the constructor.
-            if "QRACK_QUNIT_SEPARABILITY_THRESHOLD" not in os.environ:
-                # (1 - 1 / sqrt(2)) / 4 (but empirically tuned)
-                self.sim[i].set_sdrp(0.073223304703363119)
-
-        self._boundary_sim_id = boundary_sim_id if has_boundary else None
+            # You can still call "set_sdrp," after the constructor.
+            # if "QRACK_QUNIT_SEPARABILITY_THRESHOLD" not in os.environ:
+            #     # (1 - 1 / sqrt(2)) / 4 (but empirically tuned)
+            #     self.sim[i].set_sdrp(0.073223304703363119)
 
     def clone(self):
         return QrackAceBackend(to_clone=self)
 
+    def set_sdrp(self, sdrp):
+        for sim in self.sim:
+            sim.set_sdrp(sdrp)
+
     def measure_shots_consensus(self, q, s, n_instances=3, threshold=0.1):
         # Consensus measurement across n_instances independent clones.
         #
@@ -333,23 +472,35 @@ class QrackAceBackend:
 
     @staticmethod
     def _get_qb_lhv_indices(hq):
-        # Historically, index 2 (when present) pointed at a private
-        # classical LHVQubit proxy and had to be special-cased everywhere.
-        # It is now an ordinary (sim_id, idx) tuple into the shared
-        # boundary "crossbar" QrackSimulator, so it is just one more
-        # coupling target like every other index. We keep this helper's
-        # name and signature for minimal call-site churn; "lhv" is now
-        # always -1 (no index needs special-casing any more).
+        qb = []
         if len(hq) < 2:
             qb = [0]
+            lhv = -1
         elif len(hq) < 4:
-            qb = [0, 1, 2]
+            qb = [0, 1]
+            lhv = 2
         else:
-            qb = [0, 1, 2, 3, 4]
-        lhv = -1
+            qb = [0, 1, 3, 4]
+            lhv = 2
 
         return qb, lhv
 
+    @staticmethod
+    def _get_lhv_bloch_angles(sim):
+        # Z axis
+        z = sim.bloch[2]
+
+        # X axis
+        x = sim.bloch[0]
+
+        # Y axis
+        y = sim.bloch[1]
+
+        inclination = math.atan2(math.sqrt(x**2 + y**2), z)
+        azimuth = math.atan2(y, x)
+
+        return azimuth, inclination
+
     def _get_bloch_angles(self, hq):
         sim = self.sim[hq[0]].clone()
         q = hq[1]
@@ -392,25 +543,42 @@ class QrackAceBackend:
 
         sim.mtrx([m00, m01, m10, m11], q)
 
+    @staticmethod
+    def _rotate_lhv_to_bloch(sim, delta_azimuth, delta_inclination):
+        # Apply rotation as "Azimuth, Inclination" (AI)
+        cosA = math.cos(delta_azimuth)
+        sinA = math.sin(delta_azimuth)
+        cosI = math.cos(delta_inclination / 2)
+        sinI = math.sin(delta_inclination / 2)
+
+        m00 = complex(cosI, 0)
+        m01 = complex(-cosA, sinA) * sinI
+        m10 = complex(cosA, sinA) * sinI
+        m11 = complex(cosI, 0)
+
+        sim.mtrx([m00, m01, m10, m11])
+
     def _correct(self, lq, phase=False, skip_rotation=False):
         hq = self._unpack(lq)
 
         if len(hq) == 1:
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         if phase:
             for q in qb:
                 b = hq[q]
                 self.sim[b[0]].h(b[1])
+            b = hq[lhv]
+            b.h()
 
         if len(hq) == 5:
             # RMS
             p = [
                 self.sim[hq[0][0]].prob(hq[0][1]),
                 self.sim[hq[1][0]].prob(hq[1][1]),
-                self.sim[hq[2][0]].prob(hq[2][1]),
+                hq[2].prob(),
                 self.sim[hq[3][0]].prob(hq[3][1]),
                 self.sim[hq[4][0]].prob(hq[4][1]),
             ]
@@ -426,7 +594,12 @@ class QrackAceBackend:
                 )
                 / 7
             )
-            result = ((prms + (1 - qrms)) / 2) >= 0.5
+            eff_prob = (prms + (1 - qrms)) / 2
+            result = (
+                (random.random() < 0.5)
+                if (eff_prob - 0.5) == 0.0
+                else (eff_prob > 0.5)
+            )
             syndrome = (
                 [1 - p[0], 1 - p[1], 1 - p[2], 1 - p[3], 1 - p[4]]
                 if result
@@ -434,52 +607,91 @@ class QrackAceBackend:
             )
             for q in range(5):
                 if syndrome[q] > (0.5 + self._epsilon):
-                    self.sim[hq[q][0]].x(hq[q][1])
+                    if q == 2:
+                        hq[q].x()
+                    else:
+                        self.sim[hq[q][0]].x(hq[q][1])
 
             if not skip_rotation:
                 a, i = [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]
                 a[0], i[0] = self._get_bloch_angles(hq[0])
                 a[1], i[1] = self._get_bloch_angles(hq[1])
-                a[2], i[2] = self._get_bloch_angles(hq[2])
+                a[2], i[2] = QrackAceBackend._get_lhv_bloch_angles(hq[2])
                 a[3], i[3] = self._get_bloch_angles(hq[3])
                 a[4], i[4] = self._get_bloch_angles(hq[4])
 
-                a_target = sum(a) / 5
-                i_target = sum(i) / 5
+                a_target = 0
+                i_target = 0
+                for x in range(5):
+                    if x == 2:
+                        continue
+                    a_target += a[x]
+                    i_target += i[x]
+
+                a_target /= 5
+                i_target /= 5
                 for x in range(5):
-                    self._rotate_to_bloch(hq[x], a_target - a[x], i_target - i[x])
+                    if x == 2:
+                        QrackAceBackend._rotate_lhv_to_bloch(
+                            hq[x], a_target - a[x], i_target - i[x]
+                        )
+                    else:
+                        self._rotate_to_bloch(hq[x], a_target - a[x], i_target - i[x])
 
         else:
             # RMS
             p = [
                 self.sim[hq[0][0]].prob(hq[0][1]),
                 self.sim[hq[1][0]].prob(hq[1][1]),
-                self.sim[hq[2][0]].prob(hq[2][1]),
+                hq[2].prob(),
             ]
             # Balancing suggestion from Elara (the custom OpenAI GPT)
             prms = math.sqrt((p[0] ** 2 + p[1] ** 2 + p[2] ** 2) / 3)
             qrms = math.sqrt(((1 - p[0]) ** 2 + (1 - p[1]) ** 2 + (1 - p[2]) ** 2) / 3)
-            result = ((prms + (1 - qrms)) / 2) >= 0.5
+            eff_prob = (prms + (1 - qrms)) / 2
+            result = (
+                (random.random() < 0.5)
+                if (eff_prob - 0.5) == 0.0
+                else (eff_prob > 0.5)
+            )
             syndrome = [1 - p[0], 1 - p[1], 1 - p[2]] if result else [p[0], p[1], p[2]]
             for q in range(3):
                 if syndrome[q] > (0.5 + self._epsilon):
-                    self.sim[hq[q][0]].x(hq[q][1])
+                    if q == 2:
+                        hq[q].x()
+                    else:
+                        self.sim[hq[q][0]].x(hq[q][1])
 
             if not skip_rotation:
                 a, i = [0, 0, 0], [0, 0, 0]
                 a[0], i[0] = self._get_bloch_angles(hq[0])
                 a[1], i[1] = self._get_bloch_angles(hq[1])
-                a[2], i[2] = self._get_bloch_angles(hq[2])
+                a[2], i[2] = QrackAceBackend._get_lhv_bloch_angles(hq[2])
+
+                a_target = 0
+                i_target = 0
+                for x in range(3):
+                    if x == 2:
+                        continue
+                    a_target += a[x]
+                    i_target += i[x]
 
-                a_target = sum(a) / 3
-                i_target = sum(i) / 3
+                a_target /= 3
+                i_target /= 3
                 for x in range(3):
-                    self._rotate_to_bloch(hq[x], a_target - a[x], i_target - i[x])
+                    if x == 2:
+                        QrackAceBackend._rotate_lhv_to_bloch(
+                            hq[x], a_target - a[x], i_target - i[x]
+                        )
+                    else:
+                        self._rotate_to_bloch(hq[x], a_target - a[x], i_target - i[x])
 
         if phase:
             for q in qb:
                 b = hq[q]
                 self.sim[b[0]].h(b[1])
+            b = hq[lhv]
+            b.h()
 
     def apply_magnetic_bias(self, q, b):
         if b == 0:
@@ -487,13 +699,22 @@ class QrackAceBackend:
         b = math.exp(b)
         for x in q:
             hq = self._unpack(x)
-            for h in hq:
-                a, i = self._get_bloch_angles(h)
-                self._rotate_to_bloch(
-                    h,
-                    math.atan(math.tan(a) * b) - a,
-                    math.atan(math.tan(i) * b) - i,
-                )
+            for c in range(len(hq)):
+                h = hq[c]
+                if c == 2:
+                    a, i = QrackAceBackend._get_lhv_bloch_angles(h)
+                    QrackAceBackend._rotate_lhv_to_bloch(
+                        h,
+                        math.atan(math.tan(a) * b) - a,
+                        math.atan(math.tan(i) * b) - i,
+                    )
+                else:
+                    a, i = self._get_bloch_angles(h)
+                    self._rotate_to_bloch(
+                        h,
+                        math.atan(math.tan(a) * b) - a,
+                        math.atan(math.tan(i) * b) - i,
+                    )
 
     def u(self, lq, th, ph, lm):
         hq = self._unpack(lq)
@@ -502,12 +723,15 @@ class QrackAceBackend:
             self.sim[b[0]].u(b[1], th, ph, lm)
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].u(b[1], th, ph, lm)
 
+        b = hq[lhv]
+        b.u(th, ph, lm)
+
         # Correction deferred to next 2-qubit gate (_cpauli calls _correct)
 
     def r(self, p, th, lq):
@@ -517,12 +741,20 @@ class QrackAceBackend:
             self.sim[b[0]].r(p, th, b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].r(p, th, b[1])
 
+        b = hq[lhv]
+        if p == Pauli.PauliX:
+            b.rx(th)
+        elif p == Pauli.PauliY:
+            b.ry(th)
+        elif p == Pauli.PauliZ:
+            b.rz(th)
+
         # Correction deferred to next 2-qubit gate (_cpauli calls _correct)
 
     def h(self, lq):
@@ -534,12 +766,15 @@ class QrackAceBackend:
 
         self._correct(lq)
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].h(b[1])
 
+        b = hq[lhv]
+        b.h()
+
         # Correction deferred to next 2-qubit gate (_cpauli calls _correct)
 
     def s(self, lq):
@@ -549,12 +784,15 @@ class QrackAceBackend:
             self.sim[b[0]].s(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].s(b[1])
 
+        b = hq[lhv]
+        b.s()
+
     def adjs(self, lq):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -562,12 +800,15 @@ class QrackAceBackend:
             self.sim[b[0]].adjs(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].adjs(b[1])
 
+        b = hq[lhv]
+        b.adjs()
+
     def x(self, lq):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -575,12 +816,15 @@ class QrackAceBackend:
             self.sim[b[0]].x(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].x(b[1])
 
+        b = hq[lhv]
+        b.x()
+
     def y(self, lq):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -588,12 +832,15 @@ class QrackAceBackend:
             self.sim[b[0]].y(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].y(b[1])
 
+        b = hq[lhv]
+        b.y()
+
     def z(self, lq):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -601,12 +848,15 @@ class QrackAceBackend:
             self.sim[b[0]].z(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].z(b[1])
 
+        b = hq[lhv]
+        b.z()
+
     def t(self, lq):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -614,12 +864,15 @@ class QrackAceBackend:
             self.sim[b[0]].t(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].t(b[1])
 
+        b = hq[lhv]
+        b.t()
+
     def adjt(self, lq):
         hq = self._unpack(lq)
         if len(hq) < 2:
@@ -627,12 +880,15 @@ class QrackAceBackend:
             self.sim[b[0]].adjt(b[1])
             return
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
             self.sim[b[0]].adjt(b[1])
 
+        b = hq[lhv]
+        b.adjt()
+
     def _get_gate(self, pauli, anti, sim_id):
         gate = None
         shadow = None
@@ -671,11 +927,15 @@ class QrackAceBackend:
 
         return connected, boundary
 
-    def _apply_coupling(self, pauli, anti, qb1, hq1, qb2, hq2, lq1_lr):
+    def _apply_coupling(self, pauli, anti, qb1, lhv1, hq1, qb2, lhv2, hq2, lq1_lr):
         for q1 in qb1:
+            if q1 == lhv1:
+                continue
             b1 = hq1[q1]
             gate_fn, shadow_fn = self._get_gate(pauli, anti, b1[0])
             for q2 in qb2:
+                if q2 == lhv2:
+                    continue
                 b2 = hq2[q2]
                 if b1[0] == b2[0]:
                     gate_fn([b1[1]], b2[1])
@@ -696,11 +956,18 @@ class QrackAceBackend:
 
         self._correct(lq1)
 
-        qb1, _ = QrackAceBackend._get_qb_lhv_indices(hq1)
-        qb2, _ = QrackAceBackend._get_qb_lhv_indices(hq2)
-        # Apply cross coupling on every qubit, including former-LHV boundary
-        # qubits, which now live as real qubits in the shared boundary sim.
-        self._apply_coupling(pauli, anti, qb1, hq1, qb2, hq2, lq1_lr)
+        qb1, lhv1 = QrackAceBackend._get_qb_lhv_indices(hq1)
+        qb2, lhv2 = QrackAceBackend._get_qb_lhv_indices(hq2)
+        # Apply cross coupling on hardware qubits first
+        self._apply_coupling(pauli, anti, qb1, lhv1, hq1, qb2, lhv2, hq2, lq1_lr)
+        # Apply coupling to the local-hidden-variable target
+        if lhv2 >= 0:
+            _cpauli_lhv(
+                hq1[lhv1].prob() if lhv1 >= 0 else self.sim[hq1[0][0]].prob(hq1[0][1]),
+                hq2[lhv2],
+                pauli,
+                anti,
+            )
 
         self._correct(lq1, True)
         if pauli != Pauli.PauliZ:
@@ -797,7 +1064,7 @@ class QrackAceBackend:
             p = [
                 self.sim[hq[0][0]].prob(hq[0][1]),
                 self.sim[hq[1][0]].prob(hq[1][1]),
-                self.sim[hq[2][0]].prob(hq[2][1]),
+                hq[2].prob(),
                 self.sim[hq[3][0]].prob(hq[3][1]),
                 self.sim[hq[4][0]].prob(hq[4][1]),
             ]
@@ -818,7 +1085,7 @@ class QrackAceBackend:
             p = [
                 self.sim[hq[0][0]].prob(hq[0][1]),
                 self.sim[hq[1][0]].prob(hq[1][1]),
-                self.sim[hq[2][0]].prob(hq[2][1]),
+                hq[2].prob(),
             ]
             # Balancing suggestion from Elara (the custom OpenAI GPT)
             prms = math.sqrt((p[0] ** 2 + p[1] ** 2 + p[2] ** 2) / 3)
@@ -835,7 +1102,7 @@ class QrackAceBackend:
         p = self.prob(lq)
         result = ((p + self._epsilon) >= 1) or (random.random() < p)
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
@@ -846,6 +1113,11 @@ class QrackAceBackend:
             else:
                 self.sim[b[0]].force_m(b[1], result)
 
+        b = hq[lhv]
+        b.reset()
+        if result:
+            b.x()
+
         return result
 
     def force_m(self, lq, result):
@@ -856,7 +1128,7 @@ class QrackAceBackend:
 
         self._correct(lq)
 
-        qb, _ = QrackAceBackend._get_qb_lhv_indices(hq)
+        qb, lhv = QrackAceBackend._get_qb_lhv_indices(hq)
 
         for q in qb:
             b = hq[q]
@@ -867,6 +1139,11 @@ class QrackAceBackend:
             else:
                 self.sim[b[0]].force_m(b[1], result)
 
+        b = hq[lhv]
+        b.reset()
+        if result:
+            b.x()
+
         return result
 
     def m_all(self):
@@ -1232,22 +1509,25 @@ class QrackAceBackend:
             return self._coupling_map
 
         coupling_map = set()
-        rows, cols = self._row_length, self._col_length
+        # self._row_length is the number of qubits per row (the row's span,
+        # i.e. the column count); self._col_length is the number of rows.
+        num_rows, num_cols = self._col_length, self._row_length
 
-        # Map each column index to its full list of logical qubit indices
+        # Row-major logical index, strided by the actual row span.
         def logical_index(row, col):
-            return row * cols + col
+            return row * num_cols + col
 
-        for col in range(cols):
-            connected_cols, _ = self._get_connected(col, False)
-            for row in range(rows):
-                connected_rows, _ = self._get_connected(row, False)
+        for row in range(num_rows):
+            connected_rows, _ = self._get_connected(row, True)
+            for col in range(num_cols):
+                connected_cols, _ = self._get_connected(col, False)
                 a = logical_index(row, col)
-                for c in connected_cols:
-                    for r in connected_rows:
+                for r in connected_rows:
+                    for c in connected_cols:
                         b = logical_index(r, c)
                         if a != b:
                             coupling_map.add((a, b))
+                            coupling_map.add((b, a))
 
         self._coupling_map = sorted(coupling_map)
 
@@ -1261,9 +1541,11 @@ class QrackAceBackend:
             )
         noise_model = NoiseModel()
 
-        # Single-qubit depolarizing only on boundary qubits
         boundary_qubits = set()
         for a, b in self.get_logical_coupling_map():
+            if a > b:
+                #Skip duplicates
+                continue
             col_a = a % self._row_length
             col_b = b % self._row_length
             is_long_a = self._is_col_long_range[col_a]
@@ -1274,12 +1556,6 @@ class QrackAceBackend:
                 if not is_long_b:
                     boundary_qubits.add(b)
 
-        for q in boundary_qubits:
-            for gate in ["u", "u1", "u2", "u3", "h", "x", "y", "z",
-                         "s", "sdg", "t", "tdg", "rx", "ry", "rz"]:
-                noise_model.add_quantum_error(
-                    depolarizing_error(x, 1), gate, [q])
-
         # Two-qubit depolarizing on boundary-crossing and boundary-adjacent gates
         for a, b in self.get_logical_coupling_map():
             col_a = a % self._row_length

{pyqrack_cuda_complex128-2.2.1 → pyqrack_cuda_complex128-2.2.2/pyqrack_cuda_complex128.egg-info}/PKG-INFO

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

{pyqrack_cuda_complex128-2.2.1 → pyqrack_cuda_complex128-2.2.2}/setup.py

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