




import qiskit



def       UpperCAmelCase       (     _snake_case = 2							):
							lowerCAmelCase   =		qubits

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

							# Creating a Quantum Circuit acting on the q register
							lowerCAmelCase   =		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
							lowerCAmelCase   =		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)}''')









from __future__ import annotations

import math
from collections import Counter
from string import ascii_lowercase



def       UpperCAmelCase       (     _snake_case							):
							lowerCAmelCase   ,     lowerCAmelCase   =		analyze_text(_snake_case							)
							lowerCAmelCase   =		list(''' ''' + ascii_lowercase							)
							# what is our total sum of probabilities.
							lowerCAmelCase   =		sum(single_char_strings.values()							)

							# one length string
							lowerCAmelCase   =		0
							# for each alpha we go in our dict and if it is in it we calculate entropy
							for ch in my_alphas:
														if ch in single_char_strings:
																					lowerCAmelCase   =		single_char_strings[ch]
																					lowerCAmelCase   =		my_str / all_sum
																					my_fir_sum += prob * math.loga(_snake_case							)  # entropy formula.

    # print entropy
							print(F"""{round(-1 * my_fir_sum							):.1f}"""							)

							# two len string
							lowerCAmelCase   =		sum(two_char_strings.values()							)
							lowerCAmelCase   =		0
							# for each alpha (two in size) calculate entropy.
							for cha in my_alphas:
														for cha in my_alphas:
																					lowerCAmelCase   =		cha + cha
																					if sequence in two_char_strings:
																												lowerCAmelCase   =		two_char_strings[sequence]
																												lowerCAmelCase   =		int(_snake_case							) / all_sum
																												my_sec_sum += prob * math.loga(_snake_case							)

    # print second entropy
							print(F"""{round(-1 * my_sec_sum							):.1f}"""							)

							# print the difference between them
							print(F"""{round((-1 * my_sec_sum) - (-1 * my_fir_sum)							):.1f}"""							)



def       UpperCAmelCase       (     _snake_case							):
							lowerCAmelCase   =		Counter()  # type: ignore
							lowerCAmelCase   =		Counter()  # type: ignore
							single_char_strings[text[-1]] += 1

							# first case when we have space at start.
							two_char_strings[" " + text[0]] += 1
							for i in range(0						, len(_snake_case							) - 1							):
														single_char_strings[text[i]] += 1
														two_char_strings[text[i : i + 2]] += 1
							return single_char_strings, two_char_strings



def       UpperCAmelCase       (     ):
							import doctest

							doctest.testmod()
							# text = (
							#     "Had repulsive dashwoods suspicion sincerity but advantage now him. Remark "
							#     "easily garret nor nay. Civil those mrs enjoy shy fat merry. You greatest "
							#     "jointure saw horrible. He private he on be imagine suppose. Fertile "
							#     "beloved evident through no service elderly is. Blind there if every no so "
							#     "at. Own neglected you preferred way sincerity delivered his attempted. To "
							#     "of message cottage windows do besides against uncivil.  Delightful "
							#     "unreserved impossible few estimating men favourable see entreaties. She "
							#     "propriety immediate was improving. He or entrance humoured likewise "
							#     "moderate. Much nor game son say feel. Fat make met can must form into "
							#     "gate. Me we offending prevailed discovery. "
							# )

							# calculate_prob(text)


if __name__ == "__main__":
		main()



