Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Hierarchical quantum classifiers

Edward Grant, Marcello Benedetti, Cao, S, Hallam, A, Joshua Lockhart, Stojevic, V, Andrew G. Green, Simone Severini B

Published Dec 1, 2018• 267 citations
OpenAlex

Related papers

Quantum classifier with tailored quantum kernel

Kyungdeock Park, Carsten Blank, June‐Koo Kevin Rhee +1 more

Bulletin of the American Physical Society•Mar 2, 2020•0 citations

On quantum ensembles of quantum classifiers

Amira Abbas, Maria Schuld, Francesco Petruccione

Quantum Machine Intelligence•Jun 1, 2020•34 citations

Towards a dissipative quantum classifier

He Wang, Chuanbo Liu, Jin Wang

arXiv:2310.10254•Physics Letters A•May 25, 2026•1 citation

Hierarchical Quantum Classification

Prashant Gohel, Manjunath V. Joshi

Lecture notes in networks and systems•Jan 1, 2025•0 citations

Hierarchical quantum classifiers

Edward Grant, Marcello Benedetti, Shuxiang Cao +5 more

Abstract Quantum circuits with hierarchical structure have been used to perform binary classification of classical data encoded in a quantum state. We demonstrate that more expressive circuits in the same family achieve better accuracy and can be used to classify highly entangled quantum states, for which there is no known efficient classical method. We compare performance for several different parameterizations on two classical machine learning datasets, Iris and MNIST, and on a synthetic dataset of quantum states. Finally, we demonstrate that performance is robust to noise and deploy an Iris dataset classifier on the ibmqx4 quantum computer.

arXiv:1804.03680•npj Quantum Information•Dec 10, 2018•324 citations

Noise-adaptive hybrid quantum convolutional neural networks based on depth-stratified feature extraction

Taehyun Kim, Israel F. Araujo, Daniel K. Park

Hierarchical quantum classifiers, such as quantum convolutional neural networks (QCNNs), represent recent progress toward designing effective and feasible architectures for quantum classification. However, their performance on near-term quantum hardware remains highly sensitive to noise accumulation across circuit depth, calling for strategies beyond circuit-architecture design alone. We propose a noise-adaptive hybrid QCNN that improves classification under noise by exploiting depth-stratified intermediate measurements. Instead of discarding qubits removed during pooling operations, we measure them and use the resulting outcomes as classical features that are jointly processed by a classical neural network. This hybrid hierarchical design enables noise-adaptive inference by integrating quantum intermediate measurements with classical post-processing. Systematic experiments across multiple circuit sizes and noise settings, including hardware-calibrated noise models derived from IBM Quantum backend data, demonstrate more stable convergence, reduced loss variability, and consistently higher classification accuracy compared with standard QCNNs. Moreover, we observe that this performance advantage significantly amplifies as the circuit size increases, confirming that the hybrid architecture mitigates the scaling limitations of standard architectures. Notably, the multi-basis measurement variant attains performance close to the noiseless limit even under realistic noise. While demonstrated for QCNNs, the proposed depth-stratified feature extraction applies more broadly to hierarchical quantum classifiers that progressively discard qubits.

quant-pharXiv:2602.21953•Scientific Reports•Feb 26, 2026•0 citations
Abstract Quantum circuits with hierarchical structure have been used to perform binary classification of classical data encoded in a quantum state. We demonstrate that more expressive circuits in the same family achieve better accuracy and can be used to classify highly entangled quantum states, for which there is no known efficient classical method. We compare performance for several different parameterizations on two classical machine learning datasets, Iris and MNIST, and on a synthetic dataset of quantum states. Finally, we demonstrate that performance is robust to noise and deploy an Iris dataset classifier on the ibmqx4 quantum computer.
Hierarchical quantum classifiers, such as quantum convolutional neural networks (QCNNs), represent recent progress toward designing effective and feasible architectures for quantum classification. However, their performance on near-term quantum hardware remains highly sensitive to noise accumulation across circuit depth, calling for strategies beyond circuit-architecture design alone. We propose a noise-adaptive hybrid QCNN that improves classification under noise by exploiting depth-stratified intermediate measurements. Instead of discarding qubits removed during pooling operations, we measure them and use the resulting outcomes as classical features that are jointly processed by a classical neural network. This hybrid hierarchical design enables noise-adaptive inference by integrating quantum intermediate measurements with classical post-processing. Systematic experiments across multiple circuit sizes and noise settings, including hardware-calibrated noise models derived from IBM Quantum backend data, demonstrate more stable convergence, reduced loss variability, and consistently higher classification accuracy compared with standard QCNNs. Moreover, we observe that this performance advantage significantly amplifies as the circuit size increases, confirming that the hybrid architecture mitigates the scaling limitations of standard architectures. Notably, the multi-basis measurement variant attains performance close to the noiseless limit even under realistic noise. While demonstrated for QCNNs, the proposed depth-stratified feature extraction applies more broadly to hierarchical quantum classifiers that progressively discard qubits.