Adam Callison
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Adam Callison has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Nicholas Chancellor
Newcastle University
6 shared publications - Viv Kendon
University of Strathclyde
5 shared publications Florian Mintert
Physics Department, Imperial College London, London SW7 2BU, United Kingdom
3 shared publicationsLaurentiu Nita
Department of Physics Joint Quantum Centre (JQC) Durham-Newcastle Durham University South Road DH1 3LE Durham UK
2 shared publicationsMax Festenstein
Blackett Laboratory Imperial College London SW7 2BW London UK
2 shared publicationsCong Ling
Electrical and Electronic Engineering Department, Imperial College London, London SW7 2BU, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 8 June 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 8 (3) , 035031
Using copies can improve precision in continuous-time quantum computing
In the quantum optimisation setting, we build on a scheme introduced by Young et al (2013 Phys. Rev. A 88 062314), where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logical system’s robustness to error. We introduce several innovations that improve the error suppression of this scheme under a special model of control noise, designed to understand how limited precision could be overcome. First, we note that only one copy needs to be correct by the end of the computation, since solution quality can be checked efficiently. Second, we find that ferromagnetic links do not generally help in this ‘one correct copy’ setting, but anti-ferromagnetic links do help on average, by suppressing the chance of the same error being present on all of the copies. Third, we find that minimum-strength anti-ferromagnetic links perform best, by counteracting the spin-flips induced by the errors. We have numerically tested our innovations on small instances of spin glasses from Callison et al (2019 New J. Phys. 21 123022), and we find improved error tolerance for three or more copies in configurations that include frustration. Interpreted as an effective precision increase, we obtain several extra bits of precision on average for three copies connected in a triangle. This provides proof-of-concept of a method for scaling quantum annealing beyond the precision limits of hardware, a step towards fault tolerance in this setting.
- 8 June 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 8 (3) , 035031
Open AccessUsing copies can improve precision in continuous-time quantum computing
In the quantum optimisation setting, we build on a scheme introduced by Young et al (2013 Phys. Rev. A 88 062314), where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logical system’s robustness to error. We introduce several innovations that improve the error suppression of this scheme under a special model of control noise, designed to understand how limited precision could be overcome. First, we note that only one copy needs to be correct by the end of the computation, since solution quality can be checked efficiently. Second, we find that ferromagnetic links do not generally help in this ‘one correct copy’ setting, but anti-ferromagnetic links do help on average, by suppressing the chance of the same error being present on all of the copies. Third, we find that minimum-strength anti-ferromagnetic links perform best, by counteracting the spin-flips induced by the errors. We have numerically tested our innovations on small instances of spin glasses from Callison et al (2019 New J. Phys. 21 123022), and we find improved error tolerance for three or more copies in configurations that include frustration. Interpreted as an effective precision increase, we obtain several extra bits of precision on average for three copies connected in a triangle. This provides proof-of-concept of a method for scaling quantum annealing beyond the precision limits of hardware, a step towards fault tolerance in this setting.
- Open Access
- 5 June 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (2) , 023151
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
An algorithm for a particular problem may find some instances of the problem easier and others harder to solve, even for a fixed input size. We numerically analyze the relative hardness of MAX 2-SAT problem instances for various continuous-time quantum algorithms and a comparable classical algorithm. This has two motivations: To investigate whether small-sized problem instances, which are commonly used in numerical simulations of quantum algorithms for benchmarking purposes, are a good representation of larger instances in terms of their hardness to solve, and to determine the applicability of continuous-time quantum algorithms in a portfolio approach, where we take advantage of the variation in the hardness of instances between different algorithms by running them in parallel. We find that, while there are correlations in instance hardness between all of the algorithms considered, they appear weak enough that a portfolio approach would likely be desirable in practice. Our results also show a widening range of hardness of randomly generated instances as the problem size is increased, which demonstrates both the difference in the distribution of hardness at small sizes and the value of a portfolio approach that can reduce the number of extremely hard instances. We identify specific weaknesses of these quantum algorithms that can be overcome with a portfolio approach, such their inability to efficiently solve satisfiable instances (which is easy classically).
- 5 June 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (2) , 023151
Open AccessComparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
An algorithm for a particular problem may find some instances of the problem easier and others harder to solve, even for a fixed input size. We numerically analyze the relative hardness of MAX 2-SAT problem instances for various continuous-time quantum algorithms and a comparable classical algorithm. This has two motivations: To investigate whether small-sized problem instances, which are commonly used in numerical simulations of quantum algorithms for benchmarking purposes, are a good representation of larger instances in terms of their hardness to solve, and to determine the applicability of continuous-time quantum algorithms in a portfolio approach, where we take advantage of the variation in the hardness of instances between different algorithms by running them in parallel. We find that, while there are correlations in instance hardness between all of the algorithms considered, they appear weak enough that a portfolio approach would likely be desirable in practice. Our results also show a widening range of hardness of randomly generated instances as the problem size is increased, which demonstrates both the difference in the distribution of hardness at small sizes and the value of a portfolio approach that can reduce the number of extremely hard instances. We identify specific weaknesses of these quantum algorithms that can be overcome with a portfolio approach, such their inability to efficiently solve satisfiable instances (which is easy classically).
- Top Cited Papers
- 8 July 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 106 (1) , 010101
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction-representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classical resources it consumes), but whether classical components are crucial to an underlying model of the computation. We then take a broader view of this question, reviewing a number of hybrid algorithms and discussing what makes them hybrid, as well as the history of how they emerged and considerations related to hardware. This leads into a natural discussion of what the future holds for these algorithms. To answer this question, we turn to the use of specialized processors in classical computing. The classical trend is not for new technology to completely replace the old, but to augment it. We argue that the evolution of quantum computing is unlikely to be different: Hybrid algorithms are likely here to stay well past the NISQ era and even into full fault tolerance, with the quantum processors augmenting the already powerful classical processors which exist by performing specialized tasks.
- 8 July 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 106 (1) , 010101
Top Cited PapersHybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction-representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classical resources it consumes), but whether classical components are crucial to an underlying model of the computation. We then take a broader view of this question, reviewing a number of hybrid algorithms and discussing what makes them hybrid, as well as the history of how they emerged and considerations related to hardware. This leads into a natural discussion of what the future holds for these algorithms. To answer this question, we turn to the use of specialized processors in classical computing. The classical trend is not for new technology to completely replace the old, but to augment it. We argue that the evolution of quantum computing is unlikely to be different: Hybrid algorithms are likely here to stay well past the NISQ era and even into full fault tolerance, with the quantum processors augmenting the already powerful classical processors which exist by performing specialized tasks.
- 26 March 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (3) , 032433
Two quantum Ising algorithms for the shortest-vector problem
Quantum computers are expected to break today's public key cryptography within a few decades. New cryptosystems are being designed and standardized for the postquantum era, and a significant proportion of these rely on the hardness of problems like the shortest-vector problem to a quantum adversary. In this paper we describe two variants of a quantum Ising algorithm to solve this problem. One variant is spatially efficient, requiring only qubits, where is the lattice dimension, while the other variant is more robust to noise. Analysis of the algorithms' performance on a quantum annealer and in numerical simulations shows that the more qubit-efficient variant will outperform in the long run, while the other variant is more suitable for near-term implementation.- 26 March 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (3) , 032433
Two quantum Ising algorithms for the shortest-vector problem
Quantum computers are expected to break today's public key cryptography within a few decades. New cryptosystems are being designed and standardized for the postquantum era, and a significant proportion of these rely on the hardness of problems like the shortest-vector problem to a quantum adversary. In this paper we describe two variants of a quantum Ising algorithm to solve this problem. One variant is spatially efficient, requiring only qubits, where is the lattice dimension, while the other variant is more robust to noise. Analysis of the algorithms' performance on a quantum annealer and in numerical simulations shows that the more qubit-efficient variant will outperform in the long run, while the other variant is more suitable for near-term implementation.- Open Access
An energetic perspective on rapid quenches in quantum annealing
There are well developed theoretical tools to analyse how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposite limit of rapid quenches, as used in quantum annealing and (in the limit of infinitely rapid quenches) in quantum walks. In this paper, we develop several tools which are applicable in the rapid quench regime. Firstly, we analyse the energy expectation value of different elements of the Hamiltonian. From this, we show that monotonic quenches, where the strength of the problem Hamiltonian is consistently increased relative to fluctuation (driver) terms, will yield a better result on average than random guessing. Secondly, we develop methods to determine whether dynamics will occur locally under rapid quench Hamiltonians, and identify cases where a rapid quench will lead to a substantially improved solution. In particular, we find that a technique we refer to as "pre-annealing" can significantly improve the performance of quantum walks. We also show how these tools can provide efficient heuristic estimates for Hamiltonian parameters, a key requirement for practical application of quantum annealing.
Open AccessAn energetic perspective on rapid quenches in quantum annealing
There are well developed theoretical tools to analyse how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposite limit of rapid quenches, as used in quantum annealing and (in the limit of infinitely rapid quenches) in quantum walks. In this paper, we develop several tools which are applicable in the rapid quench regime. Firstly, we analyse the energy expectation value of different elements of the Hamiltonian. From this, we show that monotonic quenches, where the strength of the problem Hamiltonian is consistently increased relative to fluctuation (driver) terms, will yield a better result on average than random guessing. Secondly, we develop methods to determine whether dynamics will occur locally under rapid quench Hamiltonians, and identify cases where a rapid quench will lead to a substantially improved solution. In particular, we find that a technique we refer to as "pre-annealing" can significantly improve the performance of quantum walks. We also show how these tools can provide efficient heuristic estimates for Hamiltonian parameters, a key requirement for practical application of quantum annealing.
- Open Access
- 4 March 2021
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 2 (1) , 010338
Energetic Perspective on Rapid Quenches in Quantum Annealing
There are well-developed theoretical tools to analyze how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposite limit of rapid quenches, as used in quantum annealing and (in the limit of infinitely rapid quenches) in quantum walks. In this paper, we develop several tools that are applicable in the rapid-quench regime. Firstly, we analyze the energy expectation value of different elements of the Hamiltonian. From this, we show that monotonic quenches, where the strength of the problem Hamiltonian is consistently increased relative to fluctuation (driver) terms, will yield a better result on average than random guessing. Secondly, we develop methods to determine whether dynamics will occur locally under rapid-quench Hamiltonians and identify cases where a rapid quench will lead to a substantially improved solution. In particular, we find that a technique we refer to as “preannealing” can significantly improve the performance of quantum walks. We also show how these tools can provide efficient heuristic estimates for Hamiltonian parameters, a key requirement for practical application of quantum annealing.
- 4 March 2021
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 2 (1) , 010338
Open AccessEnergetic Perspective on Rapid Quenches in Quantum Annealing
There are well-developed theoretical tools to analyze how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand the opposite limit of rapid quenches, as used in quantum annealing and (in the limit of infinitely rapid quenches) in quantum walks. In this paper, we develop several tools that are applicable in the rapid-quench regime. Firstly, we analyze the energy expectation value of different elements of the Hamiltonian. From this, we show that monotonic quenches, where the strength of the problem Hamiltonian is consistently increased relative to fluctuation (driver) terms, will yield a better result on average than random guessing. Secondly, we develop methods to determine whether dynamics will occur locally under rapid-quench Hamiltonians and identify cases where a rapid quench will lead to a substantially improved solution. In particular, we find that a technique we refer to as “preannealing” can significantly improve the performance of quantum walks. We also show how these tools can provide efficient heuristic estimates for Hamiltonian parameters, a key requirement for practical application of quantum annealing.
- Open Access
Finding spin-glass ground states using quantum walks
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better than square-root scaling. This makes it practical to use quantum walks for solving such problems, and opens the door for a range of applications on suitable quantum hardware.
Open AccessFinding spin-glass ground states using quantum walks
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better than square-root scaling. This makes it practical to use quantum walks for solving such problems, and opens the door for a range of applications on suitable quantum hardware.
- Open Access
- 1 December 2019
- Published by IOP Publishing in New Journal of Physics
- Vol. 21 (12) , 123022
Finding spin glass ground states using quantum walks
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better quantum advantage than for search. We uncover two general mechanisms that provide the quantum advantage: matching the driver Hamiltonian to the encoding in the problem Hamiltonian, and an energy redistribution principle that ensures a quantum walk will find a lower energy state in a short timescale. This makes it practical to use quantum walks for solving hard problems, and opens the door for a range of applications on suitable quantum hardware.
- 1 December 2019
- Published by IOP Publishing in New Journal of Physics
- Vol. 21 (12) , 123022
Open AccessFinding spin glass ground states using quantum walks
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping rate of the quantum walk do not need to be set precisely for the spin glass ground state problem. Heuristic values of the hopping rate determined from the energy scales in the problem Hamiltonian are sufficient for obtaining a better quantum advantage than for search. We uncover two general mechanisms that provide the quantum advantage: matching the driver Hamiltonian to the encoding in the problem Hamiltonian, and an energy redistribution principle that ensures a quantum walk will find a lower energy state in a short timescale. This makes it practical to use quantum walks for solving hard problems, and opens the door for a range of applications on suitable quantum hardware.
- 15 August 2017
- Published by American Physical Society (APS) in Physical Review B
- Vol. 96 (8) , 085121
Protected ground states in short chains of coupled spins in circuit quantum electrodynamics
The two degenerate ground states of the anisotropic Heisenberg () spin model of a chain of qubits (pseudospins) can encode quantum information, but their degree of protection against local perturbations is known to be only partial. We examine the properties of the system in the presence of nonlocal spin-spin interactions, possibly emerging from the quantum electrodynamics of the device. We find a phase distinct from the phase admitting two ground states which are highly protected against all local field perturbations, persisting across a range of parameters. In the context of the chain we discuss how the coupling between two ground states can be used to observe signatures of topological edge states in a small controlled chain of superconducting transmon qubits.- 15 August 2017
- Published by American Physical Society (APS) in Physical Review B
- Vol. 96 (8) , 085121
Protected ground states in short chains of coupled spins in circuit quantum electrodynamics
The two degenerate ground states of the anisotropic Heisenberg () spin model of a chain of qubits (pseudospins) can encode quantum information, but their degree of protection against local perturbations is known to be only partial. We examine the properties of the system in the presence of nonlocal spin-spin interactions, possibly emerging from the quantum electrodynamics of the device. We find a phase distinct from the phase admitting two ground states which are highly protected against all local field perturbations, persisting across a range of parameters. In the context of the chain we discuss how the coupling between two ground states can be used to observe signatures of topological edge states in a small controlled chain of superconducting transmon qubits.- 10 June 2015
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 142 (22) , 224505
Nucleation of crystals that are mixed composites of all three polymorphs in the Gaussian core model
We present results of computer simulations of homogeneous crystal nucleation in the Gaussian core model. In our simulations, we study the competition between the body-centered-cubic (bcc), face-centered-cubic (fcc), and hexagonal-close-packed crystal phases. We find that the crystal nuclei that form from the metastable fluid phase are typically “mixed”; they do not consist of a single crystal polymorph. Furthermore, when the fcc phase is stable or fcc and bcc phases are equally stable, this mixed nature is found to persist far beyond the size at the top of the nucleation barrier, that is, far into what would be considered the growth (rather than nucleation) regime. In this region, the polymorph that forms is therefore selected long after nucleation. This has implications. When nucleation is slow, it will be the rate-limiting step for crystallization. Then, the step that determines the time scale for crystallisation is different from the step that controls which polymorph forms. This means that they can be independently controlled. Also between nucleation and polymorph selection, there is a growing phase that is clearly crystalline not fluid, but this phase cannot be assigned to any one polymorph.
- 10 June 2015
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 142 (22) , 224505
Nucleation of crystals that are mixed composites of all three polymorphs in the Gaussian core model
We present results of computer simulations of homogeneous crystal nucleation in the Gaussian core model. In our simulations, we study the competition between the body-centered-cubic (bcc), face-centered-cubic (fcc), and hexagonal-close-packed crystal phases. We find that the crystal nuclei that form from the metastable fluid phase are typically “mixed”; they do not consist of a single crystal polymorph. Furthermore, when the fcc phase is stable or fcc and bcc phases are equally stable, this mixed nature is found to persist far beyond the size at the top of the nucleation barrier, that is, far into what would be considered the growth (rather than nucleation) regime. In this region, the polymorph that forms is therefore selected long after nucleation. This has implications. When nucleation is slow, it will be the rate-limiting step for crystallization. Then, the step that determines the time scale for crystallisation is different from the step that controls which polymorph forms. This means that they can be independently controlled. Also between nucleation and polymorph selection, there is a growing phase that is clearly crystalline not fluid, but this phase cannot be assigned to any one polymorph.