RBM-Based Simulated Quantum Annealing for Graph Isomorphism Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913818797408256 |
|---|---|
| author | Wang, Yukun Shen, Yingtong Zhang, Zhichao Wan, Linchun |
| author_facet | Wang, Yukun Shen, Yingtong Zhang, Zhichao Wan, Linchun |
| contents | The graph isomorphism problem remains a fundamental challenge in computer science, driving the search for efficient decision algorithms. Due to its ambiguous computational complexity, heuristic approaches such as simulated annealing are frequently used, achieving high solution probabilities while avoiding exhaustive enumeration. However, traditional simulated annealing usually struggles with low sampling efficiency and reduced solution-finding probability in complex or large graph problems. In this study, we integrate the principles of quantum technology to address the graph isomorphism problem. By mapping the solution space to a quantum many-body system, we developed a parameterized model for variational simulated annealing. This approach emphasizes the regions of the solution space that are most likely to contain the optimal solution, thereby enhancing the search accuracy.Artificial neural networks were utilized to parameterize the quantum many-body system, leveraging their capacity for efficient function approximation to perform accurate sampling in the intricate energy landscapes of large graph problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_07749 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | RBM-Based Simulated Quantum Annealing for Graph Isomorphism Problems Wang, Yukun Shen, Yingtong Zhang, Zhichao Wan, Linchun Quantum Physics The graph isomorphism problem remains a fundamental challenge in computer science, driving the search for efficient decision algorithms. Due to its ambiguous computational complexity, heuristic approaches such as simulated annealing are frequently used, achieving high solution probabilities while avoiding exhaustive enumeration. However, traditional simulated annealing usually struggles with low sampling efficiency and reduced solution-finding probability in complex or large graph problems. In this study, we integrate the principles of quantum technology to address the graph isomorphism problem. By mapping the solution space to a quantum many-body system, we developed a parameterized model for variational simulated annealing. This approach emphasizes the regions of the solution space that are most likely to contain the optimal solution, thereby enhancing the search accuracy.Artificial neural networks were utilized to parameterize the quantum many-body system, leveraging their capacity for efficient function approximation to perform accurate sampling in the intricate energy landscapes of large graph problems. |
| title | RBM-Based Simulated Quantum Annealing for Graph Isomorphism Problems |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.07749 |