Institutional Repository of Vilnius University
Maksimalaus pilnojo dvidalio pografio paieškos problemos sprendimas naudojant kvantinius kompiuterius /
Abstract
dc:descriptionA digital experiment was conducted using quantum and classical solutions to find the maximum biclique of a given bipartite graph, both in terms of edges and vertices. The performance of the solution algorithms was compared with each other and with the results published by Xiaofan Li, Prasenjit Mitra, Rui Zhou and Wolfgang Nejdl in September 2023. For this purpose, the literature that proposes classical and quantum solutions to the problem of finding the maximum biclique was reviewed. The algorithms used by the aforementioned authors and other algorithms were analyzed and ways to implement them were found. The operation of the implemented algorithms was verified in simple cases and the implementations were adapted to cases similar to those examined in the literature.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Bernotas, Konstantinas,
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD239029849&prefLang=en_US