Benchmarking of quantum fidelity kernels for Gaussian process regression

• URL: http://arxiv.org/abs/2407.15961v2
• Date: Fri, 27 Sep 2024 16:36:50 GMT
• Title: Benchmarking of quantum fidelity kernels for Gaussian process regression
• Authors: Xuyang Guo, Jun Dai, Roman V. Krems,
• Abstract summary: Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. We show that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.
• Score: 1.7287035469433212
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. Here, we examine the performance of quantum kernels for regression problems of practical interest. For an unbiased benchmarking of quantum kernels, it is necessary to construct the most optimal functional form of the classical kernels and the most optimal quantum kernels for each given data set. We develop an algorithm that uses an analog of the Bayesian information criterion to optimize the sequence of quantum gates used to estimate quantum kernels for Gaussian process models. The algorithm increases the complexity of the quantum circuits incrementally, while improving the performance of the resulting kernels, and is shown to yield much higher model accuracy with fewer quantum gates than a fixed quantum circuit ansatz. We demonstrate that quantum kernels thus obtained can be used to build accurate models of global potential energy surfaces (PES) for polyatomic molecules. The average interpolation error of the six-dimensional PES obtained with a random distribution of 2000 energy points is 16 cm$^{-1}$ for H$_3$O$^+$, 15 cm$^{-1}$ for H$_2$CO and 88 cm$^{-1}$ for HNO$_2$. We show that a compositional optimization of classical kernels for Gaussian process regression converges to the same errors. This indicates that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.

Related papers

• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Learning out-of-time-ordered correlators with classical kernel methods [3.6538093004443155]
  We investigate whether classical kernel methods can accurately learn the XZ-OTOC as well as a particular sum of OTOCs. We frame the problem as a regression task, generating labelled data via an efficient numerical algorithm. We train a variety of standard kernel machines and observe that the best kernels consistently achieve a high coefficient of determination.
  arXiv  Detail & Related papers  (2024-09-03T04:20:24Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Quantum fidelity kernel with a trapped-ion simulation platform [3.9940425551415597]
  Quantum kernel methods leverage a kernel function computed by embedding input information into the Hilbert space of a quantum system. We propose trapped-ion simulation platforms as a means to compute quantum kernels and demonstrate their effectiveness for binary classification tasks. The results show that ion trap platforms are well-suited for quantum kernel computation and can achieve high accuracy with only a few qubits.
  arXiv  Detail & Related papers  (2023-11-30T17:19:52Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Quantum AI simulator using a hybrid CPU-FPGA approach [9.736685719039599]
  We show that the quantum kernel estimation by our heterogeneous CPU-FPGA computing is 470 times faster than that by a conventional CPU implementation. The co-design of our application-specific quantum kernel and its efficient FPGA implementation enabled us to perform one of the largest numerical simulations of a gate-based quantum kernel in terms of features.
  arXiv  Detail & Related papers  (2022-06-20T06:45:29Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• The complexity of quantum support vector machines [1.7887848708497243]
  Quantum support vector machines employ quantum circuits to define the kernel function. We show that the dual problem can be solved in $O(M4.67/varepsilon2)$ quantum circuit evaluations.
  arXiv  Detail & Related papers  (2022-02-28T19:01:17Z)
• Quantum Gaussian process model of potential energy surface for a polyatomic molecule [0.48733623015338234]
  We show that quantum kernels can be used for accurate regression models of global potential energy surfaces. We apply Bayesian optimization to maximize marginal likelihood by varying the parameters of the quantum gates. We illustrate the effect of qubit entanglement in the quantum kernels and explore the generalization performance of quantum Gaussian processes.
  arXiv  Detail & Related papers  (2022-02-22T00:50:15Z)

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.