61 citations · 111 across the 9 of their papers we have counts for
9 papers
Scientific applications of quantum computing: challenges and opportunities
Bruno Camino, C. Richard A. Catlow, John Buckeridge +13
The predictive simulation of molecules and materials has had a broad and significant impact. It nevertheless remains constrained by the cost of accurately treating electronic corre…
Gadgets for simulating a non-native interaction in quantum annealing
Robert J. Banks, Natasha Feinstein, Roopayan Ghosh +2
In certain scenarios, quantum annealing can be made more efficient by additional interactions. It has been shown that the additional interactions can reduce the scaling of per…
Quantum Annealing Feature Selection on Light-weight Medical Image Datasets
Merlin A. Nau, Luca A. Nutricati, Bruno Camino +2
We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image dat…
Enhancing the Energy Gap of Random Graph Problems via XX-catalysts in Quantum Annealing
Luca A. Nutricati, Roopayan Ghosh, Natasha Feinstein +2
One of the bottlenecks in solving combinatorial optimisation problems using quantum annealers is the emergence of exponentially-closing energy gaps between the ground state and the…
Enhancement of quantum annealing via n-local catalysts
Roopayan Ghosh, Luca A. Nutricati, Natasha Feinstein +2
The potential quantum speedup in solving optimization problems via adiabatic quantum annealing is often hindered by the closing of the energy gap during the anneal, especially when…
Continuous-time quantum optimisation without the adiabatic principle
Robert J. Banks, Georgios S. Raftis, Dan E. Browne +1
Continuous-time quantum algorithms for combinatorial optimisation problems, such as quantum annealing, have previously been motivated by the adiabatic principle. A number of contin…
Robustness of diabatic enhancement in quantum annealing
Natasha Feinstein, Ivan Shalashilin, Sougato Bose +1
In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state fidelity, is dictated by the size of the minimum gap that…
A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
Nicholas Chancellor, Stefan Zohren, Paul A. Warburton +2
We demonstrate a direct mapping of max k-SAT problems (and weighted max k-SAT) to a Chimera graph, which is the non-planar hardware graph of the devices built by D-Wave Systems Inc…
Maximum-Entropy Inference with a Programmable Annealer
Nicholas Chancellor, Szilard Szoke, Walter Vinci +2
Optimisation problems in science and engineering typically involve finding the ground state (i.e. the minimum energy configuration) of a cost function with respect to many variable…