IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v639y2024ics0378437124001997.html
   My bibliography  Save this article

Quantum self-organizing feature mapping neural network algorithm based on Grover search algorithm

Author

Listed:
  • Ye, Zi
  • Yu, Kai
  • Guo, Gong-De
  • Lin, Song

Abstract

Self-organizing feature mapping neural network is a typical unsupervised neural network algorithm, which is often used for clustering analysis and data compression. As the amount of data increases, the time consumption required by the algorithm becomes increasingly large, which becomes a new challenge. To address this issue, a quantum self-organizing feature mapping neural network is proposed in this paper. This algorithm provides a method to obtain the similarity between samples and neurons based on quantum phase estimation and demonstrates the scheme to obtain winning neurons by Grover algorithm. By utilizing the superposition of quantum, the algorithm achieves parallel computing. The time complexity analysis indicates that the proposed algorithm is exponentially faster than the classical counterpart. The quantum circuit has been devised, while numerical simulation and experiment on a heart disease dataset have been conducted programming within the Qiskit framework. Both have verified the feasibility of the algorithm. Moreover, an application of classification has been developed based on the trained self-organizing feature mapping neural network, which demonstrates the effectiveness of the proposed algorithm.

Suggested Citation

  • Ye, Zi & Yu, Kai & Guo, Gong-De & Lin, Song, 2024. "Quantum self-organizing feature mapping neural network algorithm based on Grover search algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 639(C).
  • Handle: RePEc:eee:phsmap:v:639:y:2024:i:c:s0378437124001997
    DOI: 10.1016/j.physa.2024.129690
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124001997
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2024.129690?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:639:y:2024:i:c:s0378437124001997. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.