Classically Approximating Variational Quantum Machine Learning with Random Fourier Features

• URL: http://arxiv.org/abs/2210.13200v1
• Date: Mon, 24 Oct 2022 13:23:36 GMT
• Title: Classically Approximating Variational Quantum Machine Learning with Random Fourier Features
• Authors: Jonas Landman, Slimane Thabet, Constantin Dalyac, Hela Mhiri, Elham Kashefi
• Abstract summary: We propose a classical sampling method that may closely approximate a VQC with Hamiltonian encoding. We show that the number of required samples grows favorably with the size of the quantum spectrum. We expect VQCs with various and complex encoding Hamiltonians, or with large input dimension, to become more robust to classical approximations.
• Score: 1.4680035572775534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many applications of quantum computing in the near term rely on variational quantum circuits (VQCs). They have been showcased as a promising model for reaching a quantum advantage in machine learning with current noisy intermediate scale quantum computers (NISQ). It is often believed that the power of VQCs relies on their exponentially large feature space, and extensive works have explored the expressiveness and trainability of VQCs in that regard. In our work, we propose a classical sampling method that may closely approximate a VQC with Hamiltonian encoding, given only the description of its architecture. It uses the seminal proposal of Random Fourier Features (RFF) and the fact that VQCs can be seen as large Fourier series. We provide general theoretical bounds for classically approximating models built from exponentially large quantum feature space by sampling a few frequencies to build an equivalent low dimensional kernel, and we show experimentally that this approximation is efficient for several encoding strategies. Precisely, we show that the number of required samples grows favorably with the size of the quantum spectrum. This tool therefore questions the hope for quantum advantage from VQCs in many cases, but conversely helps to narrow the conditions for their potential success. We expect VQCs with various and complex encoding Hamiltonians, or with large input dimension, to become more robust to classical approximations.

Related papers

• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• 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)
• 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)
• Potential and limitations of random Fourier features for dequantizing quantum machine learning [0.5277756703318045]
  Quantum machine learning is arguably one of the most explored applications of near-term quantum devices. Much focus has been put on notions of variational quantum machine learning where parameterized quantum circuits (PQCs) are used as learning models. In this work, we establish necessary and sufficient conditions under which RFF does indeed provide an efficient dequantization of variational quantum machine learning for regression.
  arXiv  Detail & Related papers  (2023-09-20T21:23:52Z)
• 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)
• Programmable Hamiltonian engineering with quadratic quantum Fourier transform [8.261869047984895]
  We propose a protocol of quadratic quantum Fourier transform (QQFT), considering cold atoms confined in an optical lattice. This QQFT is equivalent to QFT in the single-particle subspace, and produces a different unitary operation in the entire Hilbert space. We show this QQFT protocol can be implemented using programmable laser potential with the digital-micromirror-device techniques recently developed in the experiments.
  arXiv  Detail & Related papers  (2022-04-09T03:36: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)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Experimental Quantum Generative Adversarial Networks for Image Generation [93.06926114985761]
  We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor. Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-13T06:57:17Z)
• Quantum-enhanced data classification with a variational entangled sensor network [3.1083620257082707]
  Supervised learning assisted by an entangled sensor network (SLAEN) is a distinct paradigm that harnesses VQCs trained by classical machine-learning algorithms. Our work paves a new route for quantum-enhanced data processing and its applications in the NISQ era.
  arXiv  Detail & Related papers  (2020-06-22T01:22:33Z)
• Efficient Discrete Feature Encoding for Variational Quantum Classifier [3.7576442570677253]
  Variational quantum classification (VQC) is one of such methods with possible quantum advantage. We introduce the use of quantum random-access coding (QRAC) to map discrete features efficiently into limited number of qubits for VQC. We experimentally show that QRAC can help speeding up the training of VQC by reducing its parameters via saving on the number of qubits for the mapping.
  arXiv  Detail & Related papers  (2020-05-29T04:43:14Z)

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.