Copertina

Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Ali, Alejandro Mata
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Emerging Technologies Quantum Physics 90C27, 90C20, 81Q99 G.1.6; G.2.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2023)

A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

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

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
di: Ali, Alejandro Mata
Pubblicazione: (2025)

A QUBO Formulation for the Generalized Takuzu/LinkedIn Tango Game
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2024)

Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA
di: Ali, Alejandro Mata
Pubblicazione: (2025)

Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective
di: Ali, Alejandro Mata, et al.
Pubblicazione: (2023)

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
di: Subiñas, Sergio Muñiz, et al.
Pubblicazione: (2025)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
di: Bärligea, Adelina, et al.
Pubblicazione: (2025)

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems
di: Binimelis, Miquel Albertí
Pubblicazione: (2024)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
di: Ostermann, Birte, et al.
Pubblicazione: (2025)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
di: Bhadoriya, Abhay Singh, et al.
Pubblicazione: (2024)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem
di: Bihani, Omkar, et al.
Pubblicazione: (2025)

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

Quantum walk informed variational algorithm design
di: Matwiejew, Edric, et al.
Pubblicazione: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
di: Warme, David M.
Pubblicazione: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
di: Warme, David M.
Pubblicazione: (2024)

OPM, a collection of Optimization Problems in Matlab
di: Gratton, Serge, et al.
Pubblicazione: (2021)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
di: Circelli, Michele
Pubblicazione: (2026)

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
di: Pozo, Miguel A., et al.
Pubblicazione: (2022)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
di: Bui, Quang Minh, et al.
Pubblicazione: (2022)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
di: Hancock, James, et al.
Pubblicazione: (2023)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
di: Hancock, James, et al.
Pubblicazione: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

Modern column generation for estimating single- and multi-purchase ranked list choice models
di: Costa, Luciano, et al.
Pubblicazione: (2026)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Nonlinear PageRank Problem for Local Graph Partitioning
di: Kodsi, Costy, et al.
Pubblicazione: (2024)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
di: Jin, Tao, et al.
Pubblicazione: (2025)

Measuring diversity. A review and an empirical analysis
di: Parreño, Francisco, et al.
Pubblicazione: (2024)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
di: Li, Zijun, et al.
Pubblicazione: (2026)

Improved global performance guarantees of second-order methods in convex minimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Mutually Unbiased Bases for Variational Quantum Initialization: Basis-Union Optimality and Adaptive Family Search
di: Semre, Abed, et al.
Pubblicazione: (2026)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
di: Gao, Yan, et al.
Pubblicazione: (2025)

On the Dual of the Solvency Cone
di: Löhne, Andreas, et al.
Pubblicazione: (2014)

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
di: Perron, Cédrick, et al.
Pubblicazione: (2025)

A Polyhedral Perspective on the Perfect Matching Lattice
di: Silina, Olha
Pubblicazione: (2025)

Constrained Portfolio Optimization via Quantum Approximate Optimization Algorithm (QAOA) with XY-Mixers and Trotterized Initialization: A Hybrid Approach for Direct Indexing
di: Mancilla, Javier, et al.
Pubblicazione: (2026)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
di: da Silva, Renan F. F., et al.
Pubblicazione: (2026)