Remove references to depreciated QasmSimulator

DIRECTORY.md

@@ -27,6 +27,7 @@
   * [Hamiltonian Cycle](backtracking/hamiltonian_cycle.py)
   * [Knight Tour](backtracking/knight_tour.py)
   * [Minimax](backtracking/minimax.py)
+  * [Minmax](backtracking/minmax.py)
   * [N Queens](backtracking/n_queens.py)
   * [N Queens Math](backtracking/n_queens_math.py)
   * [Rat In Maze](backtracking/rat_in_maze.py)
@@ -157,6 +158,7 @@
     * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
     * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
     * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
+    * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
     * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
     * [Inorder Tree Traversal 2022](data_structures/binary_tree/inorder_tree_traversal_2022.py)
     * [Lazy Segment Tree](data_structures/binary_tree/lazy_segment_tree.py)
@@ -601,6 +603,7 @@
   * [Inverse Of Matrix](matrix/inverse_of_matrix.py)
   * [Matrix Class](matrix/matrix_class.py)
   * [Matrix Operation](matrix/matrix_operation.py)
+  * [Max Area Of Island](matrix/max_area_of_island.py)
   * [Nth Fibonacci Using Matrix Exponentiation](matrix/nth_fibonacci_using_matrix_exponentiation.py)
   * [Rotate Matrix](matrix/rotate_matrix.py)
   * [Searching In Sorted Matrix](matrix/searching_in_sorted_matrix.py)

quantum/deutsch_jozsa.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 """
-Deutsch-Josza Algorithm is one of the first examples of a quantum
+Deutsch-Jozsa Algorithm is one of the first examples of a quantum
 algorithm that is exponentially faster than any possible deterministic
 classical algorithm
 
@@ -43,7 +43,7 @@ def dj_oracle(case: str, num_qubits: int) -> q.QuantumCircuit:
         # Next, format 'b' as a binary string of length 'n', padded with zeros:
         b_str = format(b, f"0{num_qubits}b")
         # Next, we place the first X-gates. Each digit in our binary string
-        # correspopnds to a qubit, if the digit is 0, we do nothing, if it's 1
+        # corresponds to a qubit, if the digit is 0, we do nothing, if it's 1
         # we apply an X-gate to that qubit:
         for index, bit in enumerate(b_str):
             if bit == "1":
@@ -72,7 +72,7 @@ def dj_oracle(case: str, num_qubits: int) -> q.QuantumCircuit:
 
 def dj_algorithm(oracle: q.QuantumCircuit, num_qubits: int) -> q.QuantumCircuit:
     """
-    Returns the complete Deustch-Jozsa Quantum Circuit,
+    Returns the complete Deutsch-Jozsa Quantum Circuit,
     adding Input & Output registers and Hadamard & Measurement Gates,
     to the Oracle Circuit passed in arguments
     """
@@ -104,13 +104,13 @@ def deutsch_jozsa(case: str, num_qubits: int) -> q.result.counts.Counts:
     >>> deutsch_jozsa("balanced", 3)
     {'111': 1000}
     """
-    # Use Aer's qasm_simulator
-    simulator = q.Aer.get_backend("qasm_simulator")
+    # Use Aer's simulator
+    simulator = q.Aer.get_backend("aer_simulator")
 
     oracle_gate = dj_oracle(case, num_qubits)
     dj_circuit = dj_algorithm(oracle_gate, num_qubits)
 
-    # Execute the circuit on the qasm simulator
+    # Execute the circuit on the simulator
     job = q.execute(dj_circuit, simulator, shots=1000)
 
     # Return the histogram data of the results of the experiment.

quantum/half_adder.py

@@ -24,8 +24,8 @@ def half_adder(bit0: int, bit1: int) -> q.result.counts.Counts:
     >>> half_adder(1, 1)
     {'10': 1000}
     """
-    # Use Aer's qasm_simulator
-    simulator = q.Aer.get_backend("qasm_simulator")
+    # Use Aer's simulator
+    simulator = q.Aer.get_backend("aer_simulator")
 
     qc_ha = q.QuantumCircuit(4, 2)
     # encode inputs in qubits 0 and 1
@@ -50,7 +50,7 @@ def half_adder(bit0: int, bit1: int) -> q.result.counts.Counts:
     # Execute the circuit on the qasm simulator
     job = q.execute(qc_ha, simulator, shots=1000)
 
-    # Return the histogram data of the results of the experiment.
+    # Return the histogram data of the results of the experiment
     return job.result().get_counts(qc_ha)
 
 

quantum/not_gate.py

@@ -16,8 +16,8 @@ def single_qubit_measure(qubits: int, classical_bits: int) -> q.result.counts.Co
     >>> single_qubit_measure(4, 4)
     {'0011': 1000}
     """
