Evaluation of QAOA for black-box serializability problem

A database transaction is considered serializable if it can be executed concurrently while maintaining the correctness of the results. A problem known as the black-box serializability problem involves verifying serializability in an environment where the execution context is not visible. Previous research has applied quantum annealing to address this problem. However, this study addresses it using gate-based quantum computers, enabling future applications for large-scale data. In this study, we employ the Quantum Approximate Optimization Algorithm (QAOA), a quantum algorithm that can be implemented on a quantum computer, to address this problem. Our performance evaluation involves using IBM quantum computer to compare the efficiency of QAOA with that of quantum annealing and classical methods.