Hybrid Genetic Optimisation for Quantum Feature Map Design

Abstract

Kernel methods are an important class of techniques in machine learning. To be effective, good feature maps are crucial for mapping non-linearly separable input data into a higher dimensional (feature) space, thus allowing the data to be linearly separable in feature space. Previous work has shown that quantum feature map design can be automated for a given dataset using NSGA-II, a genetic algorithm, while both minimizing circuit size and maximizing classification accuracy. However, the evaluation of the accuracy achieved by a candidate feature map is costly. In this work, we demonstrate the suitability of kernel-target alignment as a substitute for accuracy in genetic algorithm-based quantum feature map design. Kernel-target alignment is faster to evaluate than accuracy and doesn't require some data points to be reserved for its evaluation. To further accelerate the evaluation of genetic fitness, we provide a method to approximate kernel-target alignment. To improve kernel-target alignment and root mean squared error, the final trainable parameters of the generated circuits are further trained using COBYLA to determine whether a hybrid approach applying conventional circuit parameter training can easily complement the genetic structure optimization approach. A total of eight new approaches are compared to the original across nine varied binary classification problems from the UCI machine learning repository, showing that kernel-target alignment and its approximation produce feature map circuits enabling comparable accuracy to the previous work but with larger margins on training data (in excess of 20\% larger) that improve further with circuit parameter training.

arXiv comment42 pages, 39 figures

References in corpus (14)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• pymoo: Multi-objective Optimization in Python
• Quantum support vector machine for big data classification
• Natural Language Processing: State of The Art, Current Trends and Challenges
• Quantum machine learning in feature Hilbert spaces
• Synthesis of Quantum Logic Circuits
• A rigorous and robust quantum speed-up in supervised machine learning
• Structure optimization for parameterized quantum circuits
• Training Quantum Embedding Kernels on Near-Term Quantum Computers
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• Automatic design of quantum feature maps
• Analysis and synthesis of feature map for kernel-based quantum classifier
• Generating quantum feature maps for SVM classifier

Cited by in corpus (3)

• Quantum autoencoders for image classification
• Enhanced feature encoding and classification on distributed quantum hardware
• Quantum feature-map learning with reduced resource overhead