Pith. sign in

Quantum Hamiltonian Embedding of Images for Data Reuploading Classifiers

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

When applying quantum computing to machine learning tasks, one of the first considerations is the design of the quantum machine learning model itself. Conventionally, the design of quantum machine learning algorithms relies on the ``quantisation" of classical learning algorithms, such as using quantum linear algebra to implement important subroutines of classical algorithms, if not the entire algorithm, seeking to achieve quantum advantage through possible run-time accelerations brought by quantum computing. However, recent research has started questioning whether quantum advantage via speedup is the right goal for quantum machine learning [1]. Research also has been undertaken to exploit properties that are unique to quantum systems, such as quantum contextuality, to better design quantum machine learning models [2]. In this paper, we take an alternative approach by incorporating the heuristics and empirical evidences from the design of classical deep learning algorithms to the design of quantum neural networks. We first construct a model based on the data reuploading circuit [3] with the quantum Hamiltonian data embedding unitary [4]. Through numerical experiments on images datasets, including the famous MNIST and FashionMNIST datasets, we demonstrate that our model outperforms the quantum convolutional neural network (QCNN)[5] by a large margin (up to over 40% on MNIST test set). Based on the model design process and numerical results, we then laid out six principles for designing quantum machine learning models, especially quantum neural networks.

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Quantum Recurrent Embedding Neural Network

quant-ph · 2025-06-16 · conditional · novelty 6.0

A quantum recurrent embedding neural network is proven to avoid barren plateaus via a dynamical Lie algebra decomposition, with applications to Hamiltonian and topological phase classification.

citing papers explorer

Showing 1 of 1 citing paper.

  • Quantum Recurrent Embedding Neural Network quant-ph · 2025-06-16 · conditional · none · ref 73 · internal anchor

    A quantum recurrent embedding neural network is proven to avoid barren plateaus via a dynamical Lie algebra decomposition, with applications to Hamiltonian and topological phase classification.