






import qiskit





def        _snake_case   (_snake_case				:       int = 2)					->	qiskit.result.counts.Counts:
   _lowercase              =qubits

   # Using Aer's simulator
   _lowercase              =qiskit.Aer.get_backend('aer_simulator')

   # Creating a Quantum Circuit acting on the q register
   _lowercase              =qiskit.QuantumCircuit(_snake_case      ,    _snake_case)

   # Adding a H gate on qubit 0 (now q0 in superposition)
   circuit.h(0)

   for i in range(1      ,    _snake_case):
      # Adding CX (CNOT) gate
      circuit.cx(i - 1      ,    _snake_case)

   # Mapping the quantum measurement to the classical bits
   circuit.measure(list(range(_snake_case))      ,    list(range(_snake_case)))

   # 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 simulator
   _lowercase              =qiskit.execute(_snake_case      ,    _snake_case      ,    shots=1000)

   return job.result().get_counts(_snake_case)


if __name__ == "__main__":
    print(f'''Total count for various states are: {quantum_entanglement(3)}''')










# Author: OMKAR PATHAK, Nwachukwu Chidiebere

# Use a Python dictionary to construct the graph.
from __future__ import annotations

from pprint import pformat
from typing import Generic, TypeVar

_SCREAMING_SNAKE_CASE   =  TypeVar("T")






class 					SCREAMING_SNAKE_CASE_  (       Generic[T] ):
       """simple docstring"""


       def __init__(				self	:List[Any],      snake_case	:bool = True):



          """simple docstring"""

          _lowercase              ={}  # dictionary of lists
          _lowercase              =directed





       def 				UpperCamelCase__						(				self	:Optional[Any],      snake_case	:T,      snake_case	:T):



          """simple docstring"""

          if not self.directed:  # For undirected graphs
             # if both source vertex and destination vertex are both present in the
             # adjacency list, add destination vertex to source vertex list of adjacent
             # vertices and add source vertex to destination vertex list of adjacent
             # vertices.
             if source_vertex in self.adj_list and destination_vertex in self.adj_list:
                self.adj_list[source_vertex].append(snake_case)
                self.adj_list[destination_vertex].append(snake_case)
             # if only source vertex is present in adjacency list, add destination vertex
             # to source vertex list of adjacent vertices, then create a new vertex with
             # destination vertex as key and assign a list containing the source vertex
             # as it's first adjacent vertex.
             elif source_vertex in self.adj_list:
                self.adj_list[source_vertex].append(snake_case)
                _lowercase              =[source_vertex]
             # if only destination vertex is present in adjacency list, add source vertex
             # to destination vertex list of adjacent vertices, then create a new vertex
             # with source vertex as key and assign a list containing the source vertex
             # as it's first adjacent vertex.
             elif destination_vertex in self.adj_list:
                self.adj_list[destination_vertex].append(snake_case)
                _lowercase              =[destination_vertex]
             # if both source vertex and destination vertex are not present in adjacency
             # list, create a new vertex with source vertex as key and assign a list
             # containing the destination vertex as it's first adjacent vertex also
             # create a new vertex with destination vertex as key and assign a list
             # containing the source vertex as it's first adjacent vertex.
             else:
                _lowercase              =[destination_vertex]
                _lowercase              =[source_vertex]
          else:  # For directed graphs
             # if both source vertex and destination vertex are present in adjacency
             # list, add destination vertex to source vertex list of adjacent vertices.
             if source_vertex in self.adj_list and destination_vertex in self.adj_list:
                self.adj_list[source_vertex].append(snake_case)
             # if only source vertex is present in adjacency list, add destination
             # vertex to source vertex list of adjacent vertices and create a new vertex
             # with destination vertex as key, which has no adjacent vertex
             elif source_vertex in self.adj_list:
                self.adj_list[source_vertex].append(snake_case)
                _lowercase              =[]
             # if only destination vertex is present in adjacency list, create a new
             # vertex with source vertex as key and assign a list containing destination
             # vertex as first adjacent vertex
             elif destination_vertex in self.adj_list:
                _lowercase              =[destination_vertex]
             # if both source vertex and destination vertex are not present in adjacency
             # list, create a new vertex with source vertex as key and a list containing
             # destination vertex as it's first adjacent vertex. Then create a new vertex
             # with destination vertex as key, which has no adjacent vertex
             else:
                _lowercase              =[destination_vertex]
                _lowercase              =[]

          return self





       def __repr__(				self	:Optional[int]):



          """simple docstring"""

          return pformat(self.adj_list)


