Expressive Quantum Perceptrons for Quantum Neuromorphic Computing
- URL: http://arxiv.org/abs/2211.07075v3
- Date: Wed, 21 Feb 2024 14:20:45 GMT
- Title: Expressive Quantum Perceptrons for Quantum Neuromorphic Computing
- Authors: Rodrigo Araiza Bravo, Khadijeh Najafi, Taylor L. Patti, Xun Gao,
Susanne F. Yelin
- Abstract summary: 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.
- Score: 1.7636846875530183
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum neuromorphic computing (QNC) is a sub-field of quantum machine
learning (QML) that capitalizes on inherent system dynamics. As a result, QNC
can run on contemporary, noisy quantum hardware and is poised to realize
challenging algorithms in the near term. One key issue in QNC is the
characterization of the requisite dynamics for ensuring expressive quantum
neuromorphic computation. We address this issue by proposing a building block
for QNC architectures, what we call quantum perceptrons (QPs). Our proposed 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 that is the building block of various machine learning architectures.
Moreover, we show that QPs are theoretically capable of producing any unitary
operation. Thus, QPs are computationally more expressive than their classical
counterparts. As a result, QNC architectures built our of QPs are,
theoretically, universal. We introduce a technique for mitigating barren
plateaus in QPs called entanglement thinning. We demonstrate QPs' effectiveness
by applying them to numerous QML problems, including calculating the inner
products between quantum states, energy measurements, and time-reversal.
Finally, we discuss potential implementations of QPs and how they can be used
to build more complex QNC architectures.
Related papers
- A Framework for Quantum Finite-State Languages with Density Mapping [3.1133049660590615]
A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory.
We present a framework that provides a simple and intuitive way to build QFAs and maximize the simulation accuracy.
arXiv Detail & Related papers (2024-07-03T03:06:37Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - 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) - Learning capability of parametrized quantum circuits [2.51657752676152]
Variational quantum algorithms (VQAs) and their applications in the field of quantum machine learning through parametrized quantum circuits (PQCs) are thought to be one major way of leveraging noisy intermediate-scale quantum computing devices.
In this paper, we build upon the work by Schuld et al. and compare popular ans"atze for PQCs through the new measure of learning capability.
We also examine dissipative quantum neural networks (dQNN) as introduced by Beer et al. and propose a data re-upload structure for dQNNs to increase their learning capability.
arXiv Detail & Related papers (2022-09-21T13:26:20Z) - 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) - Open Source Variational Quantum Eigensolver Extension of the Quantum
Learning Machine (QLM) for Quantum Chemistry [0.0]
We introduce a novel open-source QC package, denoted Open-VQE, providing tools for using and developing chemically-inspired adaptive methods.
It is able to use the Atos Quantum Learning Machine (QLM), a general programming framework enabling to write, optimize simulate computing programs.
Along with OpenVQE, we introduce myQLMFermion, a new open-source module (that includes the key QLM ressources that are important for QC developments)
arXiv Detail & Related papers (2022-06-17T14:24:22Z) - Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
Quantum generative learning models (QGLMs) may surpass their classical counterparts.
We review the current progress of QGLMs from the perspective of machine learning.
We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
arXiv Detail & Related papers (2022-06-07T07:32:57Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - 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) - 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.