A Grover-search Based Quantum Learning Scheme for Classification

Abstract

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.

final version

References in corpus (12)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Quantum Convolutional Neural Networks
• Parameterized quantum circuits as machine learning models
• Evaluating analytic gradients on quantum hardware
• Learning phase transitions by confusion
• The Expressive Power of Parameterized Quantum Circuits
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• No evidence for dynamical dark energy in two models
• On the learnability of quantum neural networks
• A Quantum-inspired Algorithm for General Minimum Conical Hull Problems

Cited by in corpus (10)

• Quantum circuit architecture search for variational quantum algorithms
• Efficient measure for the expressivity of variational quantum algorithms
• The Unified Effect of Data Encoding, Ansatz Expressibility and Entanglement on the Trainability of HQNNs
• On exploring the potential of quantum auto-encoder for learning quantum systems
• Simulation of a Variational Quantum Perceptron using Grover's Algorithm
• The dilemma of quantum neural networks
• Quadratic Quantum Speedup for Perceptron Training
• Accelerating variational quantum algorithms with multiple quantum processors
• Quantum algorithm for unstructured search of ranked targets
• IGO-QNN: Quantum Neural Network Architecture for Inductive Grover Oracularization