Quantum Random Forest Model Prediction Circuit Gate Complexity

In this work, we present quantum random forest prediction circuits for binary and multiclass classification problems and their gate complexities. Gate complexity is defined as the number of elementary one- and two-qubit gates. The presented prediction algorithm requires fewer elementary gates than the general upper bound.