Towards efficient and generic entanglement detection by machine learning

• URL: http://arxiv.org/abs/2211.05592v1
• Date: Thu, 10 Nov 2022 14:06:31 GMT
• Title: Towards efficient and generic entanglement detection by machine learning
• Authors: Jue Xu and Qi Zhao
• Abstract summary: We propose a flexible, machine learning assisted entanglement detection protocol. The protocol is robust to different types of noises and sample efficient. In a numerical simulation, our classifier can detect the entanglement of 4-qubit GHZ states with coherent noise.
• Score: 20.392440676633573
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted entanglement detection protocol that is robust to different types of noises and sample efficient. In this protocol, an entanglement classifier for a generic entangled state is obtained by training a classical machine learning model with a synthetic dataset. The dataset contains classical features of two types of states and their labels (either entangled or separable). The classical features of a state, which are expectation values of a set of k-local Pauli observables, are estimated sample-efficiently by the classical shadow method. In the numerical simulation, our classifier can detect the entanglement of 4-qubit GHZ states with coherent noise and W states mixed with large white noise, with high accuracy.

Related papers

• Certifiably Robust Encoding Schemes [40.54768963869454]
  Quantum machine learning uses principles from quantum mechanics to process data, offering potential advances in speed and performance. Previous work has shown that these models are susceptible to attacks that manipulate input data or exploit noise in quantum circuits. We extend this line of research by investigating the robustness against perturbations in the classical data for a general class of data encoding schemes.
  arXiv  Detail & Related papers  (2024-08-02T11:29:21Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Valid and efficient entanglement verification with finite copies of a quantum state [0.4523163728236145]
  We show how to optimize the validity and the efficiency of entanglement detection schemes in small data sets. The method is based on an analytical model of finite statistics effects on correlation functions.
  arXiv  Detail & Related papers  (2022-08-03T11:27:45Z)
• Decision Forest Based EMG Signal Classification with Low Volume Dataset Augmented with Random Variance Gaussian Noise [51.76329821186873]
  We produce a model that can classify six different hand gestures with a limited number of samples that generalizes well to a wider audience. We appeal to a set of more elementary methods such as the use of random bounds on a signal, but desire to show the power these methods can carry in an online setting.
  arXiv  Detail & Related papers  (2022-06-29T23:22:18Z)
• Learning with Neighbor Consistency for Noisy Labels [69.83857578836769]
  We present a method for learning from noisy labels that leverages similarities between training examples in feature space. We evaluate our method on datasets evaluating both synthetic (CIFAR-10, CIFAR-100) and realistic (mini-WebVision, Clothing1M, mini-ImageNet-Red) noise.
  arXiv  Detail & Related papers  (2022-02-04T15:46:27Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Binary classifiers for noisy datasets: a comparative study of existing quantum machine learning frameworks and some new approaches [0.0]
  We apply Quantum Machine Learning frameworks to improve binary classification. noisy datasets are in financial datasets. New models exhibit better learning characteristics to asymmetrical noise in the dataset.
  arXiv  Detail & Related papers  (2021-11-05T10:29:05Z)
• Visualizing Classifier Adjacency Relations: A Case Study in Speaker Verification and Voice Anti-Spoofing [72.4445825335561]
  We propose a simple method to derive 2D representation from detection scores produced by an arbitrary set of binary classifiers. Based upon rank correlations, our method facilitates a visual comparison of classifiers with arbitrary scores. While the approach is fully versatile and can be applied to any detection task, we demonstrate the method using scores produced by automatic speaker verification and voice anti-spoofing systems.
  arXiv  Detail & Related papers  (2021-06-11T13:03:33Z)
• Identifying nonclassicality from experimental data using artificial neural networks [52.77024349608834]
  We train an artificial neural network to classify classical and nonclassical states from their quadrature-measurement distributions. We show that the network is able to correctly identify classical and nonclassical features from real experimental quadrature data for different states of light.
  arXiv  Detail & Related papers  (2021-01-18T15:12:47Z)
• Binary Classification with Classical Instances and Quantum Labels [0.0]
  In classical statistical learning theory, one of the most well studied problems is that of binary classification. A quantum analog of this task, with training data given as a quantum state has also been intensely studied and is now known to have the same sample complexity as its classical counterpart. We propose a novel quantum version of the classical binary classification task by considering maps with classical input and quantum output and corresponding classical-quantum training data.
  arXiv  Detail & Related papers  (2020-06-10T18:00:09Z)

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.