Probing entanglement and parameter sensitivity in QAOA via Quantum Fisher Information

Practical Application: The authors propose QFI-Informed Mutation (QIm), a heuristic that adapts mutation probabilities using diagonal QFI entries. QIm outperforms uniform and random-restart baselines, ...
EurekAlert!

Frontier AI in computational civil engineering: a review of graph, sequence, physics-informed deep learning, and beyond (2020–2025)

Researchers present a comprehensive review of frontier AI applications in computational structural analysis from 2020 to 2025 ...
IEEE

Fast FPGA Accelerator of Graph Cut Algorithm based on Cached Folding Grid Architecture

Abstract: Graph cut algorithms are widely used to solve min-cut/max-flow problems across various optimization applications. A common approach in recent FPGA accelerators of graph cut algorithms is to ...
IEEE

A Greedy Strategy for Graph Cut

Abstract: We propose a novel Greedy Graph Cut (GGC) algorithm to address the graph partitioning problem. The algorithm begins by treating each data point as an individual cluster and iteratively ...