Classification of four-qubit entangled states via Machine Learning
- URL: http://arxiv.org/abs/2205.11512v2
- Date: Tue, 28 Mar 2023 07:28:16 GMT
- Title: Classification of four-qubit entangled states via Machine Learning
- Authors: S. V. Vintskevich, N. Bao, A. Nomerotski, P. Stankus, D.A. Grigoriev
- Abstract summary: We apply the support vector machine (SVM) algorithm to derive a set of entanglement witnesses (EW)
EW identifies entanglement patterns in families of four-qubit states.
We numerically verify that the SVM approach provides an effective tool to address the entanglement witness problem.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We apply the support vector machine (SVM) algorithm to derive a set of
entanglement witnesses (EW) to identify entanglement patterns in families of
four-qubit states. The effectiveness of SVM for practical EW implementations
stems from the coarse-grained description of families of equivalent entangled
quantum states. The equivalence criteria in our work is based on the stochastic
local operations and classical communication (SLOCC) classification and the
description of the four-qubit entangled Werner states. We numerically verify
that the SVM approach provides an effective tool to address the entanglement
witness problem when the coarse-grained description of a given family state is
available. We also discuss and demonstrate the efficiency of nonlinear kernel
SVM methods as applied to four-qubit entangled state classification.
Related papers
- Bisimulation Learning [55.859538562698496]
We compute finite bisimulations of state transition systems with large, possibly infinite state space.
Our technique yields faster verification results than alternative state-of-the-art tools in practice.
arXiv Detail & Related papers (2024-05-24T17:11:27Z) - An Exponential Reduction in Training Data Sizes for Machine Learning
Derived Entanglement Witnesses [45.17332714965704]
We propose a support vector machine (SVM) based approach for generating an entanglement witness.
For $N$ qubits, the SVM portion of this approach requires only $O(6N)$ training states, whereas an existing method needs $O(24N)$.
arXiv Detail & Related papers (2023-11-30T00:45:04Z) - A One-shot Framework for Distributed Clustered Learning in Heterogeneous
Environments [54.172993875654015]
The paper proposes a family of communication efficient methods for distributed learning in heterogeneous environments.
One-shot approach, based on local computations at the users and a clustering based aggregation step at the server is shown to provide strong learning guarantees.
For strongly convex problems it is shown that, as long as the number of data points per user is above a threshold, the proposed approach achieves order-optimal mean-squared error rates in terms of the sample size.
arXiv Detail & Related papers (2022-09-22T09:04:10Z) - Chance constrained conic-segmentation support vector machine with
uncertain data [0.0]
Support vector machines (SVM) is one of the well known supervised classes of learning algorithms.
This paper studies CS-SVM when the data points are uncertain or mislabelled.
arXiv Detail & Related papers (2021-07-28T12:29:47Z) - Machine-Learning-Derived Entanglement Witnesses [55.76279816849472]
We show a correspondence between linear support vector machines (SVMs) and entanglement witnesses.
We use this correspondence to generate entanglement witnesses for bipartite and tripartite qubit (and qudit) target entangled states.
arXiv Detail & Related papers (2021-07-05T22:28:02Z) - Hidden qubit cluster states [0.0]
Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state.
We find that each of these contains a "hidden" qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing.
arXiv Detail & Related papers (2021-03-22T03:13:54Z) - Estimating Average Treatment Effects with Support Vector Machines [77.34726150561087]
Support vector machine (SVM) is one of the most popular classification algorithms in the machine learning literature.
We adapt SVM as a kernel-based weighting procedure that minimizes the maximum mean discrepancy between the treatment and control groups.
We characterize the bias of causal effect estimation arising from this trade-off, connecting the proposed SVM procedure to the existing kernel balancing methods.
arXiv Detail & Related papers (2021-02-23T20:22:56Z) - Binary Classification from Multiple Unlabeled Datasets via Surrogate Set
Classification [94.55805516167369]
We propose a new approach for binary classification from m U-sets for $mge2$.
Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
arXiv Detail & Related papers (2021-02-01T07:36:38Z)
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.