-    # Use Aer's qasm_simulator
-    simulator = q.Aer.get_backend("qasm_simulator")
+    # Use Aer's simulator
+    simulator = q.Aer.get_backend("aer_simulator")
 
     # Create a Quantum Circuit acting on the q register
     circuit = q.QuantumCircuit(qubits, classical_bits)

quantum/q_full_adder.py

@@ -10,13 +10,12 @@
 
 import math
 
-import qiskit
-from qiskit import Aer, ClassicalRegister, QuantumCircuit, QuantumRegister, execute
+import qiskit as q
 
 
 def quantum_full_adder(
     input_1: int = 1, input_2: int = 1, carry_in: int = 1
-) -> qiskit.result.counts.Counts:
+) -> q.result.counts.Counts:
     """
     # >>> q_full_adder(inp_1, inp_2, cin)
     # the inputs can be 0/1 for qubits in define
@@ -38,25 +37,25 @@ def quantum_full_adder(
         carry_in: carry in for the circuit.
     Returns:
         qiskit.result.counts.Counts: sum result counts.
-    >>> quantum_full_adder(1,1,1)
+    >>> quantum_full_adder(1, 1, 1)
     {'11': 1000}
-    >>> quantum_full_adder(0,0,1)
+    >>> quantum_full_adder(0, 0, 1)
     {'01': 1000}
-    >>> quantum_full_adder(1,0,1)
+    >>> quantum_full_adder(1, 0, 1)
     {'10': 1000}
-    >>> quantum_full_adder(1,-4,1)
+    >>> quantum_full_adder(1, -4, 1)
     Traceback (most recent call last):
         ...
     ValueError: inputs must be positive.
-    >>> quantum_full_adder('q',0,1)
+    >>> quantum_full_adder('q', 0, 1)
     Traceback (most recent call last):
         ...
     TypeError: inputs must be integers.
-    >>> quantum_full_adder(0.5,0,1)
+    >>> quantum_full_adder(0.5, 0, 1)
     Traceback (most recent call last):
         ...
     ValueError: inputs must be exact integers.
-    >>> quantum_full_adder(0,1,3)
+    >>> quantum_full_adder(0, 1, 3)
     Traceback (most recent call last):
         ...
     ValueError: inputs must be less or equal to 2.
@@ -78,12 +77,12 @@ def quantum_full_adder(
         raise ValueError("inputs must be less or equal to 2.")
 
     # build registers
-    qr = QuantumRegister(4, "qr")
-    cr = ClassicalRegister(2, "cr")
+    qr = q.QuantumRegister(4, "qr")
+    cr = q.ClassicalRegister(2, "cr")
     # list the entries
     entry = [input_1, input_2, carry_in]
 
-    quantum_circuit = QuantumCircuit(qr, cr)
+    quantum_circuit = q.QuantumCircuit(qr, cr)
 
     for i in range(0, 3):
         if entry[i] == 2:
@@ -102,11 +101,11 @@ def quantum_full_adder(
 
     quantum_circuit.measure([2, 3], cr)  # measure the last two qbits
 
-    backend = Aer.get_backend("qasm_simulator")
-    job = execute(quantum_circuit, backend, shots=1000)
+    backend = q.Aer.get_backend("aer_simulator")
+    job = q.execute(quantum_circuit, backend, shots=1000)
 
     return job.result().get_counts(quantum_circuit)
 
 
 if __name__ == "__main__":
-    print(f"Total sum count for state is: {quantum_full_adder(1,1,1)}")
+    print(f"Total sum count for state is: {quantum_full_adder(1, 1, 1)}")

quantum/quantum_entanglement.py

@@ -8,10 +8,10 @@
 no matter the distance between two particles.
 """
 
-import qiskit
+import qiskit as q
 
 
-def quantum_entanglement(qubits: int = 2) -> qiskit.result.counts.Counts:
+def quantum_entanglement(qubits: int = 2) -> q.result.counts.Counts:
     """
     # >>> quantum_entanglement(2)
     # {'00': 500, '11': 500}
@@ -29,11 +29,11 @@ def quantum_entanglement(qubits: int = 2) -> qiskit.result.counts.Counts:
     """
     classical_bits = qubits
 
-    # Using Aer's qasm_simulator
-    simulator = qiskit.Aer.get_backend("qasm_simulator")
+    # Using Aer's simulator
+    simulator = q.Aer.get_backend("aer_simulator")
 
     # Creating a Quantum Circuit acting on the q register
