

from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

__UpperCAmelCase								=			(3, 9, -11, 0, 7, 5, 1, -1)
__UpperCAmelCase								=			(4, 6, 2, 0, 8, 10, 3, -2)



@dataclass
class SCREAMING_SNAKE_CASE     :
  """simple docstring"""






  lowerCamelCase   :      int
  lowerCamelCase   :      Node | None






class SCREAMING_SNAKE_CASE     :
  """simple docstring"""






  def __init__(      self			:   Tuple	,							lowerCAmelCase			:   Iterable[int]   )							->     None:






     """simple docstring"""







     __lowerCAmelCase  :      Node | None    =						None
     for i in sorted(lowerCAmelCase	,							reverse=lowerCAmelCase   ):
        __lowerCAmelCase  :      Optional[int]    =						Node(lowerCAmelCase	,							self.head   )







  def __iter__(      self			:   List[str]   )							->     Iterator[int]:






     """simple docstring"""







     __lowerCAmelCase  :      Tuple    =						self.head
     while node:
        yield node.data
        __lowerCAmelCase  :      Dict    =						node.next_node







  def __len__(      self			:   int   )							->     int:






     """simple docstring"""







     return sum(1 for _ in self   )







  def __str__(      self			:   str   )							->     str:






     """simple docstring"""







     return " -> ".join([str(lowerCAmelCase   ) for node in self]   )






def      snake_case_				(__A					:						SortedLinkedList ,       __A					:						SortedLinkedList					):
   return SortedLinkedList(list(__A					) + list(__A					)					)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   __UpperCAmelCase								=			SortedLinkedList
   print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))





import numpy as np
import qiskit





def      snake_case_				(__A					:						int = 8 ,       __A					:						int | None = None					)      ->     str:
   __lowerCAmelCase  :      List[Any]    =						np.random.default_rng(seed=__A					)

   # Roughly 25% of the qubits will contribute to the key.
   # So we take more than we need.
   __lowerCAmelCase  :      Tuple    =						6 * key_len
   # Measurement basis for Alice's qubits.
   __lowerCAmelCase  :      List[Any]    =						rng.integers(2 ,       size=__A					)
   # The set of states Alice will prepare.
   __lowerCAmelCase  :      List[str]    =						rng.integers(2 ,       size=__A					)
   # Measurement basis for Bob's qubits.
   __lowerCAmelCase  :      List[Any]    =						rng.integers(2 ,       size=__A					)

   # Quantum Circuit to simulate BB84
   __lowerCAmelCase  :      int    =						qiskit.QuantumCircuit(__A ,       name="""BB84"""					)

   # Alice prepares her qubits according to rules above.
   for index, _ in enumerate(__A					):
      if alice_state[index] == 1:
         bbaa_circ.x(__A					)
      if alice_basis[index] == 1:
         bbaa_circ.h(__A					)
   bbaa_circ.barrier()

   # Bob measures the received qubits according to rules above.
   for index, _ in enumerate(__A					):
      if bob_basis[index] == 1:
         bbaa_circ.h(__A					)

   bbaa_circ.barrier()
   bbaa_circ.measure_all()

   # Simulate the quantum circuit.
   __lowerCAmelCase  :      Optional[Any]    =						qiskit.Aer.get_backend("""aer_simulator"""					)
   # We only need to run one shot because the key is unique.
   # Multiple shots will produce the same key.
   __lowerCAmelCase  :      Optional[Any]    =						qiskit.execute(__A ,       __A ,       shots=1 ,       seed_simulator=__A					)
   # Returns the result of measurement.
   __lowerCAmelCase  :      List[Any]    =						job.result().get_counts(__A					).most_frequent()

   # Extracting the generated key from the simulation results.
   # Only keep measurement results where Alice and Bob chose the same basis.
   __lowerCAmelCase  :      Optional[int]    =						"""""".join(
       [
           result_bit
           for alice_basis_bit, bob_basis_bit, result_bit in zip(
               __A ,       __A ,       __A					)
           if alice_basis_bit == bob_basis_bit
       ]					)

   # Get final key. Pad with 0 if too short, otherwise truncate.
   __lowerCAmelCase  :      Tuple    =						gen_key[:key_len] if len(__A					) >= key_len else gen_key.ljust(__A ,       """0"""					)
   return key


if __name__ == "__main__":
   print(F'The generated key is : {bbaa(8, seed=0)}')
   from doctest import testmod

   testmod()


