tequila-basic 1.9.9__py3-none-any.whl → 1.9.10__py3-none-any.whl

tequila/grouping/binary_rep.py

@@ -1,17 +1,27 @@
 from tequila import TequilaException
 from tequila.hamiltonian import QubitHamiltonian, PauliString
-from tequila.grouping.binary_utils import get_lagrangian_subspace, binary_symplectic_inner_product, binary_solve, binary_phase, gen_single_qubit_term, largest_first, recursive_largest_first, sorted_insertion_grouping
+from tequila.grouping.binary_utils import (
+    get_lagrangian_subspace,
+    binary_symplectic_inner_product,
+    binary_solve,
+    binary_phase,
+    gen_single_qubit_term,
+    largest_first,
+    recursive_largest_first,
+    sorted_insertion_grouping,
+)
 from tequila.grouping.overlapping_methods import OverlappingGroups, OverlappingAuxiliary, get_opt_sample_size
 import numpy as np
 import tequila as tq
 import numbers
 from copy import deepcopy
 
+
 class BinaryHamiltonian:
     def __init__(self, binary_terms):
-        '''
+        """
         Initiate from a list of Binary Pauli Strings
-        '''
+        """
         self.binary_terms = binary_terms
 
         self.n_qubit = binary_terms[0].get_n_qubit()
@@ -20,21 +30,18 @@ class BinaryHamiltonian:
 
     @classmethod
     def init_from_qubit_hamiltonian(cls, hamiltonian: QubitHamiltonian, n_qubits=None, ignore_const=False):
-        if ignore_const: #Ignore constant term.
+        if ignore_const:  # Ignore constant term.
             Hof = hamiltonian.to_openfermion()
             if () in Hof.terms:
                 del Hof.terms[()]
                 hamiltonian = QubitHamiltonian.from_openfermion(Hof)
         if n_qubits is None:
-            n_qubits = max(hamiltonian.qubits)+1
+            n_qubits = max(hamiltonian.qubits) + 1
         binary_terms = [
-            BinaryPauliString(
-                p.binary(n_qubits).binary,
-                p.binary(n_qubits).coeff) for p in hamiltonian.paulistrings
+            BinaryPauliString(p.binary(n_qubits).binary, p.binary(n_qubits).coeff) for p in hamiltonian.paulistrings
         ]
         return BinaryHamiltonian(binary_terms)
 
-
     def get_binary(self):
         matrix = [p.get_binary() for p in self.binary_terms]
         return matrix
@@ -44,29 +51,28 @@ class BinaryHamiltonian:
         return coeff
 
     def single_qubit_form(self):
-        '''
+        """
         Returns
         ----------
         hamiltonian : BinaryHamiltonian
             The original hamiltonian in qubit-wise commuting form
-        lagrangian_basis : list of BinaryPauliStrings 
+        lagrangian_basis : list of BinaryPauliStrings
             Represents the basis of original Hamiltonian
-        new_basis : list of BinaryPauliStrings 
+        new_basis : list of BinaryPauliStrings
             Represents the basis of new Hamiltonian
-        '''
+        """
         lagrangian_basis = get_lagrangian_subspace(self.get_binary())
         new_basis = self.get_single_qubit_basis(lagrangian_basis)
         lagrangian_basis = [BinaryPauliString(p) for p in lagrangian_basis]
         new_basis = [BinaryPauliString(p) for p in new_basis]
-        qubit_wise_hamiltonian = self.basis_transform(lagrangian_basis,
-                                                      new_basis)
+        qubit_wise_hamiltonian = self.basis_transform(lagrangian_basis, new_basis)
         return qubit_wise_hamiltonian, lagrangian_basis, new_basis
 
     def z_form(self):
-        '''
+        """
         Parameters
         ----------
-        self : BinaryHamiltonian 
+        self : BinaryHamiltonian
             a qubit-wise commuting hamiltonian
 
         Modifies
@@ -78,34 +84,34 @@ class BinaryHamiltonian:
         ----------
         U : QCircuit
             the single qubit transformation that rotates each term to z
-        '''
+        """
         U = tq.QCircuit()
         non_z = {}
         for p in self.binary_terms:
             for qub in range(self.n_qubit):
