Addressing the Readout Problem in Quantum Differential Equation Algorithms with Quantum Scientific Machine Learning

• URL: http://arxiv.org/abs/2411.14259v1
• Date: Thu, 21 Nov 2024 16:09:08 GMT
• Title: Addressing the Readout Problem in Quantum Differential Equation Algorithms with Quantum Scientific Machine Learning
• Authors: Chelsea A. Williams, Stefano Scali, Antonio A. Gentile, Daniel Berger, Oleksandr Kyriienko,
• Abstract summary: We show that the readout of exact quantum states poses a bottleneck due to the complexity of tomography. Treating outputs of quantum differential equation solvers as quantum data, we demonstrate that low-dimensional output can be extracted. We apply this quantum scientific machine learning approach to classify solutions for shock wave detection and turbulence modeling.
• Score: 14.379311972506791
• License:
• Abstract: Quantum differential equation solvers aim to prepare solutions as $n$-qubit quantum states over a fine grid of $O(2^n)$ points, surpassing the linear scaling of classical solvers. However, unlike classically stored vectors of solutions, the readout of exact quantum states poses a bottleneck due to the complexity of tomography. Here, we show that the readout problem can be addressed with quantum learning tools where we focus on distilling the relevant features. Treating outputs of quantum differential equation solvers as quantum data, we demonstrate that low-dimensional output can be extracted using a measurement operator adapted to detect relevant features. We apply this quantum scientific machine learning approach to classify solutions for shock wave detection and turbulence modeling in scenarios where data samples come directly from quantum differential equation solvers. We show that the basis chosen for performing analysis greatly impacts classification accuracy. Our work opens up the area of research where quantum machine learning for quantum datasets is inherently required.

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)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Practical limitations of quantum data propagation on noisy quantum processors [0.9362259192191963]
  We show that owing to the noisy nature of current quantum processors, such a quantum algorithm will require single- and two-qubit gates with very low error probability to produce reliable results. Specifically, we provide the upper bounds on how the relative error in variational parameters' propagation scales with the probability of noise in quantum hardware.
  arXiv  Detail & Related papers  (2023-06-22T17:12:52Z)
• Machine learning applications for noisy intermediate-scale quantum computers [0.0]
  We develop and study three quantum machine learning applications suitable for NISQ computers. These algorithms are variational in nature and use parameterised quantum circuits (PQCs) as the underlying quantum machine learning model. We propose a variational algorithm in the area of approximate quantum cloning, where the data becomes quantum in nature.
  arXiv  Detail & Related papers  (2022-05-19T09:26:57Z)
• 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)
• Variational Quantum Classifiers Through the Lens of the Hessian [0.0]
  In quantum computing, variational quantum algorithms (VQAs) are well suited for finding optimal combinations of things. The training of VQAs with gradient descent optimization algorithm has shown a good convergence. Just like classical deep learning, variational quantum circuits suffer from vanishing gradient problems.
  arXiv  Detail & Related papers  (2021-05-21T06:57:34Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum advantage for differential equation analysis [13.39145467249857]
  We show how the output of quantum differential equation solving can serve as the input for quantum machine learning. These quantum algorithms provide an exponential advantage over existing classical Monte Carlo methods.
  arXiv  Detail & Related papers  (2020-10-29T17:19:04Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)

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.