'''simple docstring'''




import qiskit

def 	UpperCamelCase_							(					_UpperCAmelCase  :      int			,	_UpperCAmelCase  :      int    )    ->    qiskit.result.counts.Counts:


       """simple docstring"""







       _UpperCAmelCase     :  Dict							      =    qiskit.Aer.get_backend("aer_simulator"    )

       # Create a Quantum Circuit acting on the q register
       _UpperCAmelCase     :  List[Any]							      =    qiskit.QuantumCircuit(_UpperCAmelCase			,	_UpperCAmelCase    )

       # Apply X (NOT) Gate to Qubits 0 & 1
       circuit.x(0    )
       circuit.x(1    )

       # Map the quantum measurement to the classical bits
       circuit.measure([0, 1]			,	[0, 1]    )

       # Execute the circuit on the qasm simulator
       _UpperCAmelCase     :  int							      =    qiskit.execute(_UpperCAmelCase			,	_UpperCAmelCase			,	shots=1_000    )

       # Return the histogram data of the results of the experiment.
       return job.result().get_counts(_UpperCAmelCase    )


if __name__ == "__main__":
  __SCREAMING_SNAKE_CASE       :     Dict     =  single_qubit_measure(2, 2)
  print(F'Total count for various states are: {counts}')








"""simple docstring"""



def 		__lowercase     (   snake_case_  :  dict						)   ->set:



    '''simple docstring'''







    __A    :						List[str]						 =     set()
    # edges = list of graph's edges
    __A    :						Optional[int]						 =     get_edges(snake_case_						)

    # While there are still elements in edges list, take an arbitrary edge
    # (from_node, to_node) and add his extremity to chosen_vertices and then
    # remove all arcs adjacent to the from_node and to_node
    while edges:
        __A ,       __A    :						str						 =     edges.pop()
        chosen_vertices.add(snake_case_						)
        chosen_vertices.add(snake_case_						)
        for edge in edges.copy():
            if from_node in edge or to_node in edge:
                edges.discard(snake_case_						)
    return chosen_vertices







def 		__lowercase     (   snake_case_  :  dict						)   ->set:



    '''simple docstring'''







    __A    :						Tuple						 =     set()
    for from_node, to_nodes in graph.items():
        for to_node in to_nodes:
            edges.add((from_node, to_node)						)
    return edges


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       # graph = {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
       # print(f"Matching vertex cover:\n{matching_min_vertex_cover(graph)}")




