Exploration of Quantum Computing in Multi-Die FPGA Routing Problems

This paper delves into the innovative application of quantum computing to solve complex multi-die FPGA (FieldProgrammable Gate Array) routing challenges. Leveraging the Quantum Approximate Optimization Algorithm (QAOA), we propose a novel approach that integrates classical routing techniques with quantum computing methodologies. This integration specifically utilizes QAOA to enhance the efficiency and effectiveness of the routing process. This hybrid approach partitions the routing task into intra-FPGA and inter-FPGA components, optimizing each segment through the appropriate computational techniques. Extensive experiments conducted on quantum computing simulators, alongside trials on actual quantum hardware, demonstrate the theoretical potential of quantum computing in enhancing the efficiency of multi-die FPGA routing solutions. Our findings suggest that despite the current limitations of quantum hardware, such as noise and error rates, quantum computing holds promise for advancing EDA methodologies. This paper contributes to the field by pioneering the integration of quantum algorithms with EDA techniques, offering a novel perspective on future applications of quantum computing in complex routing problems.