


import math

import qiskit





def 	_lowerCAmelCase       (    _lowerCAmelCase = 1      ,	_lowerCAmelCase = 1      ,	_lowerCAmelCase = 1 )						->	qiskit.result.counts.Counts:


						'''simple docstring'''






						if (
						    isinstance(_lowerCAmelCase      ,	_lowerCAmelCase )
						    or isinstance(_lowerCAmelCase      ,	_lowerCAmelCase )
						    or isinstance(_lowerCAmelCase      ,	_lowerCAmelCase )
						):
												raise TypeError("inputs must be integers." )

						if (input_a < 0) or (input_a < 0) or (carry_in < 0):
												raise ValueError("inputs must be positive." )

						if (
						    (math.floor(_lowerCAmelCase ) != input_a)
						    or (math.floor(_lowerCAmelCase ) != input_a)
						    or (math.floor(_lowerCAmelCase ) != carry_in)
						):
												raise ValueError("inputs must be exact integers." )

						if (input_a > 2) or (input_a > 2) or (carry_in > 2):
												raise ValueError("inputs must be less or equal to 2." )

						# build registers
						__snake_case				=		qiskit.QuantumRegister(4      ,	"qr" )
						__snake_case				=		qiskit.ClassicalRegister(2      ,	"cr" )
						# list the entries
						__snake_case				=		[input_a, input_a, carry_in]

						__snake_case				=		qiskit.QuantumCircuit(_lowerCAmelCase      ,	_lowerCAmelCase )

						for i in range(0      ,	3 ):
												if entry[i] == 2:
																		quantum_circuit.h(_lowerCAmelCase )  # for hadamard entries
												elif entry[i] == 1:
																		quantum_circuit.x(_lowerCAmelCase )  # for 1 entries
												elif entry[i] == 0:
																		quantum_circuit.i(_lowerCAmelCase )  # for 0 entries

    # build the circuit
						quantum_circuit.ccx(0      ,	1      ,	3 )  # ccx = toffoli gate
						quantum_circuit.cx(0      ,	1 )
						quantum_circuit.ccx(1      ,	2      ,	3 )
						quantum_circuit.cx(1      ,	2 )
						quantum_circuit.cx(0      ,	1 )

						quantum_circuit.measure([2, 3]      ,	_lowerCAmelCase )  # measure the last two qbits

						__snake_case				=		qiskit.Aer.get_backend("aer_simulator" )
						__snake_case				=		qiskit.execute(_lowerCAmelCase      ,	_lowerCAmelCase      ,	shots=1000 )

						return job.result().get_counts(_lowerCAmelCase )


if __name__ == "__main__":
	print(f'''Total sum count for state is: {quantum_full_adder(1, 1, 1)}''')