-                z_data = {qub: 'z'}
+                z_data = {qub: "z"}
                 if p.has_x(qub):
                     p.set_z(qub)
-                    non_z[qub] = 'x'
+                    non_z[qub] = "x"
                 elif p.has_y(qub):
                     p.set_z(qub)
-                    non_z[qub] = 'y'
-        
+                    non_z[qub] = "y"
+
         for qub, term in non_z.items():
             xy_data = {qub: term}
-            z_data = {qub: 'z'}
-            U += tq.gates.ExpPauli(angle = -tq.numpy.pi/2, paulistring=tq.PauliString(z_data))
-            U += tq.gates.ExpPauli(angle = -tq.numpy.pi/2, paulistring=tq.PauliString(xy_data))
-            U += tq.gates.ExpPauli(angle = -tq.numpy.pi/2, paulistring=tq.PauliString(z_data))
+            z_data = {qub: "z"}
+            U += tq.gates.ExpPauli(angle=-tq.numpy.pi / 2, paulistring=tq.PauliString(z_data))
+            U += tq.gates.ExpPauli(angle=-tq.numpy.pi / 2, paulistring=tq.PauliString(xy_data))
+            U += tq.gates.ExpPauli(angle=-tq.numpy.pi / 2, paulistring=tq.PauliString(z_data))
 
         return U
 
-    def get_qubit_wise(self, binary = False):
-        '''
+    def get_qubit_wise(self, binary=False):
+        """
         Return the qubit-wise form of the current binary hamiltonian.
-        And the unitary transformation U, 
+        And the unitary transformation U,
         where U = prod_i (1/2) ** (1/2) * (lagrangian_basis[i] + new_basis[i])
-        
+
         Parameters
         ----------
         binary : determines whether the returned qwc hamiltonian is binary or qubit hamiltonian
@@ -117,14 +123,13 @@ class BinaryHamiltonian:
             The original hamiltonian in qubit-wise commuting form
         U : QCircuit
             The unitary circuit that transforms the original hamiltonian into qwc form
-        '''
+        """
         if not self.is_commuting():
-            raise TequilaException(
-                'Not all terms in the Hamiltonians are commuting.')
+            raise TequilaException("Not all terms in the Hamiltonians are commuting.")
         if self.is_qubit_wise_commuting():
             qubit_wise_hamiltonian = self
             qwc_u = tq.QCircuit()
-        else: 
+        else:
             qubit_wise_hamiltonian, lagrangian_basis, new_basis = self.single_qubit_form()
 
             # Constructing the unitary that rotates into qubit-wise parts
@@ -132,10 +137,10 @@ class BinaryHamiltonian:
             for i in range(len(lagrangian_basis)):
                 sigma = lagrangian_basis[i].to_pauli_strings()
                 tau = new_basis[i].to_pauli_strings()
-                qwc_u += tq.gates.ExpPauli(angle=-tq.numpy.pi/2, paulistring=sigma)
-                qwc_u += tq.gates.ExpPauli(angle=-tq.numpy.pi/2, paulistring=tau)
-                qwc_u += tq.gates.ExpPauli(angle=-tq.numpy.pi/2, paulistring=sigma)
-        
+                qwc_u += tq.gates.ExpPauli(angle=-tq.numpy.pi / 2, paulistring=sigma)
+                qwc_u += tq.gates.ExpPauli(angle=-tq.numpy.pi / 2, paulistring=tau)
+                qwc_u += tq.gates.ExpPauli(angle=-tq.numpy.pi / 2, paulistring=sigma)
+
         single_qub_u = qubit_wise_hamiltonian.z_form()
         # Return the basis in terms of Binary Hamiltonian
         if binary:
@@ -144,10 +149,10 @@ class BinaryHamiltonian:
             return qubit_wise_hamiltonian.to_qubit_hamiltonian(), qwc_u + single_qub_u
 
     def get_single_qubit_basis(self, lagrangian_basis):
-        '''
+        """
         Find the single_qubit_basis such that single_qubit_basis[i] anti-commutes
