Quantum Motif Clustering
We present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the other two make use of quantum approximate counting, and all of them obtain square-root like speedups over the fastest clas...
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2023-07-01
|
| Saila: | Quantum |
| Sarrera elektronikoa: | https://quantum-journal.org/papers/q-2023-07-03-1046/pdf/ |