Provable superior accuracy in machine learned quantum models

• URL: http://arxiv.org/abs/2105.14434v2
• Date: Tue, 22 Jun 2021 07:28:06 GMT
• Title: Provable superior accuracy in machine learned quantum models
• Authors: Chengran Yang, Andrew Garner, Feiyang Liu, Nora Tischler, Jayne Thompson, Man-Hong Yung, Mile Gu, Oscar Dahlsten
• Abstract summary: We construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. These techniques illustrate the immediate relevance of quantum technologies to time-series analysis and offer a rare instance where the resulting quantum advantage can be provably established.
• Score: 2.814412986458045
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the future. There is thus enormous interest in dimensional reduction-finding automated means to reduce the memory dimension of our models while minimizing its impact on its predictive accuracy. Here we construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. We demonstrate this advantage on present-day quantum computing hardware. Our algorithm works directly off classical time-series data and can thus be deployed in real-world settings. These techniques illustrate the immediate relevance of quantum technologies to time-series analysis and offer a rare instance where the resulting quantum advantage can be provably established.

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)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• 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)
• Implementing quantum dimensionality reduction for non-Markovian stochastic simulation [0.5269923665485903]
  We implement memory-efficient quantum models for a family of non-Markovian processes using a photonic setup. We show that with a single qubit of memory our implemented quantum models can attain higher precision than possible with any classical model of the same memory dimension.
  arXiv  Detail & Related papers  (2022-08-26T15:54:47Z)
• Quantifying Unknown Quantum Entanglement via a Hybrid Quantum-Classical Machine Learning Framework [1.8689488822130746]
  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.
  arXiv  Detail & Related papers  (2022-04-25T08:29:24Z)
• Quantum-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)
• Quantum Machine Learning: Fad or Future? [0.0]
  We're fast approach the threshold of the maximum possible computational capacity available to us by the means of classical computing devices. This is due to the exponential increase in model sizes which now have parameters in the magnitude of billions and trillions. This paper will look forth to test and verify the aspects in which quantum machine learning can help improve over classical machine learning approaches.
  arXiv  Detail & Related papers  (2021-06-20T15:39:36Z)
• 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)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.