Journal of Advances in Applied Mathematics

7

Authors: Richard H. Warren

This paper illustrates fundamental principles about small traveling salesman problems (TSPs) which are a current application for quantum annealing computers. The 2048 qubit, quantum annealing computer manufactured by D-Wave Systems is estimated to be able to solve all TSPs on 8 cities, which advances a recent 4-city result on a quantum simulator. Additionally, the D-Wave quantum computer is expected to find all optimal tours for each TSP. To prepare for this, we show the expected quantum output for 5,000 randomly generated TSPs on 6, 8 and 10 cities. The examples in the TSPLIB have 14 or more cities. These are too large for the current quantum annealing processors. We have included an annotated bibliography about solving the TSP on a quantum computer.

18

Authors: ANDRÉS VIÑA

Given a Calabi-Yau manifold and considering the B-branes on it as objects in the derived category of coherent sheaves, we identify the vertex operators for strings between two branes with elements of the cohomology groups of Ext sheaves. We define the correlation functions for these general vertex operators. Strings stretching between two coherent sheaves are studied as homological extensions of the corresponding branes. In this context, we relate strings between different pairs of branes when there are maps between these pairs. We also interpret some strings with ghost number k as obstructions for lifts or extensions of strings with ghost number k − 1.