Chris Cade

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 16

Top Topics

Space Efficient

Asymptotic Analysis

Topological Spaces

Quantum Inspired

Top Venues

Quantum Inf. Comput.

Publications

Jordi Weggemans, Marten Folkertsma, Chris Cade
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatz State Preparation and the Quantum PCP Conjecture. TQC (2024)
Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans
Quantum algorithms for community detection and their empirical run-times. Quantum Inf. Comput. 24 (5&6) (2024)
Chris Cade, Farrokh Labib, Ido Niesen
Quantum Motif Clustering. Quantum 7 (2023)
Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans
Quantifying Grover speed-ups beyond asymptotic analysis. Quantum 7 (2023)
Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans
Improved Hardness Results for the Guided Local Hamiltonian Problem. ICALP (2023)
Jordi Weggemans, Marten Folkertsma, Chris Cade
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture. CoRR (2023)
Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans
Quantifying Grover speed-ups beyond asymptotic analysis. CoRR (2022)
Casper Gyurik, Chris Cade, Vedran Dunjko
Towards quantum advantage via topological data analysis. Quantum 6 (2022)
Chris Cade, Marten Folkertsma, Jordi Weggemans
Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States. CoRR (2022)
Chris Cade, Farrokh Labib, Ido Niesen
Quantum Motif Clustering. CoRR (2021)
Casper Gyurik, Chris Cade, Vedran Dunjko
Towards quantum advantage for topological data analysis. CoRR (2020)
Chris Cade
Post-selected Classical Query Complexity. CoRR (2018)
Chris Cade, Ashley Montanaro
The Quantum Complexity of Computing Schatten p-norms. TQC (2018)
Chris Cade, Ashley Montanaro, Aleksandrs Belovs
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness. Quantum Inf. Comput. 18 (1&2) (2018)
Chris Cade, Ashley Montanaro
The Quantum Complexity of Computing Schatten $p$-norms. CoRR (2017)
Chris Cade, Ashley Montanaro, Aleksandrs Belovs
Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness. CoRR (2016)