Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Modern Physics B

A QUANTUM PERCEPTRON

M. Andrecut, Mazhar Ali

Published Feb 10, 2002• 5 citations
Publisher

Abstract

The task of a classical perceptron is to classify two classes of patterns by generating a separation hyperplane. Here, we give a complete description of a quantum perceptron. The quantum algorithms for classification and learning are formulated in terms of unitary quantum gates operators. In the quantum case, the concept of separable or non-separable classes is irrelevant because the quantum perceptron can learn a superposition of patterns which are not separable by a hyperplane.

DOI
10.1142/s0217979202009998

Related papers

Quantum Perceptron

Andreas Wichert

The classical perceptron describes an algorithm for supervised learning that considers only linearly separable problems in which groups can be separated by a line or hyperplane. A quantum perceptron can be used as building block of larger systems, it can process an arbitrary number of input vectors in parallel. This chapter presents a simple example of the quantum perceptron for two-dimensional input. The classical perceptron describes an algorithm for supervised learning that considers only linearly separable problems in which groups can be separated by a line or hyperplane. A quantum Perceptron can be used as building block of larger systems, it can process an arbitrary number of input vectors in parallel.

Chapman & Hall/CRC eBooks•Nov 28, 2023•0 citations

Quantum Perceptron Models

Nathan Wiebe, Ashish Kapoor, Krysta M. Svore

We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number of steps sublinear in the number of data points $N$, namely $O(\sqrt{N})$. The second algorithm illustrates how the classical mistake bound of $O(\frac{1}{γ^2})$ can be further improved to $O(\frac{1}{\sqrtγ})$ through quantum means, where $γ$ denotes the margin. Such improvements are achieved through the application of quantum amplitude amplification to the version space interpretation of the perceptron model.

arXiv:1602.04799•neural information processing systems•Feb 15, 2016•141 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.00522•Dec 1, 2015•3 citations

Quantum Neuron with Separable-State Encoding

London Cavaletto, Luca Candelori, Alex Matos-Abiague

The use of advanced quantum neuron models for pattern recognition applications requires fault tolerance. Therefore, it is not yet possible to test such models on a large scale in currently available quantum processors. As an alternative, we propose a quantum perceptron (QP) model that uses a reduced number of multi-qubit gates and is therefore less susceptible to quantum errors in current actual quantum computers with limited tolerance. The proposed quantum algorithm is superior to its classical counterpart, although since it does not take full advantage of quantum entanglement, it provides a lower encoding power than other quantum algorithms using multiple qubit entanglement. However, the use of separable-sate encoding allows for testing the algorithm and different training schemes at a large scale in currently available non-fault tolerant quantum computers. We demonstrate the performance of the proposed model by implementing a few qubits version of the QP in a simulated quantum computer. The proposed QP uses an N-ary encoding of the binary input data characterizing the patterns. We develop a hybrid (quantum-classical) training procedure for simulating the learning process of the QP and test their efficiency.

arXiv:2202.08306•Feb 16, 2022•0 citations

A QUANTUM NEURAL NETWORK MODEL

M. Andrecut, Mazhar Ali

We present the algorithms necessary for the implementation of a quantum neural network with learning and classification tasks. A complete implementation for the classification and learning algorithms is given in terms of unitary quantum gates. Such a quantum neural network can be used to perform complex classification tasks or to solve the general problem of binary mapping.

International Journal of Modern Physics C•Jan 1, 2002•26 citations

A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets

Wenjie Liu, Peipei Gao, Yuxiang Wang +2 more

In order to solve the problem of non-ideal training sets (i.e., the less-complete or over-complete sets) and implement one-iteration learning, a novel efficient quantum perceptron algorithm based on unitary weights is proposed, where the singular value decomposition of the total weight matrix from the training set is calculated to make the weight matrix to be unitary. The example validation of quantum gates {H, S, T, CNOT, Toffoli, Fredkin} shows that our algorithm can accurately implement arbitrary quantum gates within one iteration. The performance comparison between our algorithm and other quantum perceptron algorithms demonstrates the advantages of our algorithm in terms of applicability, accuracy, and availability. For further validating the applicability of our algorithm, a quantum composite gate which consists of several basic quantum gates is also illustrated.

arXiv:2309.14366•IEEE Access•Jan 1, 2019•31 citations
The task of a classical perceptron is to classify two classes of patterns by generating a separation hyperplane. Here, we give a complete description of a quantum perceptron. The quantum algorithms for classification and learning are formulated in terms of unitary quantum gates operators. In the quantum case, the concept of separable or non-separable classes is irrelevant because the quantum perceptron can learn a superposition of patterns which are not separable by a hyperplane.
The classical perceptron describes an algorithm for supervised learning that considers only linearly separable problems in which groups can be separated by a line or hyperplane. A quantum perceptron can be used as building block of larger systems, it can process an arbitrary number of input vectors in parallel. This chapter presents a simple example of the quantum perceptron for two-dimensional input. The classical perceptron describes an algorithm for supervised learning that considers only linearly separable problems in which groups can be separated by a line or hyperplane. A quantum Perceptron can be used as building block of larger systems, it can process an arbitrary number of input vectors in parallel.
We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number of steps sublinear in the number of data points NNN, namely O(N)O(\sqrt{N})O(N​). The second algorithm illustrates how the classical mistake bound of O(1γ2)O(\frac{1}{γ^2})O(γ21​) can be further improved to O(1γ)O(\frac{1}{\sqrtγ})O(γ​1​) through quantum means, where γγγ denotes the margin. Such improvements are achieved through the application of quantum amplitude amplification to the version space interpretation of the perceptron model.
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.
The use of advanced quantum neuron models for pattern recognition applications requires fault tolerance. Therefore, it is not yet possible to test such models on a large scale in currently available quantum processors. As an alternative, we propose a quantum perceptron (QP) model that uses a reduced number of multi-qubit gates and is therefore less susceptible to quantum errors in current actual quantum computers with limited tolerance. The proposed quantum algorithm is superior to its classical counterpart, although since it does not take full advantage of quantum entanglement, it provides a lower encoding power than other quantum algorithms using multiple qubit entanglement. However, the use of separable-sate encoding allows for testing the algorithm and different training schemes at a large scale in currently available non-fault tolerant quantum computers. We demonstrate the performance of the proposed model by implementing a few qubits version of the QP in a simulated quantum computer. The proposed QP uses an N-ary encoding of the binary input data characterizing the patterns. We develop a hybrid (quantum-classical) training procedure for simulating the learning process of the QP and test their efficiency.
In order to solve the problem of non-ideal training sets (i.e., the less-complete or over-complete sets) and implement one-iteration learning, a novel efficient quantum perceptron algorithm based on unitary weights is proposed, where the singular value decomposition of the total weight matrix from the training set is calculated to make the weight matrix to be unitary. The example validation of quantum gates {H, S, T, CNOT, Toffoli, Fredkin} shows that our algorithm can accurately implement arbitrary quantum gates within one iteration. The performance comparison between our algorithm and other quantum perceptron algorithms demonstrates the advantages of our algorithm in terms of applicability, accuracy, and availability. For further validating the applicability of our algorithm, a quantum composite gate which consists of several basic quantum gates is also illustrated.