A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ali, Alejandro Mata, Mencia, Edgar
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Emerging Technologies Popular Physics 90C27, 90C20, 81Q99 G.1.6; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A Polyhedral Perspective on the Perfect Matching Lattice
by: Silina, Olha
Published: (2025)

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

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

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

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

On the characterization of graphs with tree 3-spanners
by: Lin, Lan, et al.
Published: (2025)

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

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

Peak state transfer in continuous quantum walks
by: Coutinho, Gabriel, et al.
Published: (2025)

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

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

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
by: Hahn, William, et al.
Published: (2026)

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

Automatic cable harness layout routing in a customizable 3D environment
by: Karlsson, T., et al.
Published: (2023)

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

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

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

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

An optimally fast objective-function-free minimization algorithm using random subspaces
by: Bellavia, S., et al.
Published: (2023)

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

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

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