2025/06/03 by Maximilian Balthasar Mansky, Tobias Rohe, Mansky, Maximilian Balthasar +7
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Complexity and Algorithms in Graphs #Quantum Mechanics and Applications
paper · pdf · doi:10.48550/arxiv.2506.03339
We show the application of permutation-invariant quantum circuits to the clique problem. The experiment asks to label a clique through identification of the nodes in a larger subgraph. The permutation-invariant quantum circuit outperforms a cyclic-invariant alternative as well as a standard quantum machine learning ansatz. We explain the behavior through the intrinsic symmetry of the problem, in the sense that the problem is symmetric under permutation of both the feature and the label.