Quantifying Unknown Quantum Entanglement via a Hybrid Quantum-Classical Machine Learning Framework

• URL: http://arxiv.org/abs/2204.11500v1
• Date: Mon, 25 Apr 2022 08:29:24 GMT
• Title: Quantifying Unknown Quantum Entanglement via a Hybrid Quantum-Classical Machine Learning Framework
• Authors: Xiaodie Lin, Zhenyu Chen, Zhaohui Wei
• Abstract summary: In this paper, we compare the performance of two machine learning approaches to quantify unknown entanglement. We propose a hybrid quantum-classical machine learning framework for this problem, where the key is to train optimal local measurements to generate more informative correlation data. Our numerical simulations show that the new framework brings us comparable performance with the approach based on moments to quantify unknown entanglement.
• Score: 1.8689488822130746
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantifying unknown quantum entanglement experimentally is a difficult task, but also becomes more and more necessary because of the fast development of quantum engineering. Machine learning provides practical solutions to this fundamental problem, where one has to train a proper machine learning model to predict entanglement measures of unknown quantum states based on experimentally measurable data, say moments or correlation data produced by local measurements. In this paper, we compare the performance of these two different machine learning approaches systematically. Particularly, we first show that the approach based on moments enjoys a remarkable advantage over that based on correlation data, though the cost of measuring moments is much higher. Next, since correlation data is much easier to obtain experimentally, we try to better its performance by proposing a hybrid quantum-classical machine learning framework for this problem, where the key is to train optimal local measurements to generate more informative correlation data. Our numerical simulations show that the new framework brings us comparable performance with the approach based on moments to quantify unknown entanglement. Our work implies that it is already practical to fulfill such tasks on near-term quantum devices.

Related papers

• Entanglement-induced provable and robust quantum learning advantages [0.0]
  We rigorously establish a noise-robust, unconditional quantum learning advantage in terms of expressivity, inference speed, and training efficiency. Our proof is information-theoretic and pinpoints the origin of this advantage.
  arXiv  Detail & Related papers  (2024-10-04T02:39:07Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Large-scale quantum reservoir learning with an analog quantum computer [45.21335836399935]
  We develop a quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning.
  arXiv  Detail & Related papers  (2024-07-02T18:00:00Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Simulation-assisted learning of open quantum systems [3.1003326924534482]
  This paper presents a learning method to infer parameters in Markovian open quantum systems from measurement data. The method is validated with error estimates and numerical experiments.
  arXiv  Detail & Related papers  (2023-07-07T22:37:42Z)
• Transition Role of Entangled Data in Quantum Machine Learning [51.6526011493678]
  Entanglement serves as the resource to empower quantum computing. Recent progress has highlighted its positive impact on learning quantum dynamics. We establish a quantum no-free-lunch (NFL) theorem for learning quantum dynamics using entangled data.
  arXiv  Detail & Related papers  (2023-06-06T08:06:43Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Learning quantum systems via out-of-time-order correlators [0.27961972519572437]
  We show that out-of-time-order correlators can substantially improve the learnability of strongly-interacting systems. We numerically characterize these advantages across a variety of learning problems, and find that they are robust to both read-out error and decoherence.
  arXiv  Detail & Related papers  (2022-08-03T18:00:00Z)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)
• Power of data in quantum machine learning [2.1012068875084964]
  We show that some problems that are classically hard to compute can be easily predicted by classical machines learning from data. We propose a projected quantum model that provides a simple and rigorous quantum speed-up for a learning problem in the fault-tolerant regime.
  arXiv  Detail & Related papers  (2020-11-03T19:00:01Z)

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.