Computational Network Layout Study Based on Quantum Annealing Algorithm and Qubo Model

This paper investigates the layout of computing facilities based on quantum annealing and qubo models using qubo models, combinatorial optimisation, quantum annealing algorithms, CIM simulators, etc. The aim is to lay out the computing network infrastructure and to explore the optimisation strategies for the deployment locations of edge servers and cloud servers. This study addresses several aspects such as the analysis of the total computing requirements to be covered, the analysis of the minimum total cost of optimisation and the analysis of power system scheduling and optimisation. Firstly, the simulated annealing algorithm and the CIM simulator are used to calculate the coordinates of the two edge servers and their total requirements. Secondly, the qubo model is applied to set reasonable constraints to minimise the final total cost. Finally, the power system is planned and enhanced by combinatorial optimisation. In this paper, we analyse the need to satisfy various computing tasks and strategically allocate computing resources based on the spatial distribution of computing needs, thus improving the overall network efficiency and user experience.