-        with lagrangian_basis[i], and commute for all other cases. 
-        '''
+        with lagrangian_basis[i], and commute for all other cases.
+        """
         dim = len(lagrangian_basis)
 
         # Free Qubits
@@ -155,46 +160,42 @@ class BinaryHamiltonian:
         pair = []
 
         for i in range(dim):
-            cur_pair = self.find_single_qubit_pair(lagrangian_basis[i],
-                                                   free_qub)
+            cur_pair = self.find_single_qubit_pair(lagrangian_basis[i], free_qub)
             for j in range(dim):
                 if i != j:
-                    if binary_symplectic_inner_product(
-                            cur_pair, lagrangian_basis[j] == 1):
-                        lagrangian_basis[j] = (lagrangian_basis[i] +
-                                               lagrangian_basis[j]) % 2
+                    if binary_symplectic_inner_product(cur_pair, lagrangian_basis[j] == 1):
+                        lagrangian_basis[j] = (lagrangian_basis[i] + lagrangian_basis[j]) % 2
             pair.append(cur_pair)
         return pair
 
     def find_single_qubit_pair(self, cur_basis, free_qub):
-        '''
-        Find the single qubit pair that anti-commute with cur_basis such that the single qubit is in free_qub 
+        """
+        Find the single qubit pair that anti-commute with cur_basis such that the single qubit is in free_qub
 
         Return: Binary vectors representing the single qubit pair
         Modify: Pops the qubit used from free_qub
-        '''
+        """
         dim = len(cur_basis) // 2
         for idx, qub in enumerate(free_qub):
             for term in range(3):
                 pair = gen_single_qubit_term(dim, qub, term)
                 # if anticommute
-                if (binary_symplectic_inner_product(pair, cur_basis) == 1):
+                if binary_symplectic_inner_product(pair, cur_basis) == 1:
                     free_qub.pop(idx)
                     return pair
 
     def basis_transform(self, old, new):
-        '''
+        """
         Transforms the given hamiltonian from the old basis to the new basis.
-        
+
         Return: The transformed Binary hamiltonian
-        '''
-        return BinaryHamiltonian(
-            [p.basis_transform(old, new) for p in self.binary_terms])
+        """
+        return BinaryHamiltonian([p.basis_transform(old, new) for p in self.binary_terms])
 
     def is_commuting(self):
-        '''
+        """
         Return whether all terms in the Hamiltonian are commuting
