Analysis of quantum neural network performance via edge cases

• URL: http://arxiv.org/abs/2506.12427v1
• Date: Sat, 14 Jun 2025 09:56:01 GMT
• Title: Analysis of quantum neural network performance via edge cases
• Abstract summary: We evaluate the particular performance of different quantum machine learning networks on a graph classification task.<n>Quantum circuits with varying internal symmetry that completely, partially and not at all confer to the symmetry of the graph show different performance on the data set.
• Score: 4.180897432770239
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We evaluate the particular performance of different quantum machine learning networks on a graph classification task. Quantum circuits with varying internal symmetry that completely, partially and not at all confer to the symmetry of the graph show different performance on the data set. The convergence results are inspected using a number of special graphs with particular structure. These are unlikely to occur in the training data and cover specific cases that refute the assumption that the quantum neural network learns simpler surrogate models based on the number of edges in the graph.

Related papers

• Entanglement in Quantum Systems Based on Directed Graphs [0.0]
  We investigate entanglement properties of quantum states associated with directed graphs.<n>Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.
  arXiv  Detail & Related papers  (2025-09-05T16:17:03Z)
• On the Importance of Fundamental Properties in Quantum-Classical Machine Learning Models [0.0]
  We present a systematic study of how quantum circuit design affects the performance of hybrid quantum-classical neural networks on a causal classification task.<n>The architecture combines a convolutional neural network for classical feature extraction with a parameterized quantum circuit acting as the quantum layer.<n>Results show that increasing the number of ansatz repetitions improves generalization and training stability, though benefits tend to plateau beyond a certain depth.<n>The choice of feature mapping is even more critical: only encodings with multi-axis Pauli rotations enable successful learning, while simpler maps lead to underfitting or loss of class separability.
  arXiv  Detail & Related papers  (2025-07-14T11:18:53Z)
• Exact Computation of Any-Order Shapley Interactions for Graph Neural Networks [53.10674067060148]
  Shapley Interactions (SIs) quantify node contributions and interactions among multiple nodes.<n>By exploiting the GNN architecture, we show that the structure of interactions in node embeddings are preserved for graph prediction.<n>We introduce GraphSHAP-IQ, an efficient approach to compute any-order SIs exactly.
  arXiv  Detail & Related papers  (2025-01-28T13:37:44Z)
• The role of data embedding in equivariant quantum convolutional neural networks [2.255961793913651]
  We investigate the role of classical-to-quantum embedding on the performance of equivariant quantum neural networks (EQNNs) We numerically compare the classification accuracy of EQCNNs with three different basis-permuted amplitude embeddings to the one obtained from a non-equivariant quantum convolutional neural network (QCNN)
  arXiv  Detail & Related papers  (2023-12-20T18:25:15Z)
• Detecting quantum speedup of random walks with machine learning [8.151729519194182]
  We use machine-learning techniques to detect quantum speedup in random walks on graphs. Our results indicate that carefully building the data set for training can improve the performance of the neural networks. If classification accuracy can be improved further, valuable insights about quantum advantage may be gleaned from these neural networks.
  arXiv  Detail & Related papers  (2023-09-05T13:19:47Z)
• What can we learn from quantum convolutional neural networks? [15.236546465767026]
  We show how models utilizing quantum data can be interpreted through hidden feature maps.<n>High performance in quantum phase recognition comes from generating a highly effective basis set with sharp features at critical points.<n>Our analysis highlights improved generalization when working with quantum data.
  arXiv  Detail & Related papers  (2023-08-31T12:12:56Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Analytic theory for the dynamics of wide quantum neural networks [7.636414695095235]
  We study the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. For random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system.
  arXiv  Detail & Related papers  (2022-03-30T23:24:06Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Quantum Algorithms for Data Representation and Analysis [68.754953879193]
  We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
  arXiv  Detail & Related papers  (2021-04-19T00:41:43Z)
• Benchmarking Graph Neural Networks on Link Prediction [80.2049358846658]
  We benchmark several existing graph neural network (GNN) models on different datasets for link predictions. Our experiments show these GNN architectures perform similarly on various benchmarks for link prediction tasks.
  arXiv  Detail & Related papers  (2021-02-24T20:57:16Z)
• Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms [67.88675386638043]
  The scattering transform is a multilayered wavelet-based deep learning architecture that acts as a model of convolutional neural networks. We introduce windowed and non-windowed geometric scattering transforms for graphs based upon a very general class of asymmetric wavelets. We show that these asymmetric graph scattering transforms have many of the same theoretical guarantees as their symmetric counterparts.
  arXiv  Detail & Related papers  (2019-11-14T17:23:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.