Billy Geerhart

Venkat R. Dasari, Mee Seong Im, Billy Geerhart

There is a subset of computational problems that are computable in polynomial time for which an existing algorithm may not complete due to a lack of high performance technology on a mission field. We define a subclass of deterministic polynomial time complexity class called mission class, as many polynomial problems are not computable in mission time. By focusing on such subclass of languages in the context for successful military applications, we also discuss their computational and communicational constraints. We investigate feasible (non)linear models that will minimize energy and maximize memory, efficiency, and computational power, and also provide an approximate solution obtained within a pre-determined length of computation time using limited resources so that an optimal solution to a language could be determined.

Billy E. Geerhart, Venkat R. Dasari

Well defined quantum key distribution between two users requires both calibration to ensure quantum effects and synchronization to stabilize the bit parity of the results. Here we present two quantum effects regarding two entangled photons in a single fiber that can be used for both calibration and synchronization. In particular, we show how the synchronization problem can be transformed from a maximization of the bit parity between two photons sent to two users to finding an average 50/50 bit parity for two photons sent to a single user; the end result being first order feedback rather than second order feedback. Once we show how to calibrate and synchronize a quantum channel for two users, we then show how to introduce multiple users through a programmable quantum channel that can change its configuration depending on who needs to exchange quantum information. The programmable quantum channel is created by using a programmable classical channel to control the quantum devices as well as introducing new metadata on the classical channel specific to quantum applications.