Mapping a logical representation of TSP to quantum annealing
From MaRDI portal
Publication:2099624
DOI10.1007/s11128-021-03321-8OpenAlexW3212921497MaRDI QIDQ2099624
Carla Silva, Ana Aguiar, Inês Dutra, Priscila M. V. Lima
Publication date: 24 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03321-8
applicationsadiabatic quantum computationpseudo-Boolean optimizationquadratic unconstrained binary optimizationconstraint and logic programming
Uses Software
Cites Work
- Unnamed Item
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- ``Neural computation of decisions in optimization problems
- Quantum annealing learning search for solving QUBO problems
- Integer programming techniques for minor-embedding in quantum annealers
- Theory versus practice in annealing-based quantum computing
- Models in quantum computing: a systematic review
- The quantum adiabatic optimization algorithm and local minima
- State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
- On parameter settings of Hopfield networks applied to traveling salesman problems
- PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
- Neural networks and physical systems with emergent collective computational abilities.
This page was built for publication: Mapping a logical representation of TSP to quantum annealing
