Copertina

A QUBO Formulation for the Generalized Takuzu/LinkedIn Tango Game

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ali, Alejandro Mata, Mencia, Edgar
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Other Computer Science History and Overview 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

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

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

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

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

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

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

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

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)

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

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

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

Succinct QUBO formulations for permutation problems by sorting networks
di: Friedl, Katalin, et al.
Pubblicazione: (2026)

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

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

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

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)

A simple algorithm for the simple bilevel programming (SBP) problem
di: Dempe, Stephan, et al.
Pubblicazione: (2025)

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

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

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

A random-key GRASP for combinatorial optimization
di: Chaves, Antonio A., et al.
Pubblicazione: (2024)

Random-key genetic algorithms: Principles and applications
di: Londe, Mariana A., et al.
Pubblicazione: (2025)

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

Modern column generation for estimating single- and multi-purchase ranked list choice models
di: Costa, Luciano, 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)

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

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
di: Gratton, S., et al.
Pubblicazione: (2022)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
di: Gratton, S., et al.
Pubblicazione: (2026)

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

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

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

A cutting plane algorithm for globally solving low dimensional k-means clustering problems
di: Ryner, Martin, et al.
Pubblicazione: (2024)

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)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
di: Halemane, Keshava Prasad
Pubblicazione: (2014)

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

Unlocking Your Bike the Easy Way
di: Sonnleitner, Mathias
Pubblicazione: (2023)

Quasi-binary encoding based quantum alternating operator ansatz
di: Chen, Bingren, et al.
Pubblicazione: (2023)