Quantum Computing, Ising Formulation, and the Traveling Salesman Problem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908919919542272 |
|---|---|
| author | Gurevich, Omer Matityahu, Maor Mor, Tal |
| author_facet | Gurevich, Omer Matityahu, Maor Mor, Tal |
| contents | Ising formulation is important for many NP problems (Lucas, 2014). This formulation enables implementing novel quantum computing methods including Quantum Approximate Optimization Algorithm and Variational Quantum Eigensolver (VQE). Here, we investigate closely the traveling salesman problem (TSP).
First, we present some non-trivial issues related to Ising model view versus a realistic salesman.
Then, focusing on VQE we discuss and clarify the use of: a.-- Conventional VQE and how it is relevant as a novel SAT-solver; b.-- Qubit efficiency and its importance in the Noisy Intermediate Scale Quantum-era; and c.-- the relevance and importance of a novel approach named Discrete Quantum Exhaustive Search (Alfassi, Meirom, and Mor, 2024), for enhancing VQE and other methods using mutually unbiased bases.
The approach we present here in details can potentially be extended for analyzing approximating and solving various other NP complete problems. Our approach can also be extended beyond the Ising model and beyond the class NP, for example to the class Quantum Merlin Arthur (QMA) of problems, relevant for quantum chemistry and for general spin problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_24308 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Computing, Ising Formulation, and the Traveling Salesman Problem Gurevich, Omer Matityahu, Maor Mor, Tal Quantum Physics Computational Engineering, Finance, and Science 81P68, 90C27 F.1.1; F.2.2 Ising formulation is important for many NP problems (Lucas, 2014). This formulation enables implementing novel quantum computing methods including Quantum Approximate Optimization Algorithm and Variational Quantum Eigensolver (VQE). Here, we investigate closely the traveling salesman problem (TSP). First, we present some non-trivial issues related to Ising model view versus a realistic salesman. Then, focusing on VQE we discuss and clarify the use of: a.-- Conventional VQE and how it is relevant as a novel SAT-solver; b.-- Qubit efficiency and its importance in the Noisy Intermediate Scale Quantum-era; and c.-- the relevance and importance of a novel approach named Discrete Quantum Exhaustive Search (Alfassi, Meirom, and Mor, 2024), for enhancing VQE and other methods using mutually unbiased bases. The approach we present here in details can potentially be extended for analyzing approximating and solving various other NP complete problems. Our approach can also be extended beyond the Ising model and beyond the class NP, for example to the class Quantum Merlin Arthur (QMA) of problems, relevant for quantum chemistry and for general spin problems. |
| title | Quantum Computing, Ising Formulation, and the Traveling Salesman Problem |
| topic | Quantum Physics Computational Engineering, Finance, and Science 81P68, 90C27 F.1.1; F.2.2 |
| url | https://arxiv.org/abs/2512.24308 |