quantum-debugger 1.0.0__tar.gz → 1.0.1__tar.gz

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/AUTHORS.md

@@ -37,11 +37,10 @@ If you use quantum-debugger in your research, please cite:
 
 ```bibtex
 @software{quantum_debugger_2026,
-  title = {Quantum Debugger: Production-Grade Quantum Machine Learning Library},
-  author = {Gupta, Raunak Kumar},
+  title = {Quantum Debugger: Interactive Circuit Debugging, Multi-Engine Simulation, and Quantum Machine Learning Framework},
+  author = {Raunak Kumar Gupta},
   year = {2026},
-  url = {https://github.com/Raunakg2005/quantum-debugger},
-  note = {Supervised by Dr. Vaibhav Prakash Vasani, K.J. Somaiya School of Engineering}
+  url = {https://github.com/Raunakg2005/quantum-debugger}
 }
 ```
 

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/CHANGELOG.md

@@ -5,6 +5,14 @@ All notable changes to QuantumDebugger will be documented in this file.
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [1.0.1]
+
+Theme: documentation and metadata refresh.
+
+### Changed
+- Updated BibTeX software citation author to full name (`Raunak Kumar Gupta`) and modernized project title across README and documentation.
+- Enriched documentation tutorials and examples for Matrix Product States (MPS), TEBD dynamics, VQE molecular chemistry, and open systems noise models.
+
 ## [1.0.0]
 
 Theme: scale & tensor networks — breaking the exponential state-vector wall. The

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: quantum-debugger
-Version: 1.0.0
+Version: 1.0.1
 Summary: A quantum simulation and debugging toolkit: state-vector, Clifford/stabilizer, and density-matrix (open-systems) engines, with a broad algorithm library, error correction under noise, quantum machine learning, GPU acceleration, and multi-framework support (Qiskit, PennyLane, Cirq, TensorFlow, PyTorch).
 Home-page: https://github.com/Raunakg2005/quantum-debugger
 Author: Raunak Kumar Gupta