-        '''
+        """
         for i in range(self.n_term):
             for j in range(i + 1, self.n_term):
                 if not self.binary_terms[i].commute(self.binary_terms[j]):
@@ -202,15 +203,15 @@ class BinaryHamiltonian:
         return True
 
     def is_qubit_wise_commuting(self):
-        '''
-        Return whether all terms in the Hamiltonian are qubit-wise commuting 
-        '''
+        """
+        Return whether all terms in the Hamiltonian are qubit-wise commuting
+        """
         # Keep a dictionary of qubit-wise term found
         qubit_term = {}
         for i in range(self.n_term):
             for qub in range(self.n_qubit):
                 cur_binary_term = self.binary_terms[i].get_binary()
-                cur_qub_term = (cur_binary_term[qub], cur_binary_term[qub+self.n_qubit])
+                cur_qub_term = (cur_binary_term[qub], cur_binary_term[qub + self.n_qubit])
                 if cur_qub_term != (0, 0):
                     if qub not in qubit_term:
                         qubit_term[qub] = cur_qub_term
@@ -218,13 +219,11 @@ class BinaryHamiltonian:
                         if not qubit_term[qub] == cur_qub_term:
                             return False
         return True
-                
 
     def to_qubit_hamiltonian(self):
         qub_ham = QubitHamiltonian()
         for p in self.binary_terms:
-            qub_ham += QubitHamiltonian.from_paulistrings(
-                p.to_pauli_strings())
+            qub_ham += QubitHamiltonian.from_paulistrings(p.to_pauli_strings())
         return qub_ham
 
     def anti_commutativity_matrix(self):
@@ -234,7 +233,7 @@ class BinaryHamiltonian:
         """
         n = self.n_qubit
         matrix = np.array(self.get_binary())
-        gram = np.block([[np.zeros((n,n)), np.eye(n)], [np.eye(n), np.zeros((n,n))]])
+        gram = np.block([[np.zeros((n, n)), np.eye(n)], [np.eye(n), np.zeros((n, n))]])
         return matrix @ gram @ matrix.T % 2
 
     def commuting_groups(self, options=None):
@@ -246,11 +245,11 @@ class BinaryHamiltonian:
         Parameters
         ----------
         options: dictionary: Dictionary containing user-defined parameters:
-            key: method, val: 'lf' [largest first J. Chem. Phys. 152, 124114 (2020)], 'rlf' [recursive largest first J. Chem. Phys. 152, 124114 (2020)], 
+            key: method, val: 'lf' [largest first J. Chem. Phys. 152, 124114 (2020)], 'rlf' [recursive largest first J. Chem. Phys. 152, 124114 (2020)],
                               'si' [sorted insertion Quantum 5, 385 (2021)], 'ics' [iterative coefficient splitting npj Quantum Inf. 9, 14 (2023)]
             key: condition, val: 'fc' (fully commuting Pauli products are measured together)
                                  'qwc' (qubit-wise commuting Pauli products are measured together)
-            key: cov_dict, val: Dictionary containing {(binary_tuple of pw1, binary_tuple of pw2) : Cov (pw1, pw2)}. 
+            key: cov_dict, val: Dictionary containing {(binary_tuple of pw1, binary_tuple of pw2) : Cov (pw1, pw2)}.
                                 Only covariances for [pw1,pw2]=0 are necessary. This dictionary is necessary for ics.
                                 For other methods, if cov_dict is given, the optimal allocation of samples will be returned.
             key: n_iter, val: integer number of iterations in ics.
@@ -259,18 +258,21 @@ class BinaryHamiltonian:
         ----------
         List of BinaryHamiltonian's
         """
+
         def process_options(options):
-            method = 'rlf' # Method used for Hamiltonian partitioning.
-            condition = 'fc' # Commutativitiy condition within a group; either fully commuting (fc) or qubit-wise commuting (qwc).
-            sample_suggestion = False # Whether to return suggested ratio of samples between groups.
-            overlap_aux = None # Help variable for overlapping methods.
+            method = "rlf"  # Method used for Hamiltonian partitioning.
+            condition = "fc"  # Commutativitiy condition within a group; either fully commuting (fc) or qubit-wise commuting (qwc).
+            sample_suggestion = False  # Whether to return suggested ratio of samples between groups.
+            overlap_aux = None  # Help variable for overlapping methods.
             if options is not None:
-                if "method" in options: method=options["method"]
-                if "condition" in options: condition=options["condition"]
+                if "method" in options:
+                    method = options["method"]
+                if "condition" in options:
+                    condition = options["condition"]
 
                 # If cov_dict is given in options, use the user-defined covariance dictionary.
-                if "cov_dict" in options: 
-                    sample_suggestion = True #Suggested sample size can be given whenever covariances are present.
+                if "cov_dict" in options:
+                    sample_suggestion = True  # Suggested sample size can be given whenever covariances are present.
                     if "n_iter" in options:
                         overlap_aux = OverlappingAuxiliary(options["cov_dict"], options["n_iter"])
                     else:
@@ -279,17 +281,20 @@ class BinaryHamiltonian:
                     # (TODO) Compute default HF/CISD covariances if cov_dict is not given.
                     overlap_aux = None
             return method, condition, overlap_aux, sample_suggestion
-    
+
         def method_class(method, condition):
             """
             Return the class that the method belongs to: One from Minimum clique cover (mcc)
-            and Greedy grouping algorithms. 
+            and Greedy grouping algorithms.
             """
-            if (method == 'lf' or method == 'rlf'): 
-                mc = 'mcc' 
-                if condition != "fc": raise TequilaException(f"Combination of options={{method:{method},condition:{condition}}} is not valid. E.g., lf and rlf can only return fully commuting fragments, i.e., condition=fc is necessary.")
-            elif (method == 'si' or method == 'ics'):
-                mc = 'greedy'
+            if method == "lf" or method == "rlf":
+                mc = "mcc"
+                if condition != "fc":
+                    raise TequilaException(
+                        f"Combination of options={{method:{method},condition:{condition}}} is not valid. E.g., lf and rlf can only return fully commuting fragments, i.e., condition=fc is necessary."
+                    )
+            elif method == "si" or method == "ics":
+                mc = "greedy"
             else:
                 raise TequilaException(f"There is not options={{method:{method}}}")
             return mc
@@ -298,33 +303,38 @@ class BinaryHamiltonian:
         n = self.n_term
 
         method, condition, overlap_aux, sample_suggestion = process_options(options)
-        if method_class(method, condition) == 'mcc':
+        if method_class(method, condition) == "mcc":
             cg = self.anti_commutativity_matrix()
-            if method == 'lf':
+            if method == "lf":
                 colors = largest_first(terms, n, cg)
-            elif method == 'rlf':
+            elif method == "rlf":
                 colors = recursive_largest_first(terms, n, cg)
             groups = [value for key, value in colors.items()]
             result = [BinaryHamiltonian(value) for key, value in colors.items()]
-        elif method_class(method, condition) == 'greedy':
-            if method == 'si': groups = sorted_insertion_grouping(terms, condition)
-            if method == 'ics':
-                if overlap_aux == None: raise TequilaException("Overlapping SI grouping requires a dictionary of covariances, call with options={cov_dict:X}, where X is the dictionary.")
+        elif method_class(method, condition) == "greedy":
+            if method == "si":
+                groups = sorted_insertion_grouping(terms, condition)
+            if method == "ics":
+                if overlap_aux is None:
+                    raise TequilaException(
+                        "Overlapping SI grouping requires a dictionary of covariances, call with options={cov_dict:X}, where X is the dictionary."
+                    )
                 o_groups = OverlappingGroups.init_from_binary_terms(terms, condition)
                 groups = o_groups.optimal_overlapping_groups(overlap_aux)
             result = [BinaryHamiltonian(group) for group in groups]
-        
+
         if sample_suggestion:
             suggested_sample_size = get_opt_sample_size(groups, options["cov_dict"])
         else:
             suggested_sample_size = [None] * len(groups)
         return result, suggested_sample_size
 
+
 class BinaryPauliString:
     def __init__(self, binary_vector=np.array([0, 0]), coeff=1.0):
-        '''
-        Stores a list of binary vectors and a list of corresponding coefficients. 
-        '''
+        """
+        Stores a list of binary vectors and a list of corresponding coefficients.
+        """
         self.binary = np.array(binary_vector)
         self.coeff = coeff
         self.n_qubit = len(binary_vector) // 2
@@ -332,85 +342,78 @@ class BinaryPauliString:
         self.is_coeff()
 
     def __eq__(self, other):
-        '''
-        Check if two BinaryPauliStrings are equivalent. 
-        The size of small is chosen arbitrarily. 
-        '''
+        """
+        Check if two BinaryPauliStrings are equivalent.
+        The size of small is chosen arbitrarily.
+        """
         small = 1e-10
         return all(self.binary == other.binary) and (np.abs(self.coeff - other.coeff) <= small)
 
     def binary_tuple(self):
-        '''
+        """
         Return binary vector as a tuple. Useful for cov_dict (see overlapping_methods).
-        '''
+        """
         return tuple(self.binary)
 
     def is_binary(self):
         if not isinstance(self.binary, np.ndarray):
             raise TequilaException(
-                'Unknown representation of binary vector. Got ' +
-                str(self.binary) + ' with type ' + type(self.binary))
+                "Unknown representation of binary vector. Got " + str(self.binary) + " with type " + type(self.binary)
+            )
         if not all([x == 1 or x == 0 for x in self.binary]):
