Predictive supremacy of informationally-restricted quantum perceptron

• URL: http://arxiv.org/abs/2603.22427v1
• Date: Mon, 23 Mar 2026 18:02:23 GMT
• Title: Predictive supremacy of informationally-restricted quantum perceptron
• Abstract summary: We introduce a model of perceptron called the informationally-restricted measurement-based perceptron (IMP)<n>We find specific learned values of the perceptron that can display the advantage of a quantum perceptron over its classical counterpart.
• Score: 0.1624454100511275
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the current world, the use of artificial intelligence is penetrating every aspect of human life. The basic element of any artificial intelligence is a digital neuron, called a perceptron, while its quantum analogue is called a quantum perceptron. Here, we introduce a model of perceptron called the informationally-restricted measurement-based perceptron (IMP), where each input is composed of two bits, while at the node, depending on a free input variable, the perceptron decides which bit to evaluate. Additionally, the states transmitted from the input to the node are restricted to a bit (qubit). We establish that under this restriction, the quantum IMP predicts better than a classical IMP. This means that under dimensional restriction of the transmitted states, when both the classical and quantum perceptrons learn the same, the quantum perceptron predicts better than the classical perceptron. For our purpose, we find specific learned values of the perceptron that can display the advantage of a quantum perceptron over its classical counterpart. Restricting to discrete binary inputs, we establish that the observed quantum advantage is universal, that is, for any non-trivial function implementable by both the quantum and classical IMP, one can always find a quantum implementation that outperforms the predictive capability of every classical one. This points to the fact that, given identical learning and resources, a quantum perceptron would predict better than any classical one.

Related papers

• Natural Quantization of Neural Networks [0.0]
  We propose a natural quantization of a standard neural network, where the neurons correspond to qubits and the activation functions are implemented via quantum gates and measurements.<n>We benchmark this architecture on a subset of the standard MNIST dataset and find a regime of "quantum advantage"<n>The proposed quantum neural networks are readily realizable in present-day quantum computers on commercial datasets.
  arXiv  Detail & Related papers  (2025-03-19T17:57:11Z)
• Implementing An Artificial Quantum Perceptron [0.0]
  A perceptron is a fundamental building block of a neural network.<n>Studies have shown the efficacy of a single neuron in making intelligent decisions.<n>We develop a quantum version of one of those perceptrons.
  arXiv  Detail & Related papers  (2024-12-03T01:57:09Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Experimental verification of the quantum nature of a neural network [0.0]
  I discuss what makes a system quantum and to what extent we can interpret a neural network as having quantum remnants.<n>I suggest a possible experiment that could extract entanglement from the quantum functioning rules (maps) of an otherwise classical neural network.
  arXiv  Detail & Related papers  (2022-08-23T06:33:59Z)
• Quantum Perceptron Revisited: Computational-Statistical Tradeoffs [4.791233143264229]
  We introduce a hybrid quantum-classical perceptron algorithm with lower complexity and better generalization ability than the classical perceptron. We derive a bound on the expected error of the hypothesis returned by our algorithm, which compares favorably to the one obtained with the classical online perceptron.
  arXiv  Detail & Related papers  (2021-06-04T14:05:54Z)
• On quantum neural networks [91.3755431537592]
  We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-04-12T18:30:30Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Continuous Variable Quantum Advantages and Applications in Quantum Optics [0.0]
  This thesis focuses on three main questions in the continuous variable and optical settings. Where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? What advantages can be gained in practice from the use of quantum information?
  arXiv  Detail & Related papers  (2021-02-10T02:43:27Z)
• Quantum Deformed Neural Networks [83.71196337378022]
  We develop a new quantum neural network layer designed to run efficiently on a quantum computer. It can be simulated on a classical computer when restricted in the way it entangles input states.
  arXiv  Detail & Related papers  (2020-10-21T09:46:12Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• 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)

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.