80 citations · 80 across the 2 of their papers we have counts for
4 papers
Quantum Annealing amid Local Ruggedness and Global Frustration
James King, Sheir Yarkoni, Jack Raymond +5
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte Carlo algorithms: simulated annealing (SA) and quant…
Minimum Cost Homomorphisms with Constrained Costs
Pavol Hell, Mayssam Mohammadi Nevisi
Minimum cost homomorphism problems can be viewed as a generalization of list homomorphism problems. They also extend two well-known graph colouring problems: the minimum colour sum…
Benchmarking a quantum annealing processor with the time-to-target metric
James King, Sheir Yarkoni, Mayssam M. Nevisi +2
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. First, evaluation requires computation time for both quantum and class…
The four-way intersection problem for latin squares
P. Adams, E. S. Mahmoodian, H. Minooei +1
For given latin squares of order , they have {\sf intersection} when they have identical cells and cells with mutually different entries. For each …