Pith. sign in

Unitary quantum perceptron as efficient universal approximator

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 1

years

2019 1

verdicts

REJECT 1

roles

background 1

polarities

unclear 1

representative citing papers

Training Optimization for Gate-Model Quantum Neural Networks

quant-ph · 2019-09-03 · reject · novelty 3.0

The paper maps gate-model quantum neural networks into a constraint-machine framework and declares supervised learning and backpropagation optimal, but the proofs rely on textbook results and do not validate the proposed algorithms.

citing papers explorer

Showing 1 of 1 citing paper.

  • Training Optimization for Gate-Model Quantum Neural Networks quant-ph · 2019-09-03 · reject · none · ref 48 · internal anchor

    The paper maps gate-model quantum neural networks into a constraint-machine framework and declares supervised learning and backpropagation optimal, but the proofs rely on textbook results and do not validate the proposed algorithms.