Quantum Embedding Search for Quantum Machine Learning
- URL: http://arxiv.org/abs/2105.11853v1
- Date: Tue, 25 May 2021 11:50:57 GMT
- Title: Quantum Embedding Search for Quantum Machine Learning
- Authors: Nam Nguyen and Kwang-Chen Chen
- Abstract summary: We introduce a novel quantum embedding search algorithm (QES), pronounced as "quest"
We establish the connection between the structures of quantum embedding and the representations of directed multi-graphs, enabling a well-defined search space.
We demonstrate the feasibility of our proposed approach on synthesis and Iris datasets, which empirically shows that quantum embedding architecture by QES outperforms manual designs.
- Score: 2.7612093695074456
- License: http://creativecommons.org/licenses/by/4.0/
- 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.
Related papers
- Strategic Data Re-Uploads: A Pathway to Improved Quantum Classification Data Re-Uploading Strategies for Improved Quantum Classifier Performance [0.0]
Re-uploading classical information into quantum states multiple times can enhance the accuracy of quantum classifiers.
We demonstrate our approach to two classification patterns: a linear classification pattern (LCP) and a non-linear classification pattern (NLCP)
arXiv Detail & Related papers (2024-05-15T14:28:00Z) - Qubit-Wise Architecture Search Method for Variational Quantum Circuits [11.790545710021593]
We propose a novel qubit-wise architec-ture search (QWAS) method, which progres-sively search one-qubit configuration per stage.
Our proposed method can balance the exploration and exploitation of cir-cuit performance and size in some real-world tasks, such as MNIST, Fashion and MOSI.
arXiv Detail & Related papers (2024-03-07T07:08:57Z) - Quantum Data Encoding: A Comparative Analysis of Classical-to-Quantum
Mapping Techniques and Their Impact on Machine Learning Accuracy [0.0]
This research explores the integration of quantum data embedding techniques into classical machine learning (ML) algorithms.
Our findings reveal that quantum data embedding contributes to improved classification accuracy and F1 scores.
arXiv Detail & Related papers (2023-11-17T08:00:08Z) - Multimodal deep representation learning for quantum cross-platform
verification [60.01590250213637]
Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms.
We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities.
We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
arXiv Detail & Related papers (2023-11-07T04:35:03Z) - Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model.
We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
arXiv Detail & Related papers (2023-05-18T03:08:18Z) - A Framework for Demonstrating Practical Quantum Advantage: Racing
Quantum against Classical Generative Models [62.997667081978825]
We build over a proposed framework for evaluating the generalization performance of generative models.
We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models.
Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
arXiv Detail & Related papers (2023-03-27T22:48:28Z) - A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
We focus on the case of learning with a single qubit, using data re-uploading techniques.
We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
arXiv Detail & Related papers (2022-11-23T18:25:32Z) - Generalization Metrics for Practical Quantum Advantage in Generative
Models [68.8204255655161]
Generative modeling is a widely accepted natural use case for quantum computers.
We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance.
Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
arXiv Detail & Related papers (2022-01-21T16:35:35Z) - Quantum Machine Learning with SQUID [64.53556573827525]
We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems.
We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
arXiv Detail & Related papers (2021-04-30T21:34:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.