513 citations · 3.3k across the 53 of their papers we have counts for
54 papers
Cycle discrete-time quantum walks on a noisy quantum computer
Vivek Wadhia, Nicholas Chancellor, Viv Kendon
The rapid development of quantum computing has led to increasing interest in quantum algorithms for a variety of different applications. Quantum walks have also experienced a surge…
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
Puya Mirkarimi, Adam Callison, Lewis Light +2
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 analyse the relative har…
Using copies to improve precision in continuous-time quantum computing
Jemma Bennett, Adam Callison, Tom O'Leary +3
In the quantum optimisation setting, we build on a scheme introduced by Young et al [PRA 88, 062314, 2013], where physical qubits in multiple copies of a problem encoded into an Is…
Generalising multipartite concentratable entanglement for practical applications: mixed, qudit, and optical states
Steph Foulds, Oliver Prove, Viv Kendon
The controlled SWAP test for detecting and quantifying entanglement applied to pure qubit states is robust to small errors in the states and efficient for large multi-qubit states…
The controlled SWAP test for determining quantum entanglement
Steph Foulds, Viv Kendon, Tim Spiller
Quantum entanglement is essential to the development of quantum computation, communications, and technology. The controlled SWAP test, widely used for state comparison, can be adap…
Search range in experimental quantum annealing
Nicholas Chancellor, Viv Kendon
We construct an Ising Hamiltonian with an engineered energy landscape such that it has a local energy minimum which is near to the true global minimum solution, and further away fr…