Related papers: An Exponential Reduction in Training Data Sizes fo…

Support Vector Machine (SVM) is a powerful tool in binary classification, known to attain excellent misclassification rates. On the other hand, many realworld classification problems, such as those found in medical diagnosis, churn or fraud…

An entanglement witness (EW) is an operator that allows to detect entangled states. We give necessary and sufficient conditions for such operators to be optimal, i.e. to detect entangled states in an optimal way. We show how to optimize…

We present very simple method for constructing indecomposable entanglement witnesses out of a given pair -- an entanglement witness W and the corresponding state detected by W. This method may be used to produce new classes of atomic…

We construct both nonlinear and linear entanglement witnesses, by tensoring and partial tracing existing states and witnesses. We show that little shared quantum resources allow to employ decomposable witnesses to obtain larger ones…

Quantum measurements are inherently noisy, hindering reliable entanglement detection and limiting the scalability of quantum technologies. While error mitigation and correction strategies exist, they often impose prohibitive resource…

Kernel-based support vector machines (SVMs) are supervised machine learning algorithms for classification and regression problems. We introduce a method to train SVMs on a D-Wave 2000Q quantum annealer and study its performance in…

Entanglement is a central concept in quantum information and a key resource for many quantum protocols. In this work we propose and analyze a class of entanglement witnesses that detect the presence of entanglement in subsystems of…

The support vector machine (SVM) algorithm is well known to the computer learning community for its very good practical results. The goal of the present paper is to study this algorithm from a statistical perspective, using tools of…

Although support vector machines (SVMs) are theoretically well understood, their underlying optimization problem becomes very expensive, if, for example, hundreds of thousands of samples and a non-linear kernel are considered. Several…

One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that…

Vision-language models (VLMs) have demonstrated remarkable potential in integrating visual and linguistic information, but their performance is often constrained by the need for extensive, high-quality image-text training data. Curation of…

Entanglement, a critical resource for quantum information processing, needs to be witnessed in many practical scenarios. Theoretically, witnessing entanglement is by measuring a special Hermitian observable, called entanglement witness…

Large Language Models (LLMs) are one of the most promising technologies for the next era of speech generation systems, due to their scalability and in-context learning capabilities. Nevertheless, they suffer from multiple stability issues…

We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…

Support vector machines (SVMs) have been successful in solving many computer vision tasks including image and video category recognition especially for small and mid-scale training problems. The principle of these non-parametric models is…

Detecting and quantifying quantum entanglement remain significant challenges in the noisy intermediate-scale quantum (NISQ) era. This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to…

In this work, new types of EWs are introduced. They are constructed by using real skew-symmetric operators defined on a single party subsystem of a bipartite dxd system and a maximal entangled state in that system. A canonical form for…

A support vector machine (SVM) is an algorithm that finds a hyperplane which optimally separates labeled data points in $\mathbb{R}^n$ into positive and negative classes. The data points on the margin of this separating hyperplane are…

Support vector machine (SVM), is a popular kernel method for data classification that demonstrated its efficiency for a large range of practical applications. The method suffers, however, from some weaknesses including; time processing,…

We address the problem of model selection for Support Vector Machine (SVM) classification. For fixed functional form of the kernel, model selection amounts to tuning kernel parameters and the slack penalty coefficient $C$. We begin by…