Quantum Neuron with Separable-State Encoding

• URL: http://arxiv.org/abs/2202.08306v1
• Date: Wed, 16 Feb 2022 19:26:23 GMT
• Title: Quantum Neuron with Separable-State Encoding
• Authors: London A. Cavaletto, Luca Candelori, Alex Matos-Abiague
• Abstract summary: It is not yet possible to test advanced quantum neuron models on a large scale in currently available quantum processors. We propose a quantum perceptron (QP) model that uses a reduced number of multi-qubit gates. We demonstrate the performance of the proposed model by implementing a few qubits version of the QP in a simulated quantum computer.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

Err

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.