Cover Image

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Binimelis, Miquel Albertí
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Information Theory Optimization and Control 15A18, 47B02, 68Q12, 68W01, 81T32, 90C20, 90C27 F.2.1; G.1.6; G.1.3; F.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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 walk informed variational algorithm design
by: Matwiejew, Edric, et al.
Published: (2024)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
by: Ryabchenko, Alexander, et al.
Published: (2026)

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

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

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

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

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

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

Reliable Optimization Under Noise in Quantum Variational Algorithms
by: Novák, Vojtěch, et al.
Published: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

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

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

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

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

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
by: Emmerich, Michael T. M., et al.
Published: (2026)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
by: Gratton, Serge, et al.
Published: (2024)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
by: Gratton, Serge, et al.
Published: (2026)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
by: Bellavia, S., et al.
Published: (2025)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

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

Discovering Algorithms with Computational Language Processing
by: Bourdais, Theo, et al.
Published: (2025)

Practical Quantum CIM Empowerment via All-Domestic-Core Agentic Large Model
by: Rui, Wang, 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)

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

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

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

Examples of slow convergence for adaptive regularization optimization methods are not isolated
by: Toint, Philippe L.
Published: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
by: Gratton, Serge, et al.
Published: (2024)

Approximating Bimatrix Nash Equilibrium Via Trilinear Minimax
by: Kalantari, Bahman
Published: (2018)

Advances in Quantum Genetic Algorithms
by: Lima, Dennis, et al.
Published: (2025)

An Empirical Evaluation of Quantum-Inspired QUBO Methods for Heterogeneous HPC Workflow Mapping and Scheduling
by: Sharma, Aasish Kumar, et al.
Published: (2026)

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

Pauli-structured preconditioning for quantum linear system solvers
by: Nie, Hantao, et al.
Published: (2026)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
by: Fang, Xiaolei, et al.
Published: (2026)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
by: Foos, Josefine, et al.
Published: (2023)