Chris Cade

18 papers A* 1Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Complexity of Supersymmetric Systems and the Cohomology Problem.
Quantum
Chris Cade, P. Marcos Crichigno
2024 — conf
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatz State Preparation and the Quantum PCP Conjecture.
TQC
Jordi Weggemans, Marten Folkertsma, Chris Cade
2024 J jnl
Quantum algorithms for community detection and their empirical run-times.
Quantum Inf. Comput.
Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans
2023 J jnl
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture.
CoRR
Jordi Weggemans, Marten Folkertsma, Chris Cade
2023 A* conf
Improved Hardness Results for the Guided Local Hamiltonian Problem.
ICALP
Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans
2023 J jnl
Quantifying Grover speed-ups beyond asymptotic analysis.
Quantum
Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans
2023 J jnl
Quantum Motif Clustering.
Quantum
Chris Cade, Farrokh Labib, Ido Niesen
2022 J jnl
Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States.
CoRR
Chris Cade, Marten Folkertsma, Jordi Weggemans
2022 J jnl
Quantifying Grover speed-ups beyond asymptotic analysis.
CoRR
Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans
2022 J jnl
Towards quantum advantage via topological data analysis.
Quantum
Casper Gyurik, Chris Cade, Vedran Dunjko
2021 J jnl
Quantum Motif Clustering.
CoRR
Chris Cade, Farrokh Labib, Ido Niesen
2020 — —
Quantum algorithms and complexity in non-standard models.
Chris Cade
2020 J jnl
Towards quantum advantage for topological data analysis.
CoRR
Casper Gyurik, Chris Cade, Vedran Dunjko
2018 J jnl
Post-selected Classical Query Complexity.
CoRR
Chris Cade
2018 — conf
The Quantum Complexity of Computing Schatten p-norms.
TQC
Chris Cade, Ashley Montanaro
2018 J jnl
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness.
Quantum Inf. Comput.
Chris Cade, Ashley Montanaro, Aleksandrs Belovs
2017 J jnl
The Quantum Complexity of Computing Schatten $p$-norms.
CoRR
Chris Cade, Ashley Montanaro
2016 J jnl
Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness.
CoRR
Chris Cade, Ashley Montanaro, Aleksandrs Belovs