Strategies for solving the Fermi-Hubbard model on near-term quantum computers C Cade, L Mineh, A Montanaro, S Stanisic Physical Review B 102 (23), 235122, 2020 | 165 | 2020 |
Towards quantum advantage via topological data analysis C Gyurik, C Cade, V Dunjko Quantum 6, 855, 2022 | 40 | 2022 |
Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness C Cade, A Montanaro, A Belovs Quantum Information and Computation 18 (1&2), pp0018-0050, 2016 | 26 | 2016 |
The Quantum Complexity of Computing Schatten p-norms C Cade, A Montanaro arXiv preprint arXiv:1706.09279, 2017 | 22 | 2017 |
Complexity of supersymmetric systems and the cohomology problem C Cade, PM Crichigno Quantum 8, 1325, 2024 | 18 | 2024 |
Improved hardness results for the guided local hamiltonian problem S Gharibian, R Hayakawa, FL Gall, T Morimae arXiv preprint arXiv:2207.10250, 2022 | 10 | 2022 |
Towards quantum advantage for topological data analysis C Gyurik, C Cade, V Dunjko arXiv preprint arXiv:2005.02607 41, 2020 | 9 | 2020 |
The one clean qubit model without entanglement is classically simulable M Yoganathan, C Cade arXiv preprint arXiv:1907.08224, 2019 | 8 | 2019 |
Guidable Local Hamiltonian Problems with Implications to Heuristic Ans\" atze State Preparation and the Quantum PCP Conjecture J Weggemans, M Folkertsma, C Cade arXiv preprint arXiv:2302.11578, 2023 | 7 | 2023 |
Complexity of the guided local hamiltonian problem: improved parameters and extension to excited states C Cade, M Folkertsma, J Weggemans arXiv preprint arXiv:2207.10097, 2022 | 6 | 2022 |
Quantum algorithms for community detection and their empirical run-times C Cade, M Folkertsma, I Niesen, J Weggemans arXiv preprint arXiv:2203.06208, 2022 | 5 | 2022 |
13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018) C Cade, A Montanaro Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018 | 5 | 2018 |
Quantifying Grover speed-ups beyond asymptotic analysis C Cade, M Folkertsma, I Niesen, J Weggemans Quantum 7, 1133, 2023 | 3 | 2023 |
Estrategias para resolver el modelo de Fermi-Hubbard en computadoras cuánticas a corto plazo C Cade, L Mineh, A Montanaro, S Stanisic Phys. Rev. B 102 (235122), 10.1103, 2020 | 3 | 2020 |
Quantum Motif Clustering C Cade, F Labib, I Niesen Quantum 7, 1046, 2023 | 2 | 2023 |
Post-selected classical query complexity C Cade arXiv preprint arXiv:1804.10010, 2018 | 1 | 2018 |
Quantum Algorithms and Complexity in Non-standard Models CW Cade University of Bristol, 2020 | | 2020 |