8 citations · 12 across the 7 of their papers we have counts for
7 papers
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…
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…
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…
Effects of XX-catalysts on quantum annealing spectra with perturbative crossings
Natasha Feinstein, Louis Fry-Bouriaux, Sougato Bose +1
In adiabatic quantum annealing the required run-time to reach a given ground-state fidelity is dictated by the size of the minimum gap that appears between the ground and first exc…
Locally Suppressed Transverse-Field Protocol for Diabatic Quantum Annealing
Louis Fry-Bouriaux, Daniel O'Connor, Natasha Feinstein +1
Diabatic quantum annealing (DQA) is an alternative algorithm to adiabatic quantum annealing (AQA) that can be used to circumvent the exponential slowdown caused by small minima in…
Optimal quantum spatial search with one-dimensional long-range interactions
Dylan Lewis, Asmae Benhemou, Natasha Feinstein +2
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their…