Alert button
Picture for Min-Hsiu Hsieh

Min-Hsiu Hsieh

Alert button

Demystify Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification

Dec 29, 2022
Yuxuan Du, Yibo Yang, Dacheng Tao, Min-Hsiu Hsieh

Figure 1 for Demystify Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification
Figure 2 for Demystify Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification
Figure 3 for Demystify Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification

Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Some QNNs with specific encoding methods can be efficiently simulated by classical surrogates, while others with quantum memory may perform better than classical classifiers. Here we systematically investigate the problem-dependent power of quantum neural classifiers (QCs) on multi-class classification tasks. Through the analysis of expected risk, a measure that weighs the training loss and the generalization error of a classifier jointly, we identify two key findings: first, the training loss dominates the power rather than the generalization ability; second, QCs undergo a U-shaped risk curve, in contrast to the double-descent risk curve of deep neural classifiers. We also reveal the intrinsic connection between optimal QCs and the Helstrom bound and the equiangular tight frame. Using these findings, we propose a method that uses loss dynamics to probe whether a QC may be more effective than a classical classifier on a particular learning task. Numerical results demonstrate the effectiveness of our approach to explain the superiority of QCs over multilayer Perceptron on parity datasets and their limitations over convolutional neural networks on image datasets. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.

Viaarxiv icon

Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

Oct 24, 2022
Chen-Yu Liu, Hsin-Yu Wang, Pei-Yen Liao, Ching-Jui Lai, Min-Hsiu Hsieh

Figure 1 for Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer
Figure 2 for Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer
Figure 3 for Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer
Figure 4 for Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

Factorization Machine (FM) is the most commonly used model to build a recommendation system since it can incorporate side information to improve performance. However, producing item suggestions for a given user with a trained FM is time-consuming. It requires a run-time of $O((N_m \log N_m)^2)$, where $N_m$ is the number of items in the dataset. To address this problem, we propose a quadratic unconstrained binary optimization (QUBO) scheme to combine with FM and apply quantum annealing (QA) computation. Compared to classical methods, this hybrid algorithm provides a faster than quadratic speedup in finding good user suggestions. We then demonstrate the aforementioned computational advantage on current NISQ hardware by experimenting with a real example on a D-Wave annealer.

* 9 pages, 4 figures 
Viaarxiv icon

Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression

Jun 08, 2022
Jun Qi, Chao-Han Huck Yang, Pin-Yu Chen, Min-Hsiu Hsieh

Figure 1 for Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression
Figure 2 for Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression
Figure 3 for Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression
Figure 4 for Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression

The noisy intermediate-scale quantum (NISQ) devices enable the implementation of the variational quantum circuit (VQC) for quantum neural networks (QNN). Although the VQC-based QNN has succeeded in many machine learning tasks, the representation and generalization powers of VQC still require further investigation, particularly when the dimensionality reduction of classical inputs is concerned. In this work, we first put forth an end-to-end quantum neural network, namely, TTN-VQC, which consists of a quantum tensor network based on a tensor-train network (TTN) for dimensionality reduction and a VQC for functional regression. Then, we aim at the error performance analysis for the TTN-VQC in terms of representation and generalization powers. We also characterize the optimization properties of TTN-VQC by leveraging the Polyak-Lojasiewicz (PL) condition. Moreover, we conduct the experiments of functional regression on a handwritten digit classification dataset to justify our theoretical analysis.

* Preprint version. 16 pages 
Viaarxiv icon

Recent Advances for Quantum Neural Networks in Generative Learning

Jun 07, 2022
Jinkai Tian, Xiaoyu Sun, Yuxuan Du, Shanshan Zhao, Qing Liu, Kaining Zhang, Wei Yi, Wanrong Huang, Chaoyue Wang, Xingyao Wu, Min-Hsiu Hsieh, Tongliang Liu, Wenjing Yang, Dacheng Tao

Figure 1 for Recent Advances for Quantum Neural Networks in Generative Learning
Figure 2 for Recent Advances for Quantum Neural Networks in Generative Learning
Figure 3 for Recent Advances for Quantum Neural Networks in Generative Learning
Figure 4 for Recent Advances for Quantum Neural Networks in Generative Learning