-    circuit = qiskit.QuantumCircuit(qubits, classical_bits)
+    circuit = q.QuantumCircuit(qubits, classical_bits)
 
     # Adding a H gate on qubit 0 (now q0 in superposition)
     circuit.h(0)
@@ -48,8 +48,8 @@ def quantum_entanglement(qubits: int = 2) -> qiskit.result.counts.Counts:
     # Now measuring any one qubit would affect other qubits to collapse
     # their super position and have same state as the measured one.
 
-    # Executing the circuit on the qasm simulator
-    job = qiskit.execute(circuit, simulator, shots=1000)
+    # Executing the circuit on the simulator
+    job = q.execute(circuit, simulator, shots=1000)
 
     return job.result().get_counts(circuit)
 

quantum/ripple_adder_classic.py

@@ -2,11 +2,11 @@
 # https://en.wikipedia.org/wiki/Adder_(electronics)#Full_adder
 # https://en.wikipedia.org/wiki/Controlled_NOT_gate
 
-from qiskit import Aer, QuantumCircuit, execute
+import qiskit as q
 from qiskit.providers import Backend
 
 
-def store_two_classics(val1: int, val2: int) -> tuple[QuantumCircuit, str, str]:
+def store_two_classics(val1: int, val2: int) -> tuple[q.QuantumCircuit, str, str]:
     """
     Generates a Quantum Circuit which stores two classical integers
     Returns the circuit and binary representation of the integers
@@ -21,10 +21,10 @@ def store_two_classics(val1: int, val2: int) -> tuple[QuantumCircuit, str, str]:
 
     # We need (3 * number of bits in the larger number)+1 qBits
     # The second parameter is the number of classical registers, to measure the result
-    circuit = QuantumCircuit((len(x) * 3) + 1, len(x) + 1)
+    circuit = q.QuantumCircuit((len(x) * 3) + 1, len(x) + 1)
 
     # We are essentially "not-ing" the bits that are 1
-    # Reversed because its easier to perform ops on more significant bits
+    # Reversed because it's easier to perform ops on more significant bits
     for i in range(len(x)):
         if x[::-1][i] == "1":
             circuit.x(i)
@@ -36,7 +36,7 @@ def store_two_classics(val1: int, val2: int) -> tuple[QuantumCircuit, str, str]:
 
 
 def full_adder(
-    circuit: QuantumCircuit,
+    circuit: q.QuantumCircuit,
     input1_loc: int,
     input2_loc: int,
     carry_in: int,
@@ -55,14 +55,14 @@ def full_adder(
 
 # The default value for **backend** is the result of a function call which is not
 # normally recommended and causes flake8-bugbear to raise a B008 error. However,
-# in this case, this is accptable because `Aer.get_backend()` is called when the
+# in this case, this is acceptable because `Aer.get_backend()` is called when the
 # function is defined and that same backend is then reused for all function calls.
 
 
 def ripple_adder(
     val1: int,
     val2: int,
-    backend: Backend = Aer.get_backend("qasm_simulator"),  # noqa: B008
+    backend: Backend = q.Aer.get_backend("aer_simulator"),  # noqa: B008
 ) -> int:
     """
     Quantum Equivalent of a Ripple Adder Circuit
@@ -104,7 +104,7 @@ def ripple_adder(
     for i in range(len(x) + 1):
         circuit.measure([(len(x) * 2) + i], [i])
 
-    res = execute(circuit, backend, shots=1).result()
+    res = q.execute(circuit, backend, shots=1).result()
 
     # The result is in binary. Convert it back to int
     return int(list(res.get_counts())[0], 2)

quantum/single_qubit_measure.py

@@ -14,16 +14,16 @@ def single_qubit_measure(qubits: int, classical_bits: int) -> q.result.counts.Co
     >>> single_qubit_measure(1, 1)
     {'0': 1000}
     """
-    # Use Aer's qasm_simulator
-    simulator = q.Aer.get_backend("qasm_simulator")
+    # Use Aer's simulator
+    simulator = q.Aer.get_backend("aer_simulator")
 
     # Create a Quantum Circuit acting on the q register
     circuit = q.QuantumCircuit(qubits, classical_bits)
 
     # Map the quantum measurement to the classical bits
     circuit.measure([0], [0])
 
-    # Execute the circuit on the qasm simulator
+    # Execute the circuit on the simulator
     job = q.execute(circuit, simulator, shots=1000)
 
     # Return the histogram data of the results of the experiment.