7 papers · 1 filter
Heuristics for multi-stage quantum walks to find Ising ground states
Asa Hopkins, Viv Kendon
One way to approximate a quantum annealing schedule is to use multiple quantum walks chained together, without intermediate measurements, to produce a multi-stage quantum walk (MSQ…
Quantum annealing and condensed matter physics
Viv Kendon, Nicholas Chancellor
Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabiliti…
Continuum Limits of Lazy Open Quantum Walks
Lara Janiurek, Viv Kendon
We derive the continuous spacetime limit of the one dimensional lazy discrete time quantum walk, obtaining explicit macroscopic evolution equations for a three state model in the p…
Quantum algorithms for scientific computing
R. Au-Yeung, B. Camino, O. Rathore +1
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the…
Improving success probability in the LHZ parity embedding by computing with quantum walks
Jemma Bennett, Nicholas Chancellor, Viv Kendon +1
The LHZ parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimisation problems. Continuous-time quantu…
A Review and Collection of Metrics and Benchmarks for Quantum Computers: definitions, methodologies and software
Deep Lall, Abhishek Agarwal, Weixi Zhang +15
Quantum computers have the potential to provide an advantage over classical computers in a number of areas. Numerous metrics to benchmark the performance of quantum computers, rang…