# A Grover-search Based Quantum Learning Scheme for Classification

arXiv: https://arxiv.org/abs/1809.06056 · HTML: https://mlsanity.com/paper/1809.06056/

## Key facts

- Cited by 12 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Sep 2018.

## Built on by (most cited first, 12 of 12)

- [Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression](https://mlsanity.com/paper/2206.04804/) (2022)
- [The dilemma of quantum neural networks](https://mlsanity.com/paper/2106.04975/) (2021)
- [Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification](https://mlsanity.com/paper/2301.01597/) (2022)
- [Enhancing Quantum Adversarial Robustness by Randomized Encodings](https://mlsanity.com/paper/2212.02531/) (2022)
- [Simulation of a Variational Quantum Perceptron using Grover's Algorithm](https://mlsanity.com/paper/2305.11040/) (2023)
- [Accelerating variational quantum algorithms with multiple quantum processors](https://mlsanity.com/paper/2106.12819/) (2021)
- [Quark: A Gradient-Free Quantum Learning Framework for Classification Tasks](https://mlsanity.com/paper/2210.01311/) (2022)
- [Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer](https://mlsanity.com/paper/2210.12953/) (2022)
- [Provable advantages of kernel-based quantum learners and quantum preprocessing based on Grover's algorithm](https://mlsanity.com/paper/2309.14406/) (2023)
- [IGO-QNN: Quantum Neural Network Architecture for Inductive Grover Oracularization](https://mlsanity.com/paper/2105.11603/) (2021)
- [Quantum-Enhanced Weight Optimization for Neural Networks Using Grover's Algorithm](https://mlsanity.com/paper/2504.14568/) (2025)
- [Toward Generative Quantum Utility via Correlation-Complexity Map](https://mlsanity.com/paper/2603.06440/) (2026)

## Abstract (arXiv)

The hybrid quantum-classical learning scheme provides a prominent way to achieve quantum advantages on near-term quantum devices. A concrete example towards this goal is the quantum neural network (QNN), which has been developed to accomplish various supervised learning tasks such as classification and regression. However, there are two central issues that remain obscure when QNN is exploited to accomplish classification tasks. First, a quantum classifier that can well balance the computational cost such as the number of measurements and the learning performance is unexplored. Second, it is unclear whether quantum classifiers can be applied to solve certain problems that outperform their classical counterparts. Here we devise a Grover-search based quantum learning scheme (GBLS) to address the above two issues. Notably, most existing QNN-based quantum classifiers can be seamlessly embedded into the proposed scheme. The key insight behind our proposal is reformulating the classification tasks as the search problem. Numerical simulations exhibit that GBLS can achieve comparable performance with other quantum classifiers under various noise settings, while the required number of measurements is dramatically reduced. We further demonstrate a potential quantum advantage of GBLS over classical classifiers in the measure of query complexity. Our work provides guidance to develop advanced quantum classifiers on near-term quantum devices and opens up an avenue to explore potential quantum advantages in various classification tasks.