-            raise TequilaException(
-                'Not all number in the binary vector is 0 or 1. Got ' +
-                str(self.binary))
+            raise TequilaException("Not all number in the binary vector is 0 or 1. Got " + str(self.binary))
 
     def is_coeff(self):
         if not isinstance(self.coeff, numbers.Number):
-            raise TequilaException('Unknown coefficients. Got ' +
-                                   str(self.coeff))
+            raise TequilaException("Unknown coefficients. Got " + str(self.coeff))
 
     def qubit_wise_commute(self, other):
-        '''
-        Determine whether the corresponding pauli-strings of 
-        the two binary vectors are qubit-wise commuting. 
-        '''
-        qubit_term = {} #Dictionary of qubit terms in self.
+        """
+        Determine whether the corresponding pauli-strings of
+        the two binary vectors are qubit-wise commuting.
+        """
+        qubit_term = {}  # Dictionary of qubit terms in self.
         for qub in range(self.n_qubit):
-            cur_qub_term = (self.binary[qub], self.binary[qub + self.n_qubit]) 
+            cur_qub_term = (self.binary[qub], self.binary[qub + self.n_qubit])
             if cur_qub_term != (0, 0):
                 qubit_term[qub] = cur_qub_term
 
         for qub in range(other.n_qubit):
