CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Mar 25, 2026

Predictive supremacy of informationally-restricted quantum perceptron

arXiv Quantum Archived Mar 25, 2026 ✓ Full text saved

arXiv:2603.22427v1 Announce Type: new 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

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 23 Mar 2026] Predictive supremacy of informationally-restricted quantum perceptron Shubhayan Sarkar 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. Comments: 5+4 pages, 2 Figures, Comments are appreciated :) Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.22427 [quant-ph]   (or arXiv:2603.22427v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.22427 Focus to learn more Submission history From: Shubhayan Sarkar [view email] [v1] Mon, 23 Mar 2026 18:02:23 UTC (68 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Mar 25, 2026
    Archived
    Mar 25, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