A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks
Summary: The maximum clique (MC) problem holds significance in network analysis. Quantum-based algorithms have recently emerged as promising approaches for this problem. However, these algorithms heavily depend on parameters of quantum system and vary significantly for different graphs. In order to...
Main Authors: | Xi Li, Xiao Chen, Shouwei Hu, Juan Xu, Zhihao Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2024-02-01
|
Series: | iScience |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2589004224001743 |
Similar Items
-
Quantum-enhanced maximum-likelihood identification
by: Chong, Bi Qi
Published: (2024) -
Device-independent certification of indefinite causal order in the quantum switch
by: van der Lugt, T, et al.
Published: (2023) -
Device-independent key distribution between trapped-ion quantum network nodes
by: Nadlinger, DP
Published: (2022) -
Device-independent characterizations of a shared quantum state independent of any Bell inequalities
by: Wei, Zhaohui, et al.
Published: (2018) -
Hybrid quantum information processing with continuous and discrete variables of light fields
by: Donati, G
Published: (2015)