@@ -486,8 +486,8 @@ If you use quantum-debugger in your research, please cite:
 
 ```bibtex
 @software{quantum_debugger_2026,
-  title = {Quantum Debugger: Production-Grade Quantum Machine Learning Library},
-  author = {Gupta, Raunak Kumar},
+  title = {Quantum Debugger: Interactive Circuit Debugging, Multi-Engine Simulation, and Quantum Machine Learning Framework},
+  author = {Raunak Kumar Gupta},
   year = {2026},
   url = {https://github.com/Raunakg2005/quantum-debugger}
 }
@@ -511,5 +511,5 @@ If you use quantum-debugger in your research, please cite:
 
 ---
 
-**Version:** 1.0.0 (latest on PyPI) · 0.9.1, 0.9.0, 0.8.0 (previous)  
+**Version:** 1.0.1 (latest on PyPI) · 1.0.0, 0.9.1, 0.9.0 (previous)  
 **Last Updated:** September 2026

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/README.md

@@ -411,8 +411,8 @@ If you use quantum-debugger in your research, please cite:
 
 ```bibtex
 @software{quantum_debugger_2026,
-  title = {Quantum Debugger: Production-Grade Quantum Machine Learning Library},
-  author = {Gupta, Raunak Kumar},
+  title = {Quantum Debugger: Interactive Circuit Debugging, Multi-Engine Simulation, and Quantum Machine Learning Framework},
+  author = {Raunak Kumar Gupta},
   year = {2026},
   url = {https://github.com/Raunakg2005/quantum-debugger}
 }
@@ -436,5 +436,5 @@ If you use quantum-debugger in your research, please cite:
 
 ---
 
-**Version:** 1.0.0 (latest on PyPI) · 0.9.1, 0.9.0, 0.8.0 (previous)  
+**Version:** 1.0.1 (latest on PyPI) · 1.0.0, 0.9.1, 0.9.0 (previous)  
 **Last Updated:** September 2026

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/quantum_debugger/__init__.py

@@ -13,7 +13,7 @@ Features:
 - Hardware profile support
 """
 
-__version__ = "1.0.0"
+__version__ = "1.0.1"
 __author__ = "Raunak Kumar Gupta"
 __license__ = "MIT"
 

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/quantum_debugger/algorithms/tebd.py

@@ -22,7 +22,9 @@ _Z = np.array([[1, 0], [0, -1]], dtype=complex)
 _I = np.eye(2, dtype=complex)
 
 
-def tfim_bond_gate(n: int, i: int, dt: float, j_coupling: float, field: float) -> np.ndarray:
+def tfim_bond_gate(
+    n: int, i: int, dt: float, j_coupling: float, field: float
+) -> np.ndarray:
     """
     Two-site Trotter gate ``exp(-i h_{i,i+1} dt)`` for the transverse-field Ising model
     ``H = -J sum Z Z - h sum X`` on a chain of ``n`` sites. The single-site field is
@@ -31,15 +33,20 @@ def tfim_bond_gate(n: int, i: int, dt: float, j_coupling: float, field: float) -
     hx_i = field * (0.5 if i > 0 else 1.0)
     hx_j = field * (0.5 if i < n - 2 else 1.0)
     h_local = (
-        -j_coupling * np.kron(_Z, _Z)
-        - hx_i * np.kron(_I, _X)
-        - hx_j * np.kron(_X, _I)
+        -j_coupling * np.kron(_Z, _Z) - hx_i * np.kron(_I, _X) - hx_j * np.kron(_X, _I)
     )
     return expm(-1j * h_local * dt)
 
 
-def tebd_tfim(n: int, time: float, steps: int = 100, j_coupling: float = 1.0,
-              field: float = 1.0, max_bond: int = 16, initial: "MPS" = None) -> "MPS":
+def tebd_tfim(
+    n: int,
+    time: float,
+    steps: int = 100,
+    j_coupling: float = 1.0,
+    field: float = 1.0,
+    max_bond: int = 16,
+    initial: "MPS" = None,
+) -> "MPS":
     """
     Evolve a TFIM chain of ``n`` sites for total ``time`` with ``steps`` Trotter steps,
     on an MPS truncated to ``max_bond``. Starts from ``|0...0>`` unless an ``initial``
@@ -77,16 +84,19 @@ def _imag_bond_gate(n, i, dtau, j_coupling, field):
     hx_i = field * (0.5 if i > 0 else 1.0)
     hx_j = field * (0.5 if i < n - 2 else 1.0)
     h_local = (
-        -j_coupling * np.kron(_Z, _Z)
-        - hx_i * np.kron(_I, _X)
-        - hx_j * np.kron(_X, _I)
+        -j_coupling * np.kron(_Z, _Z) - hx_i * np.kron(_I, _X) - hx_j * np.kron(_X, _I)
     )
     return expm(-h_local * dtau)  # imaginary time -> real exponential (cooling)
 
 
-def imaginary_tebd_ground_state(n: int, j_coupling: float = 1.0, field: float = 1.0,
-                                dtau: float = 0.05, steps: int = 300,
-                                max_bond: int = 16) -> dict:
+def imaginary_tebd_ground_state(
+    n: int,
+    j_coupling: float = 1.0,
+    field: float = 1.0,
+    dtau: float = 0.05,
+    steps: int = 300,
+    max_bond: int = 16,
+) -> dict:
     """
     Find the TFIM ground state of an ``n``-site chain by imaginary-time TEBD -- apply
     ``e^{-h_{j,j+1} dtau}`` bond gates (cooling), renormalizing each step, until the
@@ -124,8 +134,14 @@ def imaginary_tebd_ground_state(n: int, j_coupling: float = 1.0, field: float =
     return result
 
 
-def tebd_magnetization(n: int, time: float, steps: int = 100, j_coupling: float = 1.0,
-                       field: float = 1.0, max_bond: int = 16) -> dict:
+def tebd_magnetization(
+    n: int,
+    time: float,
+    steps: int = 100,
+    j_coupling: float = 1.0,
+    field: float = 1.0,
+    max_bond: int = 16,
+) -> dict:
     """
     Quench a TFIM chain from the all-up state and read out the transverse magnetization.
 

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/quantum_debugger/mpo.py

@@ -30,9 +30,9 @@ def tfim_mpo(n: int, j_coupling: float = 1.0, field: float = 1.0) -> list:
     tensors = []
     for i in range(n):
         if i == 0:
-            tensors.append(W[2:3, :, :, :])   # left boundary row
+            tensors.append(W[2:3, :, :, :])  # left boundary row
         elif i == n - 1:
-            tensors.append(W[:, :, :, 0:1])   # right boundary column
+            tensors.append(W[:, :, :, 0:1])  # right boundary column
         else:
             tensors.append(W)
     return tensors
@@ -71,8 +71,8 @@ def mpo_expectation(mps, mpo) -> float:
     """
     E = np.ones((1, 1, 1), dtype=complex)  # (bra bond, mpo bond, ket bond)
     for A, W in zip(mps.tensors, mpo):
-        E = np.einsum("lmn,nSr->lmSr", E, A)        # absorb ket tensor
-        E = np.einsum("lmSr,mSTw->lTrw", E, W)      # apply operator tensor
+        E = np.einsum("lmn,nSr->lmSr", E, A)  # absorb ket tensor
+        E = np.einsum("lmSr,mSTw->lTrw", E, W)  # apply operator tensor
         E = np.einsum("lTrw,lTb->wrb", E, np.conj(A))  # absorb bra tensor
         E = E.transpose(2, 0, 1)
     return float(np.real(E[0, 0, 0]))
@@ -93,5 +93,9 @@ def mpo_to_matrix(mpo) -> np.ndarray:
     M = T.reshape(dim, dim)
     # little-endian reordering to match the rest of the library
     perm = list(range(n - 1, -1, -1))
-    Mt = M.reshape([2] * (2 * n)).transpose(perm + [n + p for p in perm]).reshape(dim, dim)
+    Mt = (
+        M.reshape([2] * (2 * n))
+        .transpose(perm + [n + p for p in perm])
+        .reshape(dim, dim)
+    )
     return Mt

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/quantum_debugger/mps.py

@@ -74,7 +74,9 @@ class MPS:
         return mps
 
     @classmethod
-    def from_statevector(cls, state_vector, max_bond: int = None, tol: float = 1e-12) -> "MPS":
+    def from_statevector(
+        cls, state_vector, max_bond: int = None, tol: float = 1e-12
+    ) -> "MPS":
         """
         Exact MPS for a dense ``state_vector`` via sequential SVD (truncated to
         ``max_bond`` if given). Qubit ``i`` becomes site ``i`` (little-endian).
@@ -130,8 +132,8 @@ class MPS:
         E = np.ones((1, 1), dtype=complex)  # (bra bond, ket bond)
         for i, A in enumerate(self.tensors):
             Op = ops.get(i, eye)
-            tmp = np.einsum("lm,msr->lsr", E, A)          # ket contracted
-            tmp = np.einsum("ts,lsr->ltr", Op, tmp)       # apply operator
+            tmp = np.einsum("lm,msr->lsr", E, A)  # ket contracted
+            tmp = np.einsum("ts,lsr->ltr", Op, tmp)  # apply operator
             E = np.einsum("lta,ltr->ar", np.conj(A), tmp)  # bra contracted
         return complex(E[0, 0])
 
@@ -169,7 +171,7 @@ class MPS:
         U, S, Vh = np.linalg.svd(mat, full_matrices=False)
         keep = S > 1e-14
         if self.max_bond is not None:
-            keep[self.max_bond:] = False
+            keep[self.max_bond :] = False
         U, S, Vh = U[:, keep], S[keep], Vh[keep, :]
         chi_new = len(S)
         self.tensors[i] = U.reshape(chi_l, 2, chi_new)
@@ -240,7 +242,9 @@ class MPS:
         n = len(T)
         for i in range(n - 1, 0, -1):
             chi_l, d, chi_r = T[i].shape
-            U, S, Vh = np.linalg.svd(T[i].reshape(chi_l, d * chi_r), full_matrices=False)
+            U, S, Vh = np.linalg.svd(
+                T[i].reshape(chi_l, d * chi_r), full_matrices=False
+            )
             T[i] = Vh.reshape(len(S), d, chi_r)
             T[i - 1] = np.tensordot(T[i - 1], U * S, axes=(2, 0))
 
@@ -248,7 +252,9 @@ class MPS:
         carry = T[0]
         for i in range(n - 1):
             chi_l, d, chi_r = carry.shape
-            U, S, Vh = np.linalg.svd(carry.reshape(chi_l * d, chi_r), full_matrices=False)
+            U, S, Vh = np.linalg.svd(
+                carry.reshape(chi_l * d, chi_r), full_matrices=False
+            )
             S = S / np.linalg.norm(S)
             s2 = S**2
             s2 = s2[s2 > 1e-14]
@@ -325,8 +331,10 @@ class MPS:
         Two-point correlation ``<psi| O_a O_b |psi>`` for single-qubit operators on
         ``qubit_a`` and ``qubit_b`` (contraction, no dense state).
         """
-        ops = {qubit_a: np.asarray(obs_a, dtype=complex),
-               qubit_b: np.asarray(obs_b, dtype=complex)}
+        ops = {
+            qubit_a: np.asarray(obs_a, dtype=complex),
+            qubit_b: np.asarray(obs_b, dtype=complex),
+        }
         return float(np.real(self._environment_scan(ops) / self._environment_scan({})))
 
     # --- operators & reduced states ----------------------------------------
@@ -418,6 +426,7 @@ class MPS:
         Quantum mutual information ``I(a:b) = S(a) + S(b) - S(ab)`` between two qubits
         (bits), from their reduced density matrices -- total correlation across the pair.
         """
+
         def vn(rho):
             vals = np.linalg.eigvalsh(rho).real
             vals = vals[vals > 1e-12]
@@ -487,7 +496,10 @@ class MPS:
         """
         counts = self.sample(shots, seed)
         best = max(counts, key=counts.get)
-        return {"bitstring": best, "probability": self.probability([int(c) for c in best])}
+        return {
+            "bitstring": best,
+            "probability": self.probability([int(c) for c in best]),
+        }
 
     def structure_factor(self, observable, momentum: float) -> float:
         """
@@ -500,7 +512,11 @@ class MPS:
         total = 0.0 + 0j
         for i in range(n):
             for j in range(n):
-                cij = self.expectation(O @ O, i) if i == j else self.correlation(O, i, O, j)
+                cij = (
+                    self.expectation(O @ O, i)
+                    if i == j
+                    else self.correlation(O, i, O, j)
+                )
                 total += np.exp(1j * momentum * (i - j)) * cij
         return float(np.real(total) / n)
 
@@ -531,7 +547,9 @@ class MPS:
         return cls(tensors, max_bond)
 
     @classmethod
-    def random(cls, n: int, bond: int = 4, seed: int = 0, max_bond: int = None) -> "MPS":
+    def random(
+        cls, n: int, bond: int = 4, seed: int = 0, max_bond: int = None
+    ) -> "MPS":
         """
         A random MPS on ``n`` qubits with bond dimension ``bond`` (bonds taper to 1 at
         the ends). Normalized. Useful for testing and benchmarking.
@@ -628,7 +646,10 @@ class MPS:
         Energy variance ``<H^2> - <H>^2`` of a Pauli-sum Hamiltonian ``terms`` -- zero
         iff the MPS is an exact eigenstate (a convergence check for DMRG/imaginary TEBD).
         """
-        from .algorithms.hamiltonian_simulation import hamiltonian_matrix, pauli_decompose
+        from .algorithms.hamiltonian_simulation import (
+            hamiltonian_matrix,
+            pauli_decompose,
+        )
 
         H = hamiltonian_matrix(terms, self.n)
         H2_terms = pauli_decompose(H @ H)
@@ -654,13 +675,17 @@ class MPS:
         n = len(T)
         for i in range(n - 1, 0, -1):
             chi_l, d, chi_r = T[i].shape
-            U, S, Vh = np.linalg.svd(T[i].reshape(chi_l, d * chi_r), full_matrices=False)
+            U, S, Vh = np.linalg.svd(
+                T[i].reshape(chi_l, d * chi_r), full_matrices=False
+            )
             T[i] = Vh.reshape(len(S), d, chi_r)
             T[i - 1] = np.tensordot(T[i - 1], U * S, axes=(2, 0))
         carry = T[0]
         for i in range(n - 1):
             chi_l, d, chi_r = carry.shape
-            U, S, Vh = np.linalg.svd(carry.reshape(chi_l * d, chi_r), full_matrices=False)
+            U, S, Vh = np.linalg.svd(
+                carry.reshape(chi_l * d, chi_r), full_matrices=False
+            )
             S = S / np.linalg.norm(S)
             if i == bond:
                 return S**2

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/quantum_debugger.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: quantum-debugger
-Version: 1.0.0
+Version: 1.0.1
 Summary: A quantum simulation and debugging toolkit: state-vector, Clifford/stabilizer, and density-matrix (open-systems) engines, with a broad algorithm library, error correction under noise, quantum machine learning, GPU acceleration, and multi-framework support (Qiskit, PennyLane, Cirq, TensorFlow, PyTorch).
 Home-page: https://github.com/Raunakg2005/quantum-debugger
 Author: Raunak Kumar Gupta
@@ -486,8 +486,8 @@ If you use quantum-debugger in your research, please cite:
 
 ```bibtex
 @software{quantum_debugger_2026,
-  title = {Quantum Debugger: Production-Grade Quantum Machine Learning Library},
-  author = {Gupta, Raunak Kumar},
+  title = {Quantum Debugger: Interactive Circuit Debugging, Multi-Engine Simulation, and Quantum Machine Learning Framework},
+  author = {Raunak Kumar Gupta},
   year = {2026},
   url = {https://github.com/Raunakg2005/quantum-debugger}
 }
@@ -511,5 +511,5 @@ If you use quantum-debugger in your research, please cite:
 
 ---
 
-**Version:** 1.0.0 (latest on PyPI) · 0.9.1, 0.9.0, 0.8.0 (previous)  
+**Version:** 1.0.1 (latest on PyPI) · 1.0.0, 0.9.1, 0.9.0 (previous)  
 **Last Updated:** September 2026

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/tests/test_imaginary_tebd.py

@@ -31,7 +31,9 @@ class TestGroundState:
     def test_deep_paramagnet(self):
         # Large field: ground state ~ |+...+>, energy ~ -h * n.
         n, h = 6, 5.0
-        r = imaginary_tebd_ground_state(n, j_coupling=0.2, field=h, dtau=0.02, steps=400)
+        r = imaginary_tebd_ground_state(
+            n, j_coupling=0.2, field=h, dtau=0.02, steps=400
+        )
         assert r["error"] < 1e-2
 
 
@@ -39,15 +41,22 @@ class TestScale:
     def test_large_chain(self):
         # 24-qubit ground state -- beyond the dense diagonalizer.
         r = imaginary_tebd_ground_state(24, 1.0, 1.0, dtau=0.05, steps=150, max_bond=12)
-        assert "exact_energy" not in r          # too big to diagonalize
-        assert r["energy"] < 0                   # ferromagnetic-ish, negative
+        assert "exact_energy" not in r  # too big to diagonalize
+        assert r["energy"] < 0  # ferromagnetic-ish, negative
         assert r["bond"] <= 12
 
     def test_extensive_energy(self):
         # Ground energy per site is roughly constant (extensivity).
-        e12 = imaginary_tebd_ground_state(12, 1.0, 1.0, dtau=0.05, steps=200)["energy"] / 12
-        e20 = imaginary_tebd_ground_state(20, 1.0, 1.0, dtau=0.05, steps=200,
-                                          max_bond=16)["energy"] / 20
+        e12 = (
+            imaginary_tebd_ground_state(12, 1.0, 1.0, dtau=0.05, steps=200)["energy"]
+            / 12
+        )
+        e20 = (
+            imaginary_tebd_ground_state(
+                20, 1.0, 1.0, dtau=0.05, steps=200, max_bond=16
+            )["energy"]
+            / 20
+        )
         assert abs(e12 - e20) < 0.1
 
 

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/tests/test_mpo.py

@@ -38,7 +38,13 @@ class TestMPOExpectation:
         psi = psi / np.linalg.norm(psi)
         H = hamiltonian_matrix(tfim_hamiltonian(n, 0.7, 1.0), n)
         m = MPS.from_statevector(psi, max_bond=16)
-        assert abs(mpo_expectation(m, tfim_mpo(n, 1.0, 0.7)) - np.real(psi.conj() @ H @ psi)) < 1e-9
+        assert (
+            abs(
+                mpo_expectation(m, tfim_mpo(n, 1.0, 0.7))
+                - np.real(psi.conj() @ H @ psi)
+            )
+            < 1e-9
+        )
 
     def test_large_ghz(self):
         n = 30

{quantum_debugger-1.0.0 → quantum_debugger-1.0.1}/tests/test_mps.py

@@ -105,7 +105,7 @@ class TestScale:
         assert m.max_bond_dimension() == 2
         assert abs(m.norm() - 1.0) < 1e-9
         assert abs(m.correlation(_Z, 0, _Z, n - 1) - 1.0) < 1e-9  # perfectly correlated
-        assert abs(m.expectation(_X, 0)) < 1e-9                    # <X> = 0
+        assert abs(m.expectation(_X, 0)) < 1e-9  # <X> = 0
 
     def test_product_circuit_stays_bond_one(self):
         n = 50
@@ -174,7 +174,6 @@ class TestSampling:
         assert sum(m.sample(137, seed=3).values()) == 137
 
 
-
 class TestEntanglementEntropy:
     def test_matches_dense(self):
         from quantum_debugger.density_matrix import DensityMatrix
@@ -220,20 +219,25 @@ class TestEntanglementEntropy:
         assert len(ent) == n - 1
         assert all(abs(s - 1.0) < 1e-9 for s in ent)
 
+
 class TestOverlapFidelity:
     def test_overlap_matches_dense(self):
         rng = np.random.default_rng(0)
         n = 4
-        a = rng.normal(size=2**n) + 1j * rng.normal(size=2**n); a /= np.linalg.norm(a)
-        b = rng.normal(size=2**n) + 1j * rng.normal(size=2**n); b /= np.linalg.norm(b)
+        a = rng.normal(size=2**n) + 1j * rng.normal(size=2**n)
+        a /= np.linalg.norm(a)
+        b = rng.normal(size=2**n) + 1j * rng.normal(size=2**n)
+        b /= np.linalg.norm(b)
         ov = MPS.from_statevector(a).overlap(MPS.from_statevector(b))
         assert abs(ov - np.vdot(b, a)) < 1e-9
 
     def test_fidelity_matches_dense(self):
         rng = np.random.default_rng(1)
         n = 4
-        a = rng.normal(size=2**n) + 1j * rng.normal(size=2**n); a /= np.linalg.norm(a)
-        b = rng.normal(size=2**n) + 1j * rng.normal(size=2**n); b /= np.linalg.norm(b)
+        a = rng.normal(size=2**n) + 1j * rng.normal(size=2**n)
+        a /= np.linalg.norm(a)
+        b = rng.normal(size=2**n) + 1j * rng.normal(size=2**n)
+        b /= np.linalg.norm(b)
         fid = MPS.from_statevector(a).fidelity(MPS.from_statevector(b))
         assert abs(fid - abs(np.vdot(b, a)) ** 2) < 1e-9
 
@@ -244,8 +248,9 @@ class TestOverlapFidelity:
         assert abs(m.fidelity(m) - 1.0) < 1e-9
 
     def test_orthogonal_states_zero_overlap(self):
-        a = MPS.zero_state(3)              # |000>
-        b = MPS.zero_state(3); b.apply_single(_X, 0)  # |001>
+        a = MPS.zero_state(3)  # |000>
+        b = MPS.zero_state(3)
+        b.apply_single(_X, 0)  # |001>
         assert abs(a.overlap(b)) < 1e-12
 
     def test_large_ghz_self_fidelity(self):
@@ -260,6 +265,7 @@ class TestOverlapFidelity:
         with pytest.raises(ValueError):
             MPS.zero_state(3).overlap(MPS.zero_state(4))
 
+
 class TestLongRangeGates:
     @pytest.mark.parametrize("a,b", [(0, 2), (0, 4), (1, 3), (0, 3)])
     def test_matches_state_vector(self, a, b):
@@ -277,7 +283,8 @@ class TestLongRangeGates:
 
     def test_adjacent_delegates(self):
         rng = np.random.default_rng(0)
-        psi = rng.normal(size=16) + 1j * rng.normal(size=16); psi /= np.linalg.norm(psi)
+        psi = rng.normal(size=16) + 1j * rng.normal(size=16)
+        psi /= np.linalg.norm(psi)
         m = MPS.from_statevector(psi)
         m.apply_two_long_range(_CNOT, 1, 2)
         ref = apply_gate_tensor(np, psi, _CNOT, [1, 2], 4)
@@ -294,23 +301,34 @@ class TestLongRangeGates:
         with pytest.raises(ValueError):
             MPS.zero_state(4).apply_two_long_range(_CNOT, 3, 1)
 
+
 class TestFromCircuit:
     def test_matches_state_vector(self):
         from quantum_debugger.core.circuit import QuantumCircuit
 
         qc = QuantumCircuit(5)
-        qc.h(0); qc.cnot(0, 1); qc.cnot(3, 1); qc.x(2)
-        qc.cnot(4, 2); qc.h(3); qc.cnot(2, 0)
+        qc.h(0)
+        qc.cnot(0, 1)
+        qc.cnot(3, 1)
+        qc.x(2)
+        qc.cnot(4, 2)
+        qc.h(3)
+        qc.cnot(2, 0)
         m = MPS.from_circuit(qc, max_bond=32)
-        assert np.allclose(m.to_statevector(), qc.get_statevector().state_vector, atol=1e-9)
+        assert np.allclose(
+            m.to_statevector(), qc.get_statevector().state_vector, atol=1e-9
+        )
 
     def test_reversed_cnot(self):
         from quantum_debugger.core.circuit import QuantumCircuit
 
         qc = QuantumCircuit(3)
-        qc.x(2); qc.cnot(2, 0)  # control > target
+        qc.x(2)
+        qc.cnot(2, 0)  # control > target
         m = MPS.from_circuit(qc)
-        assert np.allclose(m.to_statevector(), qc.get_statevector().state_vector, atol=1e-9)
+        assert np.allclose(
+            m.to_statevector(), qc.get_statevector().state_vector, atol=1e-9
+        )
 
     def test_ghz_circuit_bond_two(self):
         from quantum_debugger.core.circuit import QuantumCircuit
@@ -331,6 +349,7 @@ class TestFromCircuit:
         with pytest.raises(NotImplementedError):
             MPS.from_circuit(qc)
 
+
 class TestPauliExpectation:
     def test_matches_dense_all_strings(self):
         from quantum_debugger.algorithms import pauli_term_matrix
@@ -352,7 +371,7 @@ class TestPauliExpectation:
         m.apply_single(_H, 0)
         for q in range(n - 1):
             m.apply_two(_CNOT, q)
-        assert abs(m.expectation_pauli("X" * n) - 1.0) < 1e-9        # X^n stabilizes GHZ
+        assert abs(m.expectation_pauli("X" * n) - 1.0) < 1e-9  # X^n stabilizes GHZ
         assert abs(m.expectation_pauli("Z" + "I" * (n - 2) + "Z") - 1.0) < 1e-9
 
     def test_identity_string_is_one(self):
@@ -360,6 +379,7 @@ class TestPauliExpectation:
         m.apply_single(_H, 0)
         assert abs(m.expectation_pauli("IIII") - 1.0) < 1e-9
 
+
 class TestHamiltonianEnergy:
     def test_tfim_energy_matches_dense(self):
         from quantum_debugger.algorithms import hamiltonian_matrix, tfim_hamiltonian
@@ -374,7 +394,10 @@ class TestHamiltonianEnergy:
         assert abs(m.energy(terms) - dense) < 1e-9
 
     def test_hubbard_energy_via_pauli_decompose(self):
-        from quantum_debugger.algorithms import pauli_decompose, fermi_hubbard_hamiltonian
+        from quantum_debugger.algorithms import (
+            pauli_decompose,
+            fermi_hubbard_hamiltonian,
+        )
 
         H = fermi_hubbard_hamiltonian(2, 1.0, 3.0)
         terms = pauli_decompose(H)
@@ -396,6 +419,5 @@ class TestHamiltonianEnergy:
         assert abs(m.energy(tfim_hamiltonian(n, 1.0, 1.0)) - (-(n - 1))) < 1e-9
 
 
-
 if __name__ == "__main__":
     pytest.main([__file__, "-v"])