





"""simple docstring"""





import math

import qiskit
def  __A   (_SCREAMING_SNAKE_CASE = 1     ,   _SCREAMING_SNAKE_CASE = 1     ,   _SCREAMING_SNAKE_CASE = 1			)					->qiskit.result.counts.Counts:





  """simple docstring"""


  if (
      isinstance(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)
      or isinstance(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)
      or isinstance(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)
  ):
    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(_SCREAMING_SNAKE_CASE			) != input_a)
      or (math.floor(_SCREAMING_SNAKE_CASE			) != input_a)
      or (math.floor(_SCREAMING_SNAKE_CASE			) != 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
  lowerCAmelCase__			:List[str]											=							qiskit.QuantumRegister(4     ,   'qr'			)
  lowerCAmelCase__			:List[str]											=							qiskit.ClassicalRegister(2     ,   'cr'			)
  # list the entries
  lowerCAmelCase__			:str											=							[input_a, input_a, carry_in]

  lowerCAmelCase__			:Optional[int]											=							qiskit.QuantumCircuit(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)

  for i in range(0     ,   3			):
    if entry[i] == 2:
      quantum_circuit.h(_SCREAMING_SNAKE_CASE			)  # for hadamard entries
    elif entry[i] == 1:
      quantum_circuit.x(_SCREAMING_SNAKE_CASE			)  # for 1 entries
    elif entry[i] == 0:
      quantum_circuit.i(_SCREAMING_SNAKE_CASE			)  # 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]     ,   _SCREAMING_SNAKE_CASE			)  # measure the last two qbits

  lowerCAmelCase__			:Dict											=							qiskit.Aer.get_backend('aer_simulator'			)
  lowerCAmelCase__			:Dict											=							qiskit.execute(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE     ,   shots=1000			)

  return job.result().get_counts(_SCREAMING_SNAKE_CASE			)


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







"""simple docstring"""





from multiprocessing import Lock, Pipe, Process

# lock used to ensure that two processes do not access a pipe at the same time
__A											=		Lock()
def  __A   (_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)					->List[Any]:





  """simple docstring"""


  global process_lock

  # we perform n swaps since after n swaps we know we are sorted
  # we *could* stop early if we are sorted already, but it takes as long to
  # find out we are sorted as it does to sort the list with this algorithm
  for i in range(0     ,   10			):
    if (i + position) % 2 == 0 and r_send is not None:
      # send your value to your right neighbor
      process_lock.acquire()
      r_send[1].send(_SCREAMING_SNAKE_CASE			)
      process_lock.release()

      # receive your right neighbor's value
      process_lock.acquire()
      lowerCAmelCase__			:Any											=							rr_cv[0].recv()
      process_lock.release()

      # take the lower value since you are on the left
      lowerCAmelCase__			:Tuple											=							min(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)
    elif (i + position) % 2 != 0 and l_send is not None:
      # send your value to your left neighbor
      process_lock.acquire()
      l_send[1].send(_SCREAMING_SNAKE_CASE			)
      process_lock.release()

      # receive your left neighbor's value
      process_lock.acquire()
      lowerCAmelCase__			:Optional[int]											=							lr_cv[0].recv()
      process_lock.release()

      # take the higher value since you are on the right
      lowerCAmelCase__			:Optional[int]											=							max(_SCREAMING_SNAKE_CASE     ,   _SCREAMING_SNAKE_CASE			)
    # after all swaps are performed, send the values back to main
  result_pipe[1].send(_SCREAMING_SNAKE_CASE			)
def  __A   (_SCREAMING_SNAKE_CASE			)					->Optional[int]:





  """simple docstring"""


  lowerCAmelCase__			:str											=							[]
  lowerCAmelCase__			:Optional[Any]											=							[]
  # initialize the list of pipes where the values will be retrieved
  for _ in arr:
    result_pipe.append(Pipe()			)
  # creates the processes
  # the first and last process only have one neighbor so they are made outside
  # of the loop
  lowerCAmelCase__			:List[str]											=							Pipe()
  lowerCAmelCase__			:List[Any]											=							Pipe()
  process_array_.append(
      Process(
          target=_SCREAMING_SNAKE_CASE     ,   args=(0, arr[0], None, temp_rs, None, temp_rr, result_pipe[0])     ,   )			)
  lowerCAmelCase__			:Dict											=							temp_rs
  lowerCAmelCase__			:Optional[Any]											=							temp_rr

  for i in range(1     ,   len(_SCREAMING_SNAKE_CASE			) - 1			):
    lowerCAmelCase__			:Union[str, Any]											=							Pipe()
    lowerCAmelCase__			:List[str]											=							Pipe()
    process_array_.append(
        Process(
            target=_SCREAMING_SNAKE_CASE     ,   args=(i, arr[i], temp_ls, temp_rs, temp_lr, temp_rr, result_pipe[i])     ,   )			)
    lowerCAmelCase__			:Union[str, Any]											=							temp_rs
    lowerCAmelCase__			:Any											=							temp_rr

  process_array_.append(
      Process(
          target=_SCREAMING_SNAKE_CASE     ,   args=(
              len(_SCREAMING_SNAKE_CASE			) - 1,
              arr[len(_SCREAMING_SNAKE_CASE			) - 1],
              temp_ls,
              None,
              temp_lr,
              None,
              result_pipe[len(_SCREAMING_SNAKE_CASE			) - 1],
          )     ,   )			)

  # start the processes
  for p in process_array_:
    p.start()

  # wait for the processes to end and write their values to the list
  for p in range(0     ,   len(_SCREAMING_SNAKE_CASE			)			):
    lowerCAmelCase__			:str											=							result_pipe[p][0].recv()
    process_array_[p].join()
  return arr
def  __A   ()					->List[Any]:





  """simple docstring"""


  lowerCAmelCase__			:Union[str, Any]											=							list(range(10     ,   0     ,   -1			)			)
  print('Initial List'			)
  print(*_SCREAMING_SNAKE_CASE			)
  lowerCAmelCase__			:List[str]											=							odd_even_transposition(_SCREAMING_SNAKE_CASE			)
  print('Sorted List\n'			)
  print(*_SCREAMING_SNAKE_CASE			)


if __name__ == "__main__":
  main()
