Implementasi Quadratic Unconstrained Binary Optimization (QUBO) Dan Quantum Approximate Optimization Algorithm (QAOA) Untuk Pencarian Nilai Maksimum Pada Permasalahan Quadratic Programming (QP)

Abstract

This research focuses on the use of quadratic programming (QP) in finding the maximum value by using Quadratic Unconstrained Binary Optimization (QUBO) as qubit pre-processing and then proceeding with finding the optimum value with the Approximate Optimization Algorithm (QAOA). from the results of research with QAOA obtained 62 qubits with 3 evaluations at the final stage and also obtained a maximum value of 2,769.13 with details of the machine cycle time value of 13 nano seconds, the minimum value of main memory 1,270 kilobytes, the maximum value of main memory 63,637 kilobytes, cache memory value 154 kilobytes, the minimum channel value is 29 units and the maximum channel value is 137 units.