用图自编码器压缩图数据,提升量子图神经网络性能
Guided Graph Compression for Quantum Graph Neural Networks
- 通过图自编码器同时减少节点数和特征维度
- 在喷注分类任务中优于传统方法和经典GNN
- 适合想测试量子图神经网络新架构的研究者
图神经网络(GNN)在处理图结构数据方面表现优异,但面对大规模图时受限于高内存需求和GPU上稀疏矩阵操作效率低下。量子计算为解决这些问题提供了新思路,催生了量子图神经网络(QGNN)的新算法探索。然而,当前量子硬件限制了可有效编码的数据维度。现有方法要么手动简化数据集,要么使用人工生成的图数据。本文提出引导式图压缩(GGC)框架,利用图自编码器降低节点数量与节点特征维度,压缩过程以提升下游分类任务性能为目标,可配合量子或经典分类器使用。该框架在高能物理中的喷注分类任务上进行评估,旨在区分夸克与胶子引发的粒子喷注。数值结果表明,GGC优于仅用自编码器预处理或经典GNN基线方法,同时支持在真实数据集上测试新型QGNN变体。
原文摘要 · Abstract (English)
Graph Neural Networks (GNNs) are effective for processing graph-structured data but face challenges with large graphs due to high memory requirements and inefficient sparse matrix operations on GPUs. Quantum Computing (QC) offers a promising avenue to address these issues and inspires new algorithmic approaches. In particular, Quantum Graph Neural Networks (QGNNs) have been explored in recent literature. However, current quantum hardware limits the dimension of the data that can be effectively encoded. Existing approaches either simplify datasets manually or use artificial graph datasets. This work introduces the Guided Graph Compression (GGC) framework, which uses a graph autoencoder to reduce both the number of nodes and the dimensionality of node features. The compression is guided to enhance the performance of a downstream classification task, which can be applied either with a quantum or a classical classifier. The framework is evaluated on the Jet Tagging task, a classification problem of fundamental importance in high energy physics that involves distinguishing particle jets initiated by quarks from those by gluons. The GGC is compared against using the autoencoder as a standalone preprocessing step and against a baseline classical GNN classifier. Our numerical results demonstrate that GGC outperforms both alternatives, while also facilitating the testing of novel QGNN ansatzes on realistic datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。