Quantum-inspired classification via efficient simulation of Helstrom measurement

• URL: http://arxiv.org/abs/2403.15308v1
• Date: Fri, 22 Mar 2024 15:59:21 GMT
• Title: Quantum-inspired classification via efficient simulation of Helstrom measurement
• Authors: Wooseop Hwang, Daniel K. Park, Israel F. Araujo, Carsten Blank,
• Abstract summary: The Helstrom measurement (HM) is known to be the optimal strategy for distinguishing non-orthogonal quantum states with minimum error. We present an efficient simulation method for an arbitrary number of copies by utilizing the relationship between HM and state fidelity. Our method reveals that the classification performance does not improve monotonically with the number of data copies.
• Score: 0.3749861135832073
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Helstrom measurement (HM) is known to be the optimal strategy for distinguishing non-orthogonal quantum states with minimum error. Previously, a binary classifier based on classical simulation of the HM has been proposed. It was observed that using multiple copies of the sample data reduced the classification error. Nevertheless, the exponential growth in simulation runtime hindered a comprehensive investigation of the relationship between the number of copies and classification performance. We present an efficient simulation method for an arbitrary number of copies by utilizing the relationship between HM and state fidelity. Our method reveals that the classification performance does not improve monotonically with the number of data copies. Instead, it needs to be treated as a hyperparameter subject to optimization, achievable only through the method proposed in this work. We present a Quantum-Inspired Machine Learning binary classifier with excellent performance, providing such empirical evidence by benchmarking on eight datasets and comparing it with 13 hyperparameter optimized standard classifiers.

Related papers

• Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment [81.84950252537618]
  This paper reveals a unified game-theoretic connection between iterative BOND and self-play alignment. We establish a novel framework, WIN rate Dominance (WIND), with a series of efficient algorithms for regularized win rate dominance optimization.
  arXiv  Detail & Related papers  (2024-10-28T04:47:39Z)
• Online Variational Sequential Monte Carlo [49.97673761305336]
  We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference. Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
  arXiv  Detail & Related papers  (2023-12-19T21:45:38Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm [62.997667081978825]
  We propose a computationally efficient and powerful Bayesian approach for sparse high-dimensional linear regression. Minimal prior assumptions on the parameters are used through the use of plug-in empirical Bayes estimates. The proposed approach is implemented in the R package probe.
  arXiv  Detail & Related papers  (2022-09-16T19:15:50Z)
• Accurate Discharge Coefficient Prediction of Streamlined Weirs by Coupling Linear Regression and Deep Convolutional Gated Recurrent Unit [2.4475596711637433]
  The present study proposes data-driven modeling techniques, as an alternative to CFD simulation, to predict the discharge coefficient based on an experimental dataset. It is found that the proposed three layer hierarchical DL algorithm consists of a convolutional layer coupled with two subsequent GRU levels, which is also hybridized with the LR method, leads to lower error metrics.
  arXiv  Detail & Related papers  (2022-04-12T01:59:36Z)
• Information-Theoretic Generalization Bounds for Iterative Semi-Supervised Learning [81.1071978288003]
  In particular, we seek to understand the behaviour of the em generalization error of iterative SSL algorithms using information-theoretic principles. Our theoretical results suggest that when the class conditional variances are not too large, the upper bound on the generalization error decreases monotonically with the number of iterations, but quickly saturates.
  arXiv  Detail & Related papers  (2021-10-03T05:38:49Z)
• Recent advances in Bayesian optimization with applications to parameter reconstruction in optical nano-metrology [0.0]
  reconstruction is a common problem in optical nano metrology. We present a Bayesian Target Vector Optimization scheme which combines two approaches. We find that the presented method generally uses fewer calls of the model function than any of the competing schemes to achieve similar reconstruction performance.
  arXiv  Detail & Related papers  (2021-07-12T15:32:15Z)
• Gaussian Mixture Reduction with Composite Transportation Divergence [15.687740538194413]
  We propose a novel optimization-based GMR method based on composite transportation divergence (CTD) We develop a majorization-minimization algorithm for computing the reduced mixture and establish its theoretical convergence. Our unified framework empowers users to select the most appropriate cost function in CTD to achieve superior performance.
  arXiv  Detail & Related papers  (2020-02-19T19:52:17Z)
• Asymmetric Correlation Quantization Hashing for Cross-modal Retrieval [11.988383965639954]
  Cross-modal hashing methods have attracted extensive attention in similarity retrieval across the heterogeneous modalities. ACQH is a novel Asymmetric Correlation Quantization Hashing (ACQH) method proposed in this paper. It learns the projection matrixs of heterogeneous modalities data points for transforming query into a low-dimensional real-valued vector in latent semantic space. It constructs the stacked compositional quantization embedding in a coarse-to-fine manner for indicating database points by a series of learnt real-valued codeword.
  arXiv  Detail & Related papers  (2020-01-14T04:53:30Z)
• Clustering Binary Data by Application of Combinatorial Optimization Heuristics [52.77024349608834]
  We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior optimization metaheuristics. From a set of 16 data tables generated by a quasi-Monte Carlo experiment, a comparison is performed for one of the aggregations using L1 dissimilarity, with hierarchical clustering, and a version of k-means: partitioning around medoids or PAM.
  arXiv  Detail & Related papers  (2020-01-06T23:33:31Z)

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.