24 citations · 31 across the 2 of their papers we have counts for
2 papers
cs.LG2014★ 7 cited
Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing
Ryan Babbush, Vasil Denchev, Nan Ding +2
Quantum annealing is a heuristic quantum algorithm which exploits quantum resources to minimize an objective function embedded as the energy levels of a programmable physical syste…
quant-ph2012★ 24 cited
Robust Classification with Adiabatic Quantum Optimization
Vasil S. Denchev, Nan Ding, S. V. N. Vishwanathan +1
We propose a non-convex training objective for robust binary classification of data sets in which label noise is present. The design is guided by the intention of solving the resul…