Quantum Embedding Search for Quantum Machine Learning

Abstract

This paper introduces a novel quantum embedding search algorithm (QES, pronounced as "quest"), enabling search for optimal quantum embedding design for a specific dataset of interest. First, we establish the connection between the structures of quantum embedding and the representations of directed multi-graphs, enabling a well-defined search space. Second, we instigate the entanglement level to reduce the cardinality of the search space to a feasible size for practical implementations. Finally, we mitigate the cost of evaluating the true loss function by using surrogate models via sequential model-based optimization. We demonstrate the feasibility of our proposed approach on synthesis and Iris datasets, which empirically shows that found quantum embedding architecture by QES outperforms manual designs whereas achieving comparable performance to classical machine learning models.

References in corpus (11)

• Practical Bayesian Optimization of Machine Learning Algorithms
• Neural Architecture Search with Reinforcement Learning
• A Quantum Approximate Optimization Algorithm
• Quantum-enhanced machine learning
• Supervised quantum machine learning models are kernel methods
• Learning to learn with quantum neural networks via classical neural networks
• Quantum approximate optimization is computationally universal
• Quantum circuit optimization with deep reinforcement learning
• Optimizing Ansatz Design in QAOA for Max-cut
• Quantum supremacy and high-dimensional integration
• Translational Quantum Machine Intelligence for Modeling Tumor Dynamics in Oncology

Cited by in corpus (2)

• Quantum Architecture Search: A Survey
• Quantum Convolutional Neural Networks with Interaction Layers for Classification of Classical Data