Towards Efficiently Solving Quantum Traveling Salesman Problem [article]

Debabrata Goswami, Harish Karnick, Prateek Jain, Hemanta K. Maji
<span title="2004-11-02">2004</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a framework for efficiently solving Approximate Traveling Salesman Problem (Approximate TSP) for Quantum Computing Models. Existing representations of TSP introduce extra states which do not correspond to any permutation. We present an efficient and intuitive encoding for TSP in quantum computing paradigm. Using this representation and assuming a Gaussian distribution on tour-lengths, we give an algorithm to solve Approximate TSP (Euclidean) within BQP resource bounds. Generalizing
more &raquo; ... is strategy for any distribution, we present an oracle based Quantum Algorithm to solve Approximate TSP. We present a realization of the oracle in the quantum counterpart of PP.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:quant-ph/0411013v1</a> <a target="_blank" rel="external noopener" href="">fatcat:rlyk3xt7urbf5ga4wdkdd5gxpu</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>