Quantum annealing solves a combinatorial feature-map selection problem for CNNs, yielding improved class disentanglement over GradCAM and GradCAM++ in the reported evaluation.
On the computational complexity of ising spin glass models.Journal of Physics A: Mathematical and General15, 3241 (1982)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Numerical simulations confirm that the 3D SU(2) gauge glass model retains O(4) universality for the ferromagnetic-paramagnetic transition under weak disorder and shows disorder-independent universal behavior at the paramagnetic-spin glass transition.
citing papers explorer
-
Towards interpretable AI with quantum annealing feature selection
Quantum annealing solves a combinatorial feature-map selection problem for CNNs, yielding improved class disentanglement over GradCAM and GradCAM++ in the reported evaluation.
-
Critical Universality of the SU (2) Gauge Glass Model Analyzed by the Dynamical Scaling Method
Numerical simulations confirm that the 3D SU(2) gauge glass model retains O(4) universality for the ferromagnetic-paramagnetic transition under weak disorder and shows disorder-independent universal behavior at the paramagnetic-spin glass transition.