It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
In recent years, an increasing number of studies about quantum machine learning not only provide powerful tools for quantum chemistry and quantum physics but also improve the classical learning algorithm. The hybrid quantum-classical framework, which is constructed by a variational quantum circuit (VQC) and an optimizer, plays a key role in the latest quantum machine learning studies. Nevertheless, in these hybridframework-based quantum machine learning models, the VQC is mainly constructed with a fixed structure and this structure causes inflexibility problems. There are also few studies focused on comparing the performance of quantum generative models with different loss functions. In this study, we address the inflexibility problem by adopting the variable-depth VQC model to automatically change the structure of the quantum circuit according to the qBAS score. The basic idea behind the variable-depth VQC is to consider the depth of the quantum circuit as a parameter during the training. Meanwhile, we compared the performance of the variable-depth VQC model based on four widely used statistical distances set as the loss functions, including Kullback-Leibler divergence (KL-divergence), Jensen-Shannon divergence (JS-divergence), total variation distance, and maximum mean discrepancy. Our numerical experiment shows a promising result that the variable-depth VQC model works better than the original VQC in the generative learning tasks.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer