Year: 2025
Type: conference-paper
Abstract: 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.
Institution: Ludwig-Maximilians-Universität München
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4416875183
