187 citations · 264 across the 10 of their papers we have counts for
13 papers
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture
Jordi Weggemans, Marten Folkertsma, Chris Cade
We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem, which we call 'Guidable Local Hamiltonian' problems. Unlike their guided counterparts, thes…
Improved Hardness Results for the Guided Local Hamiltonian Problem
Chris Cade, Marten Folkertsma, Sevag Gharibian +4
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum alg…
Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States
Chris Cade, Marten Folkertsma, Jordi Weggemans
Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a -local Hamiltonian when provided with a description of a qua…
Quantum Algorithms for Community Detection and their Empirical Run-times
Chris Cade, Marten Folkertsma, Ido Niesen +1
We apply our recent work on empirical estimates of quantum speedups to the practical task of community detection in complex networks. We design several quantum variants of a popula…
Quantifying Grover speed-ups beyond asymptotic analysis
Chris Cade, Marten Folkertsma, Ido Niesen +1
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms w…
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…