Cover Image

Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ciacco, Alessia, Pugliese, Luigi Di Puglia, Guerriero, Francesca
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Traveling Salesman Problem with a preprocessing method for classical and quantum optimization
by: Ciacco, Alessia, et al.
Published: (2026)

Steiner Traveling Salesman Problem with Quantum Annealing
by: Ciacco, Alessia, et al.
Published: (2025)

Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization
by: Ciacco, Alessia, et al.
Published: (2025)

Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler
by: Goldsmith, Daniel, et al.
Published: (2024)

Proposal of method to solve a Traveling Salesman Problem using Variational Quantum Kolmogorov-Arnold Network
by: Wakaura, Hikaru
Published: (2025)

Warm-Starting PCE for Traveling Salesman Problem
by: Carmo, Rafael S. do, et al.
Published: (2025)

Quantum Annealing for Staff Scheduling in Educational Environments
by: Ciacco, Alessia, et al.
Published: (2025)

Quantum Optimization Methods for the Generalized Traveling Salesman Problem
by: Zorn, Maximilian, et al.
Published: (2026)

A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem
by: Lin, Yuefeng, et al.
Published: (2026)

Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
by: Sato, Rei, et al.
Published: (2024)

Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy
by: Liu, Chen-Yu, et al.
Published: (2024)

Solving the Traveling Salesman Problem via Different Quantum Computing Architectures
by: Padmasola, Venkat, et al.
Published: (2025)

Efficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problem
by: Koshikawa, Shota, et al.
Published: (2024)

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

Solving The Travelling Salesman Problem Using A Single Qubit
by: Goswami, Kapil, et al.
Published: (2024)

Solving larger Travelling Salesman Problem networks with a penalty-free Variational Quantum Algorithm
by: Goldsmith, Daniel, et al.
Published: (2025)

Quantum Computing, Ising Formulation, and the Traveling Salesman Problem
by: Gurevich, Omer, et al.
Published: (2025)

Tensor-Network Formulation of the Traveling Salesman Problem and Variants
by: Ali, Alejandro Mata, et al.
Published: (2023)

Quantum and quantum-inspired optimization for solving the minimum bin packing problem
by: Bozhedarov, A. A., et al.
Published: (2023)

Low-depth Clifford circuits approximately solve MaxCut
by: Muñoz-Arias, Manuel H., et al.
Published: (2023)

Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
by: Ramezani, Mehdi, et al.
Published: (2024)

Comparative analysis of diverse methodologies for portfolio optimization leveraging quantum annealing techniques
by: Tang, Zhijie, et al.
Published: (2024)

A heuristic for solving the irregular strip packing problem with quantum optimization
by: Matt, Paul-Amaury, et al.
Published: (2024)

Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance
by: Wang, Shengbin, et al.
Published: (2024)

Avoided crossings, degeneracies and Berry phases in the spectrum of quantum noise of driven-dissipative bosonic systems
by: Patera, Giuseppe, et al.
Published: (2025)

Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization
by: Castro, Erick R., et al.
Published: (2023)

Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games
by: Ali, Alejandro Mata
Published: (2025)

Efficient variational quantum eigensolver methodologies on quantum processors
by: Pandey, Tushar, et al.
Published: (2024)

Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
by: Inoue, Wataru, et al.
Published: (2023)

CutQAS: Topology-aware quantum circuit cutting via reinforcement learning
by: Sadhu, Abhishek, et al.
Published: (2025)

Performance of Parity QAOA for the Signed Max-Cut Problem
by: Weidinger, Anita, et al.
Published: (2024)

Efficient quantum algorithm for solving differential equations with Fourier nonlinearity via Koopman linearization
by: Katz, Judd, et al.
Published: (2025)

A methodology for comparing and benchmarking quantum devices
by: Park, Jessica, et al.
Published: (2024)

Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
by: Schnaus, Manuel, et al.
Published: (2024)

Variational methods for solving high dimensional quantum systems
by: Li, Daming
Published: (2024)

On the Effects of Small Graph Perturbations in the MaxCut Problem by QAOA
by: Lavagna, Leonardo, et al.
Published: (2024)

Coherent control of photon pairs via quantum interference between second- and third-order quantum nonlinear processes
by: Stefano, Alessia, et al.
Published: (2026)

Hybrid Learning and Optimization methods for solving Capacitated Vehicle Routing Problem
by: Sharma, Monit, et al.
Published: (2025)

Second order cone relaxations for quantum Max Cut
by: Huber, Felix, et al.
Published: (2024)

Retrieving space-dependent polarization transformations via near-optimal quantum process tomography
by: Di Colandrea, Francesco, et al.
Published: (2022)