scholarly journals Machine Learning Based Parameter Estimation of Gaussian Quantum States

Author(s):  
Neel Kanth Kundu ◽  
Matthew R. Mckay ◽  
Ranjan K. Mallik
2021 ◽  
Author(s):  
Herdiantri Sufriyana ◽  
Yu Wei Wu ◽  
Emily Chia-Yu Su

Abstract We aimed to provide a resampling protocol for dimensional reduction resulting a few latent variables. The applicability focuses on but not limited for developing a machine learning prediction model in order to improve the number of sample size in relative to the number of candidate predictors. By this feature representation technique, one can improve generalization by preventing latent variables to overfit data used to conduct the dimensional reduction. However, this technique may warrant more computational capacity and time to conduct the procedure. The key stages consisted of derivation of latent variables from multiple resampling subsets, parameter estimation of latent variables in population, and selection of latent variables transformed by the estimated parameters.


Author(s):  
Maiyuren Srikumar ◽  
Charles Daniel Hill ◽  
Lloyd Hollenberg

Abstract Quantum machine learning (QML) is a rapidly growing area of research at the intersection of classical machine learning and quantum information theory. One area of considerable interest is the use of QML to learn information contained within quantum states themselves. In this work, we propose a novel approach in which the extraction of information from quantum states is undertaken in a classical representational-space, obtained through the training of a hybrid quantum autoencoder (HQA). Hence, given a set of pure states, this variational QML algorithm learns to identify – and classically represent – their essential distinguishing characteristics, subsequently giving rise to a new paradigm for clustering and semi-supervised classification. The analysis and employment of the HQA model are presented in the context of amplitude encoded states – which in principle can be extended to arbitrary states for the analysis of structure in non-trivial quantum data sets.


2020 ◽  
Author(s):  
Grigory Sabinin ◽  
Tatiana Chichinina ◽  
Vadim Tulchinsky ◽  
Manuel Romero-Salcedo

2018 ◽  
Vol 120 (24) ◽  
Author(s):  
Jun Gao ◽  
Lu-Feng Qiao ◽  
Zhi-Qiang Jiao ◽  
Yue-Chi Ma ◽  
Cheng-Qiu Hu ◽  
...  

1997 ◽  
Vol 36 (6) ◽  
pp. 1269-1288 ◽  
Author(s):  
Masashi Ban ◽  
Keiko Kurokawa ◽  
Rei Momose ◽  
Osamu Hirota

2014 ◽  
Vol 89 (2) ◽  
Author(s):  
Satoshi Hara ◽  
Takafumi Ono ◽  
Ryo Okamoto ◽  
Takashi Washio ◽  
Shigeki Takeuchi

2021 ◽  
Author(s):  
Mu Yue

In high-dimensional data, penalized regression is often used for variable selection and parameter estimation. However, these methods typically require time-consuming cross-validation methods to select tuning parameters and retain more false positives under high dimensionality. This chapter discusses sparse boosting based machine learning methods in the following high-dimensional problems. First, a sparse boosting method to select important biomarkers is studied for the right censored survival data with high-dimensional biomarkers. Then, a two-step sparse boosting method to carry out the variable selection and the model-based prediction is studied for the high-dimensional longitudinal observations measured repeatedly over time. Finally, a multi-step sparse boosting method to identify patient subgroups that exhibit different treatment effects is studied for the high-dimensional dense longitudinal observations. This chapter intends to solve the problem of how to improve the accuracy and calculation speed of variable selection and parameter estimation in high-dimensional data. It aims to expand the application scope of sparse boosting and develop new methods of high-dimensional survival analysis, longitudinal data analysis, and subgroup analysis, which has great application prospects.


Sign in / Sign up

Export Citation Format

Share Document