Metaheuristic optimization scheme for quantum kernel classifiers using entanglement-directed graphs

Abstract

Entanglement is crucial for achieving quantum advantages. However, in the context of quantum machine learning, existing optimization strategies for generating quantum classifier circuits often result in unentangled circuits, indicating an underutilization of the entanglement effect needed to learn complex patterns. In this study, we proposed a novel metaheuristic approach-genetic algorithm for designing a quantum kernel classifier that incorporates expressive entanglement. This classifier utilizes a loopless entanglement-directed graph, where each directed edge represents the entanglement between the target and control qubits. The proposed method consistently outperforms classical and quantum baselines across various artificial and actual datasets, achieving improvements up to 32.4% and 17.5%, respectively, compared with the best model among all other baselines. Moreover, this method successfully reconstructs the hidden entanglement structures underlying artificial datasets. The results also demonstrate that the optimized circuits exhibit diverse entanglement variations across different datasets, indicating the versatility of the proposed approach.

Keywords

• entanglement-directed graphs
• genetic algorithm
• optimization scheme
• quantum kernels
• quantum machine learning