Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2503.06447 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929748904509440 |
|---|---|
| author | Ye, Zi Yu, Kai Lin, Song |
| author_facet | Ye, Zi Yu, Kai Lin, Song |
| contents | Graph Convolutional Networks (GCNs) are specialized neural networks for feature extraction from graph-structured data. In contrast to traditional convolutional networks, GCNs offer distinct advantages when processing irregular data, which is ubiquitous in real-world applications. This paper introduces an enhancement to GCNs based on spectral methods by integrating quantum computing techniques. Specifically, a quantum approach is employed to construct the Laplacian matrix, and phase estimation is used to extract the corresponding eigenvectors efficiently. Additionally, quantum parallelism is leveraged to accelerate the convolution operations, thereby improving the efficiency of feature extraction. The findings of this study demonstrate the feasibility of employing quantum computing principles and algorithms to optimize classical GCNs. Theoretical analysis further reveals that, compared to classical methods, the proposed quantum algorithm achieves exponential speedup concerning the number of nodes in the graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_06447 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Graph Convolutional Networks Based on Spectral Methods Ye, Zi Yu, Kai Lin, Song Quantum Physics Graph Convolutional Networks (GCNs) are specialized neural networks for feature extraction from graph-structured data. In contrast to traditional convolutional networks, GCNs offer distinct advantages when processing irregular data, which is ubiquitous in real-world applications. This paper introduces an enhancement to GCNs based on spectral methods by integrating quantum computing techniques. Specifically, a quantum approach is employed to construct the Laplacian matrix, and phase estimation is used to extract the corresponding eigenvectors efficiently. Additionally, quantum parallelism is leveraged to accelerate the convolution operations, thereby improving the efficiency of feature extraction. The findings of this study demonstrate the feasibility of employing quantum computing principles and algorithms to optimize classical GCNs. Theoretical analysis further reveals that, compared to classical methods, the proposed quantum algorithm achieves exponential speedup concerning the number of nodes in the graph. |
| title | Quantum Graph Convolutional Networks Based on Spectral Methods |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.06447 |