187 citations · 264 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
quant-ph2021★ 2 cited
Quantum Motif Clustering
Chris Cade, Farrokh Labib, Ido Niesen
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 ot…
quant-ph2021★ 14 cited
Complexity of Supersymmetric Systems and the Cohomology Problem
Chris Cade, P. Marcos Crichigno
We consider the complexity of the local Hamiltonian problem in the context of fermionic Hamiltonians with supersymmetry and show that the problem remains $\mathsf{Q…