arXiv:1801.00934 · Europhysics Letters (EPL)

Unitary quantum perceptron as efficient universal approximator

E. Torrontegui, Juan José García‐Ripoll

Published Mar 4, 2019• 102 citations

Abstract

We demonstrate that it is possible to implement a quantum perceptron with a sigmoid activation function as an efficient, reversible many-body unitary operation. When inserted in a neural network, the perceptron's response is parameterized by the potential exerted by other neurons. We prove that such a quantum neural network is a universal approximator of continuous functions, with at least the same power as classical neural networks. While engineering general perceptrons is a challenging control problem —also defined in this work— the ubiquitous sigmoid-response neuron can be implemented as a quasi-adiabatic passage with an Ising model. In this construct, the scaling of resources is favorable with respect to the total network size and is dominated by the number of layers. We expect that our sigmoid perceptron will have applications also in quantum sensing or variational estimation of many-body Hamiltonians.

DOI: 10.1209/0295-5075/125/30004

Related papers

Evaluating the performance of sigmoid quantum perceptrons in quantum neural networks

Samuel A. Wilkinson, Michael J. Hartmann

Quantum neural networks (QNN) have been proposed as a promising architecture for quantum machine learning. There exist a number of different quantum circuit designs being branded as QNNs, however no clear candidate has presented itself as more suitable than the others. Rather, the search for a ``quantum perceptron" -- the fundamental building block of a QNN -- is still underway. One candidate is quantum perceptrons designed to emulate the nonlinear activation functions of classical perceptrons. Such sigmoid quantum perceptrons (SQPs) inherit the universal approximation property that guarantees that classical neural networks can approximate any function. However, this does not guarantee that QNNs built from SQPs will have any quantum advantage over their classical counterparts. Here we critically investigate both the capabilities and performance of SQP networks by computing their effective dimension and effective capacity, as well as examining their performance on real learning problems. The results are compared to those obtained for other candidate networks which lack activation functions. It is found that simpler, and apparently easier-to-implement parametric quantum circuits actually perform better than SQPs. This indicates that the universal approximation theorem, which a cornerstone of the theory of classical neural networks, is not a relevant criterion for QNNs.

arXiv:2208.06198Aug 12, 20224 citations

Quantum activation functions for quantum neural networks

Marco Maronese, C. Destri, Enrico Prati

Abstract The field of artificial neural networks is expected to strongly benefit from recent developments of quantum computers. In particular, quantum machine learning, a class of quantum algorithms which exploit qubits for creating trainable neural networks, will provide more power to solve problems such as pattern recognition, clustering and machine learning in general. The building block of feed-forward neural networks consists of one layer of neurons connected to an output neuron that is activated according to an arbitrary activation function. The corresponding learning algorithm goes under the name of Rosenblatt perceptron. Quantum perceptrons with specific activation functions are known, but a general method to realize arbitrary activation functions on a quantum computer is still lacking. Here, we fill this gap with a quantum algorithm which is capable to approximate any analytic activation functions to any given order of its power series. Unlike previous proposals providing irreversible measurement–based and simplified activation functions, here we show how to approximate any analytic function to any required accuracy without the need to measure the states encoding the information. Thanks to the generality of this construction, any feed-forward neural network may acquire the universal approximation properties according to Hornik’s theorem. Our results recast the science of artificial neural networks in the architecture of gate-model quantum computers.

arXiv:2201.03700Quantum Information ProcessingMar 30, 202249 citations

Speeding up quantum perceptron via shortcuts to adiabaticity

Yue Ban, Xi Chen, E. Torrontegui +2 more

The quantum perceptron is a fundamental building block for quantum machine learning. This is a multidisciplinary field that incorporates abilities of quantum computing, such as state superposition and entanglement, to classical machine learning schemes. Motivated by the techniques of shortcuts to adiabaticity, we propose a speed-up quantum perceptron where a control field on the perceptron is inversely engineered leading to a rapid nonlinear response with a sigmoid activation function. This results in faster overall perceptron performance compared to quasi-adiabatic protocols, as well as in enhanced robustness against imperfections in the controls.

arXiv:2003.09938Scientific ReportsMar 11, 202122 citations

Direct implementation of a perceptron in superconducting circuit quantum hardware

Marek Pechal, Federico Roy, Samuel A. Wilkinson +4 more

The utility of classical neural networks as universal approximators suggests that their quantum analogues could play an important role in quantum generalizations of machine-learning methods. Inspired by the proposal in Torrontegui and Garc\'{\i}a-Ripoll [Europhys. Lett. 125, 30004 (2019)], we demonstrate a superconducting qubit implementation of a controlled gate, which generalizes the action of a classical perceptron as the basic building block of a quantum neural network. In a two-qubit setup we show full control over the steepness of the perceptron activation function, the input weight and the bias by tuning the gate length, the coupling between the qubits, and the frequency of the applied drive, respectively. In its general form, the gate realizes a multiqubit entangling operation in a single step, whose decomposition into single- and two-qubit gates would require a number of gates that is exponential in the number of qubits. Its demonstrated direct implementation as perceptron in quantum hardware may therefore lead to more powerful quantum neural networks when combined with suitable additional standard gates.

arXiv:2111.12669Physical Review ResearchSep 8, 202210 citations

Nonlinear quantum neuron: A fundamental building block for quantum neural networks

Shilu Yan, Hongsheng Qi, Wei Cui

Quantum computing enables quantum neural networks (QNNs) to have great potential to surpass artificial neural networks. The powerful generalization of neural networks is attributed to nonlinear activation functions. Although various models related to QNNs have been developed, they are facing the challenge of merging the nonlinear, dissipative dynamics of neural computing into the linear, unitary quantum system. In this paper, we establish different quantum circuits to approximate nonlinear functions and then propose a generalizable framework to realize any nonlinear quantum neuron. We present two quantum neuron examples based on the proposed framework. The quantum resources required to construct a single quantum neuron are polynomial in function of the input size. Finally, both IBM Quantum Experience results and numerical simulations illustrate the effectiveness of the proposed framework.

arXiv:2011.03429Physical Review ANov 25, 202046 citations

Efficient learning algorithm for quantum perceptron unitary weights

Kok-Leong Seow, Elizabeth Behrman, James E. Steck

For the past two decades, researchers have attempted to create a Quantum Neural Network (QNN) by combining the merits of quantum computing and neural computing. In order to exploit the advantages of the two prolific fields, the QNN must meet the non-trivial task of integrating the unitary dynamics of quantum computing and the dissipative dynamics of neural computing. At the core of quantum computing and neural computing lies the qubit and perceptron, respectively. We see that past implementations of the quantum perceptron model have failed to fuse the two elegantly. This was due to a slow learning rule and a disregard for the unitary requirement. In this paper, we present a quantum perceptron that can compute functions uncomputable by the classical perceptron while analytically solving for parameters and preserving the unitary and dissipative requirements.

arXiv:1512.00522Dec 1, 20153 citations