Quantum computers are next-generation devices that hold promise to perform calculations beyond the reach of classical computers. A leading method towards achieving this goal is through quantum machine learning, especially quantum generative learning. Due to the intrinsic probabilistic nature of quantum mechanics, it is reasonable to postulate that quantum generative learning models (QGLMs) may surpass their classical counterparts. As such, QGLMs are receiving growing attention from the quantum physics and computer science communities, where various QGLMs that can be efficiently implemented on near-term quantum machines with potential computational advantages are proposed. In this paper, we review the current progress of QGLMs from the perspective of machine learning. Particularly, we interpret these QGLMs, covering quantum circuit born machines, quantum generative adversarial networks, quantum Boltzmann machines, and quantum autoencoders, as the quantum extension of classical generative learning models. In this context, we explore their intrinsic relation and their fundamental differences. We further summarize the potential applications of QGLMs in both conventional machine learning tasks and quantum physics. Last, we discuss the challenges and further research directions for QGLMs.

* The first two authors contributed equally to this work 
Viaarxiv icon

Gaussian initializations help deep variational quantum circuits escape from the barren plateau

Mar 17, 2022
Kaining Zhang, Min-Hsiu Hsieh, Liu Liu, Dacheng Tao

Figure 1 for Gaussian initializations help deep variational quantum circuits escape from the barren plateau
Figure 2 for Gaussian initializations help deep variational quantum circuits escape from the barren plateau
Figure 3 for Gaussian initializations help deep variational quantum circuits escape from the barren plateau
Figure 4 for Gaussian initializations help deep variational quantum circuits escape from the barren plateau

Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks. In this work, we propose an initialization strategy with theoretical guarantees for the vanishing gradient problem in general deep circuits. Specifically, we prove that under proper Gaussian initialized parameters, the norm of the gradient decays at most polynomially when the qubit number and the circuit depth increase. Our theoretical results hold for both the local and the global observable cases, where the latter was believed to have vanishing gradients even for shallow circuits. Experimental results verify our theoretical findings in the quantum simulation and quantum chemistry.

* Comments welcome! 
Viaarxiv icon

Capacity of First Arrival Position Channel in Diffusion-Based Molecular Communication

Jan 27, 2022
Yen-Chi Lee, Min-Hsiu Hsieh

In [1], the impulse response of the first arrival position (FAP) channel of 2D and 3D spaces in molecular communication (MC) is derived, but its Shannon capacity remains open. The main difficulty of depicting the FAP channel capacity comes from the fact that the FAP density becomes a multi-dimensional Cauchy distribution when the drift velocity approaches zero. As a result, the commonly used techniques in maximizing the mutual information no longer work because the first and second moments of Cauchy distributions do not exist. Our main contribution in this paper is a complete characterization of the zero-drift FAP channel capacity for the 2D and 3D spaces. The capacity formula for FAP channel turns out to have a similar form compared to the Gaussian channel case (under second-moment power constraint). It is also worth mentioning that the capacity value of 3D FAP channel is twice as large as 2D FAP channel. This is an evidence that the FAP channel has larger capacity as the spatial dimension grows. Finally, our technical contributions are the application of a modified logarithmic constraint as a replacement of the usual power constraint, and the choice of output signal constraint as a substitution to input signal constraint in order to keep the resulting formula concise.

Viaarxiv icon

First Arrival Position in Molecular Communication Via Generator of Diffusion Semigroup

Jan 14, 2022
Yen-Chi Lee, Jen-Ming Wu, Min-Hsiu Hsieh

Figure 1 for First Arrival Position in Molecular Communication Via Generator of Diffusion Semigroup
Figure 2 for First Arrival Position in Molecular Communication Via Generator of Diffusion Semigroup
Figure 3 for First Arrival Position in Molecular Communication Via Generator of Diffusion Semigroup

We consider the problem of characterizing the first arrival position (FAP) density in molecular communication (MC) with a diffusion-advection channel that permits a constant drift velocity pointed to arbitrary direction. The advantage of FAP modulation lies in the fact that it could encode more information into higher dimensional spatial variables, compared to other modulation techniques using time or molecule numbers. However, effective methods to characterize the FAP density in a general framework do not exist. In this paper, we devise a methodology that fully resolves the FAP density with planar absorbing receivers in arbitrary dimensions. Our work recovers existing results of FAP in 2D and 3D as special cases. The key insight of our approach is to remove the time dependence of the MC system evolution based on the generator of diffusion semigroups.

Viaarxiv icon

Quantum Optimization for Training Quantum Neural Networks

Mar 31, 2021
Yidong Liao, Min-Hsiu Hsieh, Chris Ferrie

Figure 1 for Quantum Optimization for Training Quantum Neural Networks
Figure 2 for Quantum Optimization for Training Quantum Neural Networks
Figure 3 for Quantum Optimization for Training Quantum Neural Networks
Figure 4 for Quantum Optimization for Training Quantum Neural Networks

