Quantum Fisher kernel for mitigating the vanishing similarity issue

• URL: http://arxiv.org/abs/2210.16581v1
• Date: Sat, 29 Oct 2022 12:00:17 GMT
• Title: Quantum Fisher kernel for mitigating the vanishing similarity issue
• Authors: Yudai Suzuki, Hideaki Kawaguchi, Naoki Yamamoto
• Abstract summary: The quantum kernel method is a machine learning model exploiting quantum computers to calculate the quantum kernels (QKs) that measure the similarity between data. Despite the potential quantum advantage, the commonly used fidelity-based QK suffers from a detrimental issue. We propose a new class of QKs called the quantum Fisher kernels (QFKs) that take into account the geometric structure of the data source.
• Score: 0.9404723842159504
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum kernel method is a machine learning model exploiting quantum computers to calculate the quantum kernels (QKs) that measure the similarity between data. Despite the potential quantum advantage of the method, the commonly used fidelity-based QK suffers from a detrimental issue, which we call the vanishing similarity issue; detecting the difference between data becomes hard with the increase of the number of qubits, due to the exponential decrease of the expectation and the variance of the QK. This implies the need to design QKs alternative to the fidelity-based one. In this work, we propose a new class of QKs called the quantum Fisher kernels (QFKs) that take into account the geometric structure of the data source. We analytically and numerically demonstrate that the QFK based on the anti-symmetric logarithmic derivatives (ALDQFK) can avoid the issue when the alternating layered ansatzs (ALAs) are used, while the fidelity-based QK cannot even with the ALAs. Moreover, the Fourier analysis numerically elucidates that the ALDQFK can have expressivity comparable to that of the fidelity-based QK. These results indicate that the QFK paves the way for practical applications of quantum machine learning with possible quantum advantages.

Related papers

• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [59.07246314484875]
  TeD-Q is an open-source software framework for quantum machine learning. It seamlessly integrates classical machine learning libraries with quantum simulators. It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Expressive Quantum Perceptrons for Quantum Neuromorphic Computing [1.7636846875530183]
  Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) We propose a building block for QNC architectures, what we call quantum perceptrons (QPs) QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron.
  arXiv  Detail & Related papers  (2022-11-14T02:50:42Z)
• Deterministic and random features for large-scale quantum kernel machine [0.9404723842159504]
  We show that the quantum kernel method (QKM) can be made scalable by using our proposed deterministic and random features. Our numerical experiment, using datasets including $O(1,000) sim O(10,000)$ training data, supports the validity of our method.
  arXiv  Detail & Related papers  (2022-09-05T13:22:34Z)
• Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines [0.0]
  We show that variational quantum classifiers (VQC) and support vector machines with quantum kernels (QSVM) can solve a classification problem based on the k-Forrelation problem. Our results imply that there exists a feature map and a quantum kernel that make VQC and QSVM efficient solvers for any BQP problem.
  arXiv  Detail & Related papers  (2022-07-12T22:03:31Z)
• On exploring practical potentials of quantum auto-encoder with advantages [92.19792304214303]
  Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics. We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state. We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Fast-Forwarding with NISQ Processors without Feedback Loop [0.0]
  We present the Classical Quantum Fast Forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. Our work provides a $104$ improvement over the previous record.
  arXiv  Detail & Related papers  (2021-04-05T14:29:33Z)
• Variational Quantum Algorithm for Estimating the Quantum Fisher Information [0.0]
  We present a variational quantum algorithm called Variational Quantum Fisher Information Estimation (VQFIE) By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing.
  arXiv  Detail & Related papers  (2020-10-20T17:44:55Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

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.