class     UpperCamelCase:


					def __init__(						self	:		Any						)			->	Any:




											'''simple docstring'''

											__snake_case				=		0
											__snake_case				=		0
											__snake_case				=		{}


					def 							SCREAMING_SNAKE_CASE_  (						self	:		Dict     ,    SCREAMING_SNAKE_CASE	:		Optional[int]						)			->	Optional[Any]:




											'''simple docstring'''

											if vertex not in self.adjacency:
																	__snake_case				=		{}
																	self.num_vertices += 1


					def 							SCREAMING_SNAKE_CASE_  (						self	:		Union[str, Any]     ,    SCREAMING_SNAKE_CASE	:		Optional[int]     ,    SCREAMING_SNAKE_CASE	:		Optional[int]     ,    SCREAMING_SNAKE_CASE	:		str						)			->	Optional[Any]:




											'''simple docstring'''

											self.add_vertex(SCREAMING_SNAKE_CASE						)
											self.add_vertex(SCREAMING_SNAKE_CASE						)

											if head == tail:
																	return

											__snake_case				=		weight
											__snake_case				=		weight


					def 							SCREAMING_SNAKE_CASE_  (						self	:		Optional[int]						)			->	Tuple:




											'''simple docstring'''

											__snake_case				=		self.get_edges()
											for edge in edges:
																	__snake_case		,					__snake_case		,					__snake_case				=		edge
																	edges.remove((tail, head, weight)						)
											for i in range(len(SCREAMING_SNAKE_CASE						)						):
																	__snake_case				=		list(edges[i]						)

											edges.sort(key=lambda SCREAMING_SNAKE_CASE						: e[2]						)
											for i in range(len(SCREAMING_SNAKE_CASE						) - 1						):
																	if edges[i][2] >= edges[i + 1][2]:
																							__snake_case				=		edges[i][2] + 1
											for edge in edges:
																	__snake_case		,					__snake_case		,					__snake_case				=		edge
																	__snake_case				=		weight
																	__snake_case				=		weight


					def __str__(						self	:		Tuple						)			->	List[Any]:




											'''simple docstring'''

											__snake_case				=		""
											for tail in self.adjacency:
																	for head in self.adjacency[tail]:
																							__snake_case				=		self.adjacency[head][tail]
																							string += f'''{head} -> {tail} == {weight}\n'''
											return string.rstrip("\n"						)


					def 							SCREAMING_SNAKE_CASE_  (						self	:		int						)			->	Optional[Any]:




											'''simple docstring'''

											__snake_case				=		[]
											for tail in self.adjacency:
																	for head in self.adjacency[tail]:
																							output.append((tail, head, self.adjacency[head][tail])						)
											return output


					def 							SCREAMING_SNAKE_CASE_  (						self	:		Any						)			->	List[Any]:




											'''simple docstring'''

											return self.adjacency.keys()


					@staticmethod
					def 							SCREAMING_SNAKE_CASE_  (						SCREAMING_SNAKE_CASE	:		Any=None     ,    SCREAMING_SNAKE_CASE	:		List[Any]=None						)			->	int:




											'''simple docstring'''

											__snake_case				=		Graph()
											if vertices is None:
																	__snake_case				=		[]
											if edges is None:
																	__snake_case				=		[]
											for vertex in vertices:
																	g.add_vertex(SCREAMING_SNAKE_CASE						)
											for edge in edges:
																	g.add_edge(*SCREAMING_SNAKE_CASE						)
											return g






					class     UpperCamelCase:


										def __init__(						self	:		Union[str, Any]						)			->	Union[str, Any]:




																'''simple docstring'''

																__snake_case				=		{}
																__snake_case				=		{}


										def __len__(						self	:		List[str]						)			->	Dict:




																'''simple docstring'''

																return len(self.parent						)


										def 							SCREAMING_SNAKE_CASE_  (						self	:		List[str]     ,    SCREAMING_SNAKE_CASE	:		int						)			->	List[str]:




																'''simple docstring'''

																if item in self.parent:
																						return self.find(SCREAMING_SNAKE_CASE						)

																__snake_case				=		item
																__snake_case				=		0
																return item


										def 							SCREAMING_SNAKE_CASE_  (						self	:		Optional[Any]     ,    SCREAMING_SNAKE_CASE	:		List[str]						)			->	Any:




																'''simple docstring'''

																if item not in self.parent:
																						return self.make_set(SCREAMING_SNAKE_CASE						)
																if item != self.parent[item]:
																						__snake_case				=		self.find(self.parent[item]						)
																return self.parent[item]






										def 							SCREAMING_SNAKE_CASE_  (						self	:		Optional[Any]     ,    SCREAMING_SNAKE_CASE	:		int     ,    SCREAMING_SNAKE_CASE	:		Union[str, Any]						)			->	Dict:




																'''simple docstring'''

																__snake_case				=		self.find(SCREAMING_SNAKE_CASE						)
																__snake_case				=		self.find(SCREAMING_SNAKE_CASE						)

																if roota == roota:
																						return roota

																if self.rank[roota] > self.rank[roota]:
																						__snake_case				=		roota
																						return roota

																if self.rank[roota] < self.rank[roota]:
																						__snake_case				=		roota
																						return roota

																if self.rank[roota] == self.rank[roota]:
																						self.rank[roota] += 1
																						__snake_case				=		roota
																						return roota
																return None




					@staticmethod
					def 							SCREAMING_SNAKE_CASE_  (						SCREAMING_SNAKE_CASE	:		str						)			->	Any:




											'''simple docstring'''

											__snake_case				=		graph.num_vertices

											__snake_case				=		Graph.UnionFind()
											__snake_case				=		[]
											while num_components > 1:
																	__snake_case				=		{}
																	for vertex in graph.get_vertices():
																							__snake_case				=		-1

																	__snake_case				=		graph.get_edges()
																	for edge in edges:
																							__snake_case		,					__snake_case		,					__snake_case				=		edge
																							edges.remove((tail, head, weight)						)
																	for edge in edges:
																							__snake_case		,					__snake_case		,					__snake_case				=		edge
																							__snake_case				=		union_find.find(SCREAMING_SNAKE_CASE						)
																							__snake_case				=		union_find.find(SCREAMING_SNAKE_CASE						)
																							if seta != seta:
																													if cheap_edge[seta] == -1 or cheap_edge[seta][2] > weight:
																																			__snake_case				=		[head, tail, weight]

																													if cheap_edge[seta] == -1 or cheap_edge[seta][2] > weight:
																																			__snake_case				=		[head, tail, weight]
																	for vertex in cheap_edge:
																							if cheap_edge[vertex] != -1:
																													__snake_case		,					__snake_case		,					__snake_case				=		cheap_edge[vertex]
																													if union_find.find(SCREAMING_SNAKE_CASE						) != union_find.find(SCREAMING_SNAKE_CASE						):
																																			union_find.union(SCREAMING_SNAKE_CASE     ,    SCREAMING_SNAKE_CASE						)
																																			mst_edges.append(cheap_edge[vertex]						)
																																			__snake_case				=		num_components - 1
											__snake_case				=		Graph.build(edges=SCREAMING_SNAKE_CASE						)
											return mst





