activity
20212025
most citedHybrid Quantum-Classical Heuristic for the Bin Packing Problem

16 citations · 69 across the 7 of their papers we have counts for

collaborators

7 papers

quant-ph2025

Digital-Analog Quantum Computing with Qudits

Alatz Alvarez-Ahedo, Mikel Garcia de Andoin, Mikel Sanz

Digital-analog quantum computing with two-level systems is a computational paradigm that combines an analog Hamiltonian with single-qubit gates to achieve universality. We extend t…

quant-ph2023★ 2 cited

Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic

M. Garcia de Andoin, A. Bottarelli, S. Schmitt +3

Combinatorial optimization problems have attracted much interest in the quantum computing community in the recent years as a potential testbed to showcase quantum advantage. In thi…

quant-ph2022★ 13 cited

Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem

Mikel Garcia-de-Andoin, Izaskun Oregi, Esther Villar-Rodriguez +2

The Bin Packing Problem (BPP) stands out as a paradigmatic combinatorial optimization problem in logistics. Quantum and hybrid quantum-classical algorithms are expected to show an…

quant-ph2022★ 16 cited

Hybrid Quantum-Classical Heuristic for the Bin Packing Problem

Mikel Garcia de Andoin, Eneko Osaba, Izaskun Oregi +2

Optimization problems is one of the most challenging applications of quantum computers, as well as one of the most relevants. As a consequence, it has attracted huge efforts to obt…

quant-ph2021★ 15 cited

Mitigating noise in digital and digital-analog quantum computation

Paula García-Molina, Ana Martin, Mikel Garcia de Andoin +1

Noisy Intermediate-Scale Quantum (NISQ) devices lack error correction, limiting scalability for quantum algorithms. In this context, digital-analog quantum computing (DAQC) offers…

quant-ph2021★ 10 cited

Implementable Hybrid Quantum Ant Colony Optimization Algorithm

Mikel Garcia de Andoin, Javier Echanobe

We propose a new hybrid quantum algorithm based on the classical Ant Colony Optimization algorithm to produce approximate solutions for NP-hard problems, in particular optimization…