Machine learning on quantum experimental data toward solving quantum many-body problems

• URL: http://arxiv.org/abs/2310.19416v1
• Date: Mon, 30 Oct 2023 10:25:59 GMT
• Title: Machine learning on quantum experimental data toward solving quantum many-body problems
• Authors: Gyungmin Cho, Dohun Kim
• Abstract summary: We demonstrate the successful implementation of classical machine learning algorithms for systems with up to 44 qubits. We extend the applicability of the hybrid approach to problems of interest in many-body physics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds potential for unveiling obscure patterns. Although this hybrid approach extends the class of efficiently solvable problems compared to using only classical computers, this approach has been realized for solving restricted problems because of the prevalence of noise in current quantum computers. Here, we extend the applicability of the hybrid approach to problems of interest in many-body physics, such as predicting the properties of the ground state of a given Hamiltonian and classifying quantum phases. By performing experiments with various error-reducing procedures on superconducting quantum hardware with 127 qubits, we managed to acquire refined data from the quantum computer. This enabled us to demonstrate the successful implementation of classical ML algorithms for systems with up to 44 qubits. Our results verify the scalability and effectiveness of the classical ML algorithms for processing quantum experimental data.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Exploring Quantum-Enhanced Machine Learning for Computer Vision: Applications and Insights on Noisy Intermediate-Scale Quantum Devices [0.0]
  This study explores the intersection of quantum computing and Machine Learning (ML) It evaluates the effectiveness of hybrid quantum-classical algorithms, such as the data re-uploading scheme and the patch Generative Adversarial Networks (GAN) model, on small-scale quantum devices.
  arXiv  Detail & Related papers  (2024-04-01T20:55:03Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Long-lived Particles Anomaly Detection with Parametrized Quantum Circuits [0.0]
  We propose an anomaly detection algorithm based on a parametrized quantum circuit. This algorithm has been trained on a classical computer and tested with simulations as well as on real quantum hardware.
  arXiv  Detail & Related papers  (2023-12-07T11:50:42Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• 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)
• A preprocessing perspective for quantum machine learning classification advantage using NISQ algorithms [0.0]
  Variational Quantum Algorithm (VQA) shows a gain of performance in balanced accuracy with the LDA technique. Current quantum computers are noisy and have few qubits to test, making it difficult to demonstrate the current and potential quantum advantage of QML methods.
  arXiv  Detail & Related papers  (2022-08-28T16:58:37Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• Limitations of optimization algorithms on noisy quantum devices [0.0]
  We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices. Our approach is based on the combination of entropic inequalities that determine how fast the quantum state converges to the fixed point of the noise model.
  arXiv  Detail & Related papers  (2020-09-11T17:07:26Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.