Chris Cade
Chris Cade
Verified email at bristol.ac.uk
Title
Cited by
Cited by
Year
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
12*2016
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
C Cade, L Mineh, A Montanaro, S Stanisic
arXiv preprint arXiv:1912.06007, 2019
72019
The Quantum Complexity of Computing Schatten p-norms
C Cade, A Montanaro
arXiv preprint arXiv:1706.09279, 2017
72017
The one clean qubit model without entanglement is classically simulable
M Yoganathan, C Cade
arXiv preprint arXiv:1907.08224, 2019
32019
Towards quantum advantage for topological data analysis
C Gyurik, C Cade, V Dunjko
arXiv preprint arXiv:2005.02607, 2020
12020
Post-selected Classical Query Complexity
C Cade
arXiv preprint arXiv:1804.10010, 2018
12018
Quantum Algorithms and Complexity in Non-standard Models
CW Cade
University of Bristol, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–7