Quantum Incremental Learning with Mixed State Prototypes

• URL: http://arxiv.org/abs/2608.10464v1
• Date: Tue, 11 Aug 2026 04:22:42 GMT
• Title: Quantum Incremental Learning with Mixed State Prototypes
• Abstract summary: We introduce a novel quantum incremental learning framework based on trainable mixed-state prototypes.<n>Our model achieves high-dimensional feature concentration using a minimal number of qubits.
• Score: 53.319426778720434
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Incremental learning models are required to learn new classes sequentially without catastrophic forgetting, while operating under parameter and memory constraints. In the Noisy Intermediate-Scale Quantum (NISQ) era, although quantum neural networks offer advantages in feature mapping, hardware limitations restrict circuit width. Furthermore, traditional quantum classifiers are constrained by the number of orthogonal basis states, limiting their capacity to accommodate a continually growing number of categories. Thus, we introduce a novel quantum incremental learning framework based on trainable mixed-state prototypes. Its original design incorporates new classes by adding class prototypes rather than increasing the circuit width of the shared quantum backbone. The use of mixed-state prototypes is another key contribution, since they have representation capabilities to represent information than a single pure-state prototype. And the decomposable mixed-state calculation provides lower production costs and a convenient Hilbert-Schmidt (HS) distance metric for classification. Simulation results show that our model achieves high-dimensional feature concentration using a minimal number of qubits, while demonstrating lower computational complexity and robust representation in incremental learning tasks compared with classical baselines.

Related papers

• Hybrid Classical-Quantum Transfer Learning with Noisy Quantum Circuits [0.0]
  We introduce a family of compact quantum transfer learning architectures for image classification.<n>We instantiate and evaluate several classical-quantum hybrid models implemented in PennyLane and Qiskit.<n> Experimental results show that the proposed quantum transfer learning architectures achieve competitive and, in several cases, superior accuracy.
  arXiv  Detail & Related papers  (2026-03-17T12:28:33Z)
• Quantum LEGO Learning: A Modular Design Principle for Hybrid Artificial Intelligence [63.39968536637762]
  We introduce Quantum LEGO Learning, a learning framework that treats classical and quantum components as reusable, composable learning blocks.<n>Within this framework, a pre-trained classical neural network serves as a frozen feature block, while a VQC acts as a trainable adaptive module.<n>We develop a block-wise generalization theory that decomposes learning error into approximation and estimation components.
  arXiv  Detail & Related papers  (2026-01-29T14:29:21Z)
• Readout-Side Bypass for Residual Hybrid Quantum-Classical Models [3.609274776085931]
  Quantum machine learning (QML) promises compact and expressive representations, but suffers from measurement bottleneck.<n>We propose a lightweight residual hybrid architecture that confirms quantum features with raw inputs before classification.<n>Our model achieves up to +55% accuracy improvement over quantum baselines, while retaining low communication cost and enhanced privacy robustness.
  arXiv  Detail & Related papers  (2025-11-25T23:27:53Z)
• Entanglement and Classical Simulability in Quantum Extreme Learning Machines [0.0]
  We investigate Quantum Extreme Learning Machines (QELMs), a quantum analogue of classical Extreme Learning Machines.<n>Our architecture combines dimensionality reduction (via PCA or Autoencoders), quantum state encoding, evolution under an XX Hamiltonian, and projective measurement.<n>We show that this performance enhancement correlates with the onset of entanglement, which improves the embedding of classical data.
  arXiv  Detail & Related papers  (2025-09-08T16:43:37Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Single-Qudit Quantum Neural Networks for Multiclass Classification [0.0]
  This paper proposes a single-qudit quantum neural network for multiclass classification.<n>Our design employs an $d$-dimensional unitary operator, where $d$ corresponds to the number of classes.<n>We evaluate our model on the MNIST and EMNIST datasets, demonstrating competitive accuracy.
  arXiv  Detail & Related papers  (2025-03-12T11:12:05Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Ensemble-learning variational shallow-circuit quantum classifiers [4.104704267247209]
  We propose two ensemble-learning classification methods, namely bootstrap aggregating and adaptive boosting. The protocols have been exemplified for classical handwriting digits as well as quantum phase discrimination of a symmetry-protected topological Hamiltonian.
  arXiv  Detail & Related papers  (2023-01-30T07:26:35Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)

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.