Training quantum neural networks (QNNs) using gradient-based or gradient-free classical optimisation approaches is severely impacted by the presence of barren plateaus in the cost landscapes. In this paper, we devise a framework for leveraging quantum optimisation algorithms to find optimal parameters of QNNs for certain tasks. To achieve this, we coherently encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum optimisation structure using adaptively selected Hamiltonians. The quantum mechanism of this framework exploits hidden structure in the QNN optimisation problem and hence is expected to provide beyond-Grover speed up, mitigating the barren plateau issue.

* 35 pages, 30 figures, 1 animation 
Viaarxiv icon

Quantum circuit architecture search: error mitigation and trainability enhancement for variational quantum solvers

Nov 12, 2020
Yuxuan Du, Tao Huang, Shan You, Min-Hsiu Hsieh, Dacheng Tao

Figure 1 for Quantum circuit architecture search: error mitigation and trainability enhancement for variational quantum solvers
Figure 2 for Quantum circuit architecture search: error mitigation and trainability enhancement for variational quantum solvers
Figure 3 for Quantum circuit architecture search: error mitigation and trainability enhancement for variational quantum solvers
Figure 4 for Quantum circuit architecture search: error mitigation and trainability enhancement for variational quantum solvers

Quantum error mitigation techniques are at the heart of quantum hardware implementation, and are the key to performance improvement of the variational quantum learning scheme (VQLS). Although VQLS is partially robust to noise, both empirical and theoretical results exhibit that noise would rapidly deteriorate the performance of most variational quantum algorithms in large-scale problems. Furthermore, VQLS suffers from the barren plateau phenomenon---the gradient generated by the classical optimizer vanishes exponentially with respect to the qubit number. Here we devise a resource and runtime efficient scheme, the quantum architecture search scheme (QAS), to maximally improve the robustness and trainability of VQLS. In particular, given a learning task, QAS actively seeks an optimal circuit architecture to balance benefits and side-effects brought by adding more quantum gates. Specifically, while more quantum gates enable a stronger expressive power of the quantum model, they introduce a larger amount of noise and a more serious barren plateau scenario. Consequently, QAS can effectively suppress the influence of quantum noise and barren plateaus. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks. Numerical and experimental results show that QAS significantly outperforms conventional variational quantum algorithms with heuristic circuit architectures. Our work provides practical guidance for developing advanced learning-based quantum error mitigation techniques on near-term quantum devices.

* 8+9 pages. See also a concurrent paper that appeared yesterday [arXiv:2010.08561] 
Viaarxiv icon

Experimental Quantum Generative Adversarial Networks for Image Generation

Oct 21, 2020
He-Liang Huang, Yuxuan Du, Ming Gong, Youwei Zhao, Yulin Wu, Chaoyue Wang, Shaowei Li, Futian Liang, Jin Lin, Yu Xu, Rui Yang, Tongliang Liu, Min-Hsiu Hsieh, Hui Deng, Hao Rong, Cheng-Zhi Peng, Chao-Yang Lu, Yu-Ao Chen, Dacheng Tao, Xiaobo Zhu, Jian-Wei Pan

Figure 1 for Experimental Quantum Generative Adversarial Networks for Image Generation
Figure 2 for Experimental Quantum Generative Adversarial Networks for Image Generation
Figure 3 for Experimental Quantum Generative Adversarial Networks for Image Generation
Figure 4 for Experimental Quantum Generative Adversarial Networks for Image Generation

Quantum machine learning is expected to be one of the first practical applications of near-term quantum devices. Pioneer theoretical works suggest that quantum generative adversarial networks (GANs) may exhibit a potential exponential advantage over classical GANs, thus attracting widespread attention. However, it remains elusive whether quantum GANs implemented on near-term quantum devices can actually solve real-world learning tasks. Here, we devise a flexible quantum GAN scheme to narrow this knowledge gap, which could accomplish image generation with arbitrarily high-dimensional features, and could also take advantage of quantum superposition to train multiple examples in parallel. For the first time, we experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor. Moreover, we utilize a gray-scale bar dataset to exhibit the competitive performance between quantum GANs and the classical GANs based on multilayer perceptron and convolutional neural network architectures, respectively, benchmarked by the Fr\'echet Distance score. Our work provides guidance for developing advanced quantum generative models on near-term quantum devices and opens up an avenue for exploring quantum advantages in various GAN-related learning tasks.

* Our first version was submitted to the journal in January 2020. Comments are welcome 
Viaarxiv icon