Towards Efficiently Solving Quantum Traveling Salesman Problem
量子物理
2007-05-23 v1
摘要
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 this 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.
引用
@article{arxiv.quant-ph/0411013,
title = {Towards Efficiently Solving Quantum Traveling Salesman Problem},
author = {Debabrata Goswami and Harish Karnick and Prateek Jain and Hemanta K. Maji},
journal= {arXiv preprint arXiv:quant-ph/0411013},
year = {2007}
}
备注
4 pages, 3 tables, PRL (submitted)