Benchmarking Encoding Families in Quantum Neural Networks Under Fixed Circuit Area for Frequency Spectrum and Trainability

• URL: http://arxiv.org/abs/2603.27671v1
• Date: Sun, 29 Mar 2026 12:42:02 GMT
• Title: Benchmarking Encoding Families in Quantum Neural Networks Under Fixed Circuit Area for Frequency Spectrum and Trainability
• Abstract summary: Quantum Networks (QNNs) offer a promising framework for integrating quantum computing principles into machine learning.<n>We investigate the trainability and approximation properties of QNNs by benchmarking and encoding strategies across synthetic and real-world datasets.<n>We find that QNNs perform best when the frequency spectrum is tailored to the target function's complexity but remains as compact as possible.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Neural Networks (QNNs) offer a promising framework for integrating quantum computing principles into machine learning, yet their practical capabilities and limitations remain insufficiently studied. In this work, we systematically investigate the trainability and approximation properties of QNNs by benchmarking diverse circuit architectures and encoding strategies across synthetic and real-world datasets. We analyze several ansätze, including Hamming, binary, exponential, ternary, turnpike and Golomb, by evaluating their ability to learn synthetic data modeled as random finite Fourier series. To assess real-world applicability, we further evaluate QNNs on two time-series classification tasks: a Fischertechnik pneumatic leak detection dataset and the publicly available NASA bearing fault dataset. Our experiments show that while broader frequency spectra can theoretically enhance expressivity, practical trainability is strongly influenced by architectural factors such as qubit count and circuit depth. Notably, we find that QNNs perform best when the frequency spectrum is tailored to the target function's complexity but remains as compact as possible. Moreover, architectures with identical frequency spectra can differ in trainability, with configurations using more qubits and fewer layers generally performing better, except in the single-layer case. These findings provide guidelines for selecting QNN ansätze and offer new insights into the interplay between expressivity and trainability in quantum machine learning.

Related papers

• QCNN with Rough Path Signature Kernels [0.0]
  We propose a hybrid quantum-classical architecture that integrates recent advances in quantum neural networks with the mathematical framework of path signatures.<n>We evaluate several realizations of the proposed architecture, differing in QCNN configurations, on a binary classification task involving time series representations of handwritten digits.
  arXiv  Detail & Related papers  (2026-07-08T16:50:46Z)
• Data-Driven Deep MIMO Detection:Network Architectures and Generalization Analysis [50.20709408241935]
  This paper proposes inspecting the fully data-driven DeepSIC detection within a Network-of-MLPs architecture.<n>Within such an architecture, DeepSIC can be upgraded as a graph-based message-passing process using Graph Neural Networks (GNNs)<n>GNNSIC achieves excellent expressivity comparable to DeepSIC with substantially fewer trainable parameters.
  arXiv  Detail & Related papers  (2026-02-13T04:38:51Z)
• Enhancing Expressivity of Quantum Neural Networks Based on the SWAP test [0.0]
  quantum neural network (QNN) built exclusively from SWAP test circuits.<n>We discuss its mathematical equivalence to a classical two-layer feedforward network with quadratic activation functions under amplitude encoding.<n>We introduce a circuit modification using generalized SWAP test circuits that effectively implements classical neural networks with product layers.
  arXiv  Detail & Related papers  (2025-06-20T12:05:31Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Parallel Proportional Fusion of Spiking Quantum Neural Network for Optimizing Image Classification [10.069224006497162]
  We introduce a novel architecture termed Parallel Proportional Fusion of Quantum and Spiking Neural Networks (PPF-QSNN) The proposed PPF-QSNN outperforms both the existing spiking neural network and the serial quantum neural network across metrics such as accuracy, loss, and robustness. This study lays the groundwork for the advancement and application of quantum advantage in artificial intelligent computations.
  arXiv  Detail & Related papers  (2024-04-01T10:35:35Z)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)
• 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)
• Power and limitations of single-qubit native quantum neural networks [5.526775342940154]
  Quantum neural networks (QNNs) have emerged as a leading strategy to establish applications in machine learning, chemistry, and optimization. We formulate a theoretical framework for the expressive ability of data re-uploading quantum neural networks.
  arXiv  Detail & Related papers  (2022-05-16T17:58:27Z)
• The dilemma of quantum neural networks [63.82713636522488]
  We show that quantum neural networks (QNNs) fail to provide any benefit over classical learning models. QNNs suffer from the severely limited effective model capacity, which incurs poor generalization on real-world datasets. These results force us to rethink the role of current QNNs and to design novel protocols for solving real-world problems with quantum advantages.
  arXiv  Detail & Related papers  (2021-06-09T10:41:47Z)
• Branching Quantum Convolutional Neural Networks [0.0]
  Small-scale quantum computers are already showing potential gains in learning tasks on large quantum and very large classical data sets. We present a generalization of QCNN, the branching quantum convolutional neural network, or bQCNN, with substantially higher expressibility.
  arXiv  Detail & Related papers  (2020-12-28T19:00:03Z)

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.