English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The D_Wave quantum computer is an analog device that approximates optimalsolutions to optimization problems. The traveling salesman problems in the TSPLibrary are too large to process on the D_Wave quantum computer DW_2000Q_6. Wereport favorable approximations for solving the smallest, symmetric travelingsalesman problems in the TSP Library by two D_Wave hybrid solvers, Kerberos andLeapHybridSampler. This is useful work about results from new quantum tools onproblems that have been studied. It is expected to show a quantum way forwardwith larger problems when the hardware is upgraded. Also this work demonstratesthat the TSP Library is a source of benchmarks for quantum processing ofcombinatorial problems. The hybrid solvers combine quantum and classicalmethods in a manner that is D_Wave proprietary information. The results fromKerberos were closer to optimal than the results from LeapHybridSampler. Weshow that the error percent from optimal increases as the problem sizeincreases, which is consistent with results on D-Wave_s quantum computer forother optimization problems. An appendix contains outcomes from the two hybridsolvers for two asymmetric traveling salesman problems that are in the TSPLibrary. Again, the Kerberos results were closer to optimal than those fromLeapHybridSampler, which indicates that Kerberos is superior toLeapHybridSampler on traveling salesman problems.

Solving combinatorial problems by two D_Wave hybrid solvers: a case study of traveling salesman problems in the TSP Library