As more and more controllable devices equiped in the smart grid, the inceasing scale of binary virables brings time-consuming dimension explosion problems to traditional optimizations problems. As a parallel computing method, quantum computing is valuable for exploration to accelerate the optimization computation. The classic quantum annealer~(QA) only can be used for quadratic unconstraint binary optimization~(QUBO) problems. This paper is to explore a novel algorithm based on the quantum annealer for grid partition problems. It is a typical large-scale Integer Quadratic Programming~(IQP) problems. The proposed quantum algorithm attemped to apply Lagrangian relaxation~(LR) and alternating direction method of multipliers~(ADMM), to transform an IQP problem to general format of QUBO problems. Some numerical cases of the grid partition are discussed to compare the performance of the proposed algorithm with some typical methods, thus verifing the feasibility and performance of this ADMM-QA algorithm.

Quantum computing, grid partition, largescale IQP.