Adam Callison
Adam Callison
Post-doctoral researcher, University College London
Verified email at
Cited by
Cited by
Finding spin glass ground states using quantum walks
A Callison, N Chancellor, F Mintert, V Kendon
New Journal of Physics 21 (12), 123022, 2019
Two quantum Ising algorithms for the shortest-vector problem
D Joseph, A Callison, C Ling, F Mintert
Physical Review A 103 (3), 032433, 2021
Energetic perspective on rapid quenches in quantum annealing
A Callison, M Festenstein, J Chen, L Nita, V Kendon, N Chancellor
PRX Quantum 2 (1), 010338, 2021
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
A Callison, N Chancellor
Physical Review A 106 (1), 010101, 2022
Continuous-time quantum computing
A Callison
Imperial College London, 2021
Protected ground states in short chains of coupled spins in circuit quantum electrodynamics
A Callison, E Grosfeld, E Ginossar
Physical Review B 96 (8), 085121, 2017
Improved maximum-likelihood quantum amplitude estimation
A Callison, D Browne
arXiv preprint arXiv:2209.03321, 2022
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
P Mirkarimi, A Callison, L Light, N Chancellor, V Kendon
arXiv preprint arXiv:2206.06876, 2022
Using copies to improve precision in continuous-time quantum computing
J Bennett, A Callison, T O'Leary, M West, N Chancellor, V Kendon
arXiv preprint arXiv:2206.02545, 2022
Solving hard optimization problems using quantum walks
P Mirkarimi, A Callison, N Chancellor, V Kendon
APS March Meeting Abstracts 2021, E34. 009, 2021
Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later
D Joseph, A Callison, C Ling, F Mintert
arXiv preprint arXiv:2006.14057, 2020
The system can't perform the operation now. Try again later.
Articles 1–11