Quantum computing in telecommunication—a survey

F Phillipson - Mathematics, 2023 - mdpi.com
Quantum computing, an emerging paradigm based on the principles of quantum mechanics,
has the potential to revolutionise various industries, including Telecommunications. This …

Graph algorithms with neutral atom quantum processors

C Dalyac, L Leclerc, L Vignoli, M Djellabi… - The European Physical …, 2024 - Springer
Neutral atom technology has steadily demonstrated significant theoretical and experimental
advancements, positioning itself as a front-runner platform for running quantum algorithms …

Efficient algorithm for binary quadratic problem by column generation and quantum annealing

S Hirama, M Ohzeki - Journal of the Physical Society of Japan, 2023 - journals.jps.jp
We propose an efficient algorithm that combines column generation and quantum annealing
to solve binary quadratic problems. Binary quadratic problems are difficult to solve because …

Mixed-integer linear programming solver using Benders decomposition assisted by a neutral-atom quantum processor

MY Naghmouchi, WS Coelho - Physical Review A, 2024 - APS
This paper presents a hybrid classical-quantum approach to solve mixed-integer linear
programming (MILP) using neutral-atom quantum computations. We apply Benders …

Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness

N Franco, T Wollschläger, B Poggel… - 2023 IEEE …, 2023 - ieeexplore.ieee.org
Emerging quantum computing technologies, such as Noisy Intermediate-Scale Quantum
(NISQ) devices, offer potential advancements in solving mathematical optimization …

Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems

H Kanai, M Yamashita, K Tanahashi… - arxiv preprint arxiv …, 2024 - arxiv.org
Ising machines are expected to solve combinatorial optimization problems faster than the
existing integer programming solvers. These problems, particularly those encountered in …

Decomposition-based heuristic approaches for the satellite constellation design problem

L Mencarelli, J Floquet - Engineering Optimization, 2024 - Taylor & Francis
Satellite constellation design problems have been vastly investigated in the existing
literature. This work explores decomposition-based methods for the satellite constellation …

Improved Sparse Ising Optimization

KM Zick - arxiv preprint arxiv:2311.09275, 2023 - arxiv.org
Sparse Ising problems can be found in application areas such as logistics, condensed
matter physics and training of deep Boltzmann networks, but can be very difficult to tackle …

Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing

F Wagner, F Liers - arxiv preprint arxiv:2412.15665, 2024 - arxiv.org
Motivated by recent progress in quantum hardware and algorithms researchers have
developed quantum heuristics for optimization problems, aiming for advantages over …

Analog Counterdiabatic Quantum Computing

Q Zhang, NN Hegade, AG Cadavid… - arxiv preprint arxiv …, 2024 - arxiv.org
We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial
optimization problems on neutral-atom quantum processors. While these devices allow for …