The scheduling problem for federated learning (FL) with multiple models in a distributed network is challenging, as it involves NP-hard mixed-integer nonlinear programming. Moreover, it requires optimal participant selection and learning rate determination among multiple FL models to avoid high training costs and resource competition. To overcome those chal-lenges, in literature the Benders' decomposition algorithm (BD) can deal with mixed integer problems, however, it still suffers from limited scalability. To address this issue, in this paper, we present the Hybrid Quantum-Classical Benders' Decomposition (HQCBD) algorithm, which combines the power of quantum and classical computing to solve the joint participant selection and learning scheduling problem in multi-model FL. HQCBD decomposes the optimization problem into a master problem with binary variables and small subproblems with continuous variables. This collaboration maximizes the potential of both quantum and classical computing, and optimizes the complex joint optimization problem. Simulation on the commercial D-Wave quantum annealing machine demonstrates the effectiveness and robustness of the proposed method, with up to 18% improvement of iterations and 81% improvement of computation time over BD algorithm on classical CPUs even at small scales.