The Quantum Complexity of Computing Schatten p-norms. - Chris Cade; Ashley Montanaro (TQC, 2018)

Post-selected Classical Query Complexity. - Chris Cade (CoRR, 2018)

Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness. - Chris Cade; Ashley Montanaro; Aleksandrs Belovs (Quantum Inf. Comput., 2018)

Towards quantum advantage for topological data analysis. - Casper Gyurik; Chris Cade; Vedran Dunjko (CoRR, 2020)

Quantum algorithms and complexity in non-standard models. - Chris Cade (2020)

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States. - Chris Cade; Marten Folkertsma; Jordi Weggemans (CoRR, 2022)

Towards quantum advantage via topological data analysis. - Casper Gyurik; Chris Cade; Vedran Dunjko (Quantum, 2022)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Chris Cade; Marten Folkertsma; Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae; Jordi Weggemans (ICALP, 2023)

Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture. - Jordi Weggemans; Marten Folkertsma; Chris Cade (CoRR, 2023)

Quantum Motif Clustering. - Chris Cade; Farrokh Labib; Ido Niesen (Quantum, 2023)

Quantifying Grover speed-ups beyond asymptotic analysis. - Chris Cade; Marten Folkertsma; Ido Niesen; Jordi Weggemans (Quantum, 2023)

Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatz State Preparation and the Quantum PCP Conjecture. - Jordi Weggemans; Marten Folkertsma; Chris Cade (TQC, 2024)

Complexity of Supersymmetric Systems and the Cohomology Problem. - Chris Cade; P. Marcos Crichigno (Quantum, 2024)

Quantum algorithms for community detection and their empirical run-times. - Chris Cade; Marten Folkertsma; Ido Niesen; Jordi Weggemans (Quantum Inf. Comput., 2024)