Chris Cade

According to our database, Chris Cade authored at least 11 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Quantifying Grover speed-ups beyond asymptotic analysis.

Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans

Quantum, October, 2023

Quantum Motif Clustering.

Chris Cade, Farrokh Labib, Ido Niesen

Quantum, July, 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

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

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Towards quantum advantage via topological data analysis.

Casper Gyurik, Chris Cade, Vedran Dunjko

Quantum, September, 2022

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States.

Chris Cade, Marten Folkertsma, Jordi Weggemans

CoRR, 2022

2020

Quantum algorithms and complexity in non-standard models.

Chris Cade

PhD thesis, 2020

Towards quantum advantage for topological data analysis.

Casper Gyurik, Chris Cade, Vedran Dunjko

CoRR, 2020

2018

Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness.

Chris Cade, Ashley Montanaro, Aleksandrs Belovs

Quantum Inf. Comput., 2018

Post-selected Classical Query Complexity.

Chris Cade

CoRR, 2018

The Quantum Complexity of Computing Schatten p-norms.

Chris Cade, Ashley Montanaro

Proceedings of the 13th Conference on the Theory of Quantum Computation, 2018