The field of quantum computing and optimization is rapidly advancing, with a focus on developing practical solutions for real-world problems. Recent research has explored the application of quantum algorithms to complex optimization problems, such as resource scheduling and network optimization. Quantum-inspired evolutionary optimizers have also shown promise in solving large-scale combinatorial optimization problems. Additionally, there is a growing interest in developing hybrid quantum-classical algorithms that can leverage the strengths of both paradigms. Noteworthy papers in this area include the development of a novel qubit mapping algorithm, which has demonstrated significant improvements in circuit depth and swap count, and the introduction of a hybrid quantum-classical algorithm for resource scheduling, which has achieved a consistently lower computation-time growth rate and maintained an absolute optimality gap below 1.63%. Other notable works include the investigation of performance and scalability of a quantum-inspired evolutionary optimizer on NVIDIA GPU and the design of quasi phase matching crystal based on differential gray wolf algorithm.
Quantum Computing and Optimization Advances
Sources
Towards Quantum Algorithms for the Optimization of Spanning Trees: The Power Distribution Grids Use Case
Quantum Computing for EVs to Enhance Grid Resilience and Disaster Relief: Challenges and Opportunities
Towards Portability at Scale: A Cross-Architecture Performance Evaluation of a GPU-enabled Shallow Water Solver