Cover Image

Solving The Travelling Salesman Problem Using A Single Qubit

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goswami, Kapil, Veereshi, Gagan Anekonda, Schmelcher, Peter, Mukherjee, Rick
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Integer Programming Using A Single Atom
by: Goswami, Kapil, et al.
Published: (2024)

Qudit-based scalable quantum algorithm for solving the integer programming problem
by: Goswami, Kapil, et al.
Published: (2025)

A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer
by: Goswami, Kapil, et al.
Published: (2026)

Solving optimization problems with local light shift encoding on Rydberg quantum annealers
by: Goswami, Kapil, et al.
Published: (2023)

Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
by: Zhan, Junpeng
Published: (2023)

Towards Exponential Quantum Improvements in Solving Cardinality-Constrained Binary Optimization
by: Yuan, Haomu, et al.
Published: (2026)

Strassen's support functionals coincide with the quantum functionals
by: Sakabe, Keiya, et al.
Published: (2026)

(Sub)Exponential Quantum Speedup for Optimization
by: Leng, Jiaqi, et al.
Published: (2025)

Tensor Network Generator-Enhanced Optimization for Traveling Salesman Problem
by: Sakai, Ryo, et al.
Published: (2026)

Counterfactual Explanations for Integer Optimization Problems
by: Engelhardt, Felix, et al.
Published: (2025)

PSO and the Traveling Salesman Problem: An Intelligent Optimization Approach
by: Araújo, Kael Silva, et al.
Published: (2025)

A parallel framework for graphical optimal transport
by: Fan, Jiaojiao, et al.
Published: (2024)

A parameterized linear formulation of the integer hull
by: Eisenbrand, Friedrich, et al.
Published: (2025)

High-fidelity non-adiabatic dark state gates for neutral atoms
by: Mostaan, Nader, et al.
Published: (2026)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
by: Maitra, Sarit
Published: (2024)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
by: Ketkov, Sergey S., et al.
Published: (2026)

Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms
by: Yang, Jian, et al.
Published: (2026)

Solving convex QPs with structured sparsity under indicator conditions
by: Bienstock, Daniel, et al.
Published: (2024)

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
by: Silva, Jefferson D. S., et al.
Published: (2025)

On parametric formulations for the Asymmetric Traveling Salesman Problem
by: Angulo, Gustavo, et al.
Published: (2024)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
by: Ketkov, Sergey S., et al.
Published: (2024)

Avoiding Deadlocks via Weak Deadlock Sets
by: Oriolo, Gianpaolo, et al.
Published: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
by: Jiao, Xianqi, et al.
Published: (2024)

Geometric and computational hardness of bilevel programming
by: Bolte, Jérôme, et al.
Published: (2024)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
by: Sim, Chee-Khian
Published: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
by: Tyurin, Alexander
Published: (2024)

On the Complexity of p-Order Cone Programs
by: Blanco, Víctor, et al.
Published: (2025)

Hardness of some optimization problems over correlation polyhedra
by: Caprara, Alberto, et al.
Published: (2026)

On the Induced Norms of Matrices and Grothendieck problems
by: Truong, Lan V., et al.
Published: (2026)

Efficient LP warmstarting for linear modifications of the constraint matrix
by: Derval, Guillaume, et al.
Published: (2025)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
by: Majumdar, Angshul
Published: (2026)

On the Degree Automatability of Sum-of-Squares Proofs
by: Bortolotti, Alex, et al.
Published: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
by: Büsing, Christina, et al.
Published: (2025)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
by: Chen, Ying, et al.
Published: (2025)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
by: Lee, Jongmin, et al.
Published: (2026)

The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
by: Boche, Holger, et al.
Published: (2025)

The Complexity of Recognizing Facets for the Knapsack Polytope
by: Chen, Rui, et al.
Published: (2022)

Information Redistribution Under Reductions in NP Search
by: Wei, Jing-Yuan
Published: (2026)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
by: Acharya, Jayadev, et al.
Published: (2025)