Solutions to Constrained Optimal Control Problems with Linear Systems

Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience

“…The famous Travelling Salesman Problem (TSP) is an important category of optimization problems [1] that is mostly encountered in various areas of science and engineering. Studying optimization problems motivates to develop advanced techniques more suited to contemporary practical problems [2][3][4][5][6][7]. Among those, especially the NP hard problems provide an apt platform to demonstrate supremacy of quantum over classical technologies in terms of resources and time.…”

“…i n c l u d e " q e l i b 1 . i n c " ; q r e g q [ 1 4 ] ; 3 c r e g c[ 6 ] ;5 #C o n t r o l l e d u n i t a r y g a t e t o implement C−U1 , C−U2 , C−U3 & C−U4 g a t e u n i ( a , b , c , d ) x , y , z {…”