Universal Approximation Theorem and error bounds for quantum neural
networks and quantum reservoirs
- URL: http://arxiv.org/abs/2307.12904v1
- Date: Mon, 24 Jul 2023 15:52:33 GMT
- Title: Universal Approximation Theorem and error bounds for quantum neural
networks and quantum reservoirs
- Authors: Lukas Gonon and Antoine Jacquier
- Abstract summary: We provide here precise error bounds for specific classes of functions and extend these results to the interesting new setup of randomised quantum circuits.
Our results show in particular that a quantum neural network with $mathcalO(varepsilon-2)$ weights and $mathcalO (lceil log_2(varepsilon-1) rceil)$ qubits suffices to achieve accuracy $varepsilon>0$ when approximating functions with integrable Fourier transform.
- Score: 2.741266294612776
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Universal approximation theorems are the foundations of classical neural
networks, providing theoretical guarantees that the latter are able to
approximate maps of interest. Recent results have shown that this can also be
achieved in a quantum setting, whereby classical functions can be approximated
by parameterised quantum circuits. We provide here precise error bounds for
specific classes of functions and extend these results to the interesting new
setup of randomised quantum circuits, mimicking classical reservoir neural
networks. Our results show in particular that a quantum neural network with
$\mathcal{O}(\varepsilon^{-2})$ weights and $\mathcal{O} (\lceil
\log_2(\varepsilon^{-1}) \rceil)$ qubits suffices to achieve accuracy
$\varepsilon>0$ when approximating functions with integrable Fourier transform.
Related papers
- Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
We use FNOs to model the evolution of random quantum spin systems.
We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
arXiv Detail & Related papers (2024-09-05T07:18:09Z) - Multi-layer random features and the approximation power of neural networks [4.178980693837599]
We prove that a reproducing kernel Hilbert space contains only functions that can be approximated by the architecture.
We show that if eigenvalues of the integral operator of the NNGP decay slower than $k-n-frac23$ where $k$ is an order of an eigenvalue, our theorem guarantees a more succinct neural network approximation than Barron's theorem.
arXiv Detail & Related papers (2024-04-26T14:57:56Z) - Neural network representation of quantum systems [0.0]
We provide a novel map with which a wide class of quantum mechanical systems can be cast into the form of a neural network.
Our findings bring machine learning closer to the quantum world.
arXiv Detail & Related papers (2024-03-18T02:20:22Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Entanglement Forging with generative neural network models [0.0]
We show that a hybrid quantum-classical variational ans"atze can forge entanglement to lower quantum resource overhead.
The method is efficient in terms of the number of measurements required to achieve fixed precision on expected values of observables.
arXiv Detail & Related papers (2022-05-02T14:29:17Z) - Estimating Gibbs partition function with quantumClifford sampling [6.656454497798153]
We develop a hybrid quantum-classical algorithm to estimate the partition function.
Our algorithm requires only a shallow $mathcalO(1)$-depth quantum circuit.
Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.
arXiv Detail & Related papers (2021-09-22T02:03:35Z) - A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems.
We numerically demonstrate that the MNIST image dataset satisfies such conditions.
We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
arXiv Detail & Related papers (2021-07-19T23:41:03Z) - Deep neural network approximation of analytic functions [91.3755431537592]
entropy bound for the spaces of neural networks with piecewise linear activation functions.
We derive an oracle inequality for the expected error of the considered penalized deep neural network estimators.
arXiv Detail & Related papers (2021-04-05T18:02:04Z) - Random Vector Functional Link Networks for Function Approximation on Manifolds [8.535815777849786]
We show that single layer neural-networks with random input-to-hidden layer weights and biases have seen success in practice.
We further adapt this randomized neural network architecture to approximate functions on smooth, compact submanifolds of Euclidean space.
arXiv Detail & Related papers (2020-07-30T23:50:44Z) - Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with
an artificial neural-network correlator ansatz [62.997667081978825]
We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei.
We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
arXiv Detail & Related papers (2020-07-28T14:52:28Z)
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.