-            cur_qub_term = (other.binary[qub], other.binary[qub + self.n_qubit]) 
+            cur_qub_term = (other.binary[qub], other.binary[qub + self.n_qubit])
             if cur_qub_term != (0, 0):
                 if qub in qubit_term:
-                    if qubit_term[qub] != cur_qub_term: return False
+                    if qubit_term[qub] != cur_qub_term:
+                        return False
         return True
 
     def commute(self, other):
-        '''
-        Determine whether the corresponding pauli-strings of 
-        the two binary vectors commute. 
-        '''
-        inner_product = binary_symplectic_inner_product(
-            self.binary, other.binary)
+        """
+        Determine whether the corresponding pauli-strings of
+        the two binary vectors commute.
+        """
+        inner_product = binary_symplectic_inner_product(self.binary, other.binary)
 
         if inner_product == 0:
             return True
         elif inner_product == 1:
             return False
         else:
-            raise TequilaException('Computed unexpected inner product. Got ' +
-                                   str(inner_product))
+            raise TequilaException("Computed unexpected inner product. Got " + str(inner_product))
 
     def basis_transform(self, old, new):
-        '''
+        """
         Transform the pauli string from old to new binary basis.
 
         Return: Pauli string in the new basis.
-        '''
-        old_basis_coeff = binary_solve([p.get_binary() for p in old],
-                                       self.binary)
+        """
+        old_basis_coeff = binary_solve([p.get_binary() for p in old], self.binary)
         original_pauli_vec = np.zeros(self.n_qubit * 2)
         new_pauli_vec = np.zeros(self.n_qubit * 2)
         phase = 1
         for i, i_coeff in enumerate(old_basis_coeff):
             if i_coeff == 1:
-                phase *= binary_phase(original_pauli_vec, old[i].get_binary(),
-                                      self.n_qubit)
-                original_pauli_vec = (original_pauli_vec +
-                                      old[i].get_binary()) % 2
+                phase *= binary_phase(original_pauli_vec, old[i].get_binary(), self.n_qubit)
+                original_pauli_vec = (original_pauli_vec + old[i].get_binary()) % 2
                 new_pauli_vec = (new_pauli_vec + new[i].get_binary()) % 2
 
         new_pauli_str = BinaryPauliString(new_pauli_vec)
@@ -431,37 +434,37 @@ class BinaryPauliString:
 
     def has_z(self, i):
         return self.binary[i] == 0 and self.binary[i + self.n_qubit] == 1
-    
+
     def set_x(self, i):
-        '''
+        """
         Set the ith qubit to having x
-        '''
+        """
         self.binary[i] = 1
         self.binary[i + self.n_qubit] = 0
-    
+
     def set_y(self, i):
-        '''
+        """
         Set the ith qubit to having y
-        '''
+        """
         self.binary[i] = 1
         self.binary[i + self.n_qubit] = 1
 
     def set_z(self, i):
-        '''
+        """
         Set the ith qubit to having z
-        '''
+        """
         self.binary[i] = 0
         self.binary[i + self.n_qubit] = 1
-    
+
     def to_pauli_strings(self):
         data = {}
         for i in range(self.n_qubit):
             if self.has_x(i):
-                data[i] = 'X'
+                data[i] = "X"
             elif self.has_y(i):
-                data[i] = 'Y'
+                data[i] = "Y"
             elif self.has_z(i):
-                data[i] = 'Z'
+                data[i] = "Z"
         return PauliString(data, self.coeff)
 
     def get_coeff(self):
@@ -477,10 +480,9 @@ class BinaryPauliString:
         return self.n_qubit
 
     def term_w_coeff(self, new_coeff):
-        '''
+        """
         Return BinaryPauliString with a new coefficient.
-        '''
+        """
         new_term = deepcopy(self)
         new_term.set_coeff(new_coeff)
         return new_term
-