Esther Villar-Rodriguez
Research Subjects
Esther Villar-Rodriguez has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Eneko Osaba
TECNALIA, Basque Research and Technology Alliance (BRTA), Derio, Spain
13 shared publications - Izaskun Oregi
TECNALIA, Basque Research and Technology Alliance (BRTA), Derio, Spain
7 shared publications - Javier Del Ser
University of the Basque Country UPV/EHU
6 shared publications - Sebastián Vidal Romero
Department of Physical Chemistry, University of the Basque Country UPV/EHU, Bilbao, Spain
3 shared publications - Yue Ban
CSIC
3 shared publications - Ana Isabel Torre Bastida
Tecnalia (España)
2 shared publications
Latest Publications
- Top Cited Papers
- 17 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Addressing the minor-embedding problem in quantum annealing and evaluating state-of-the-art algorithm performance
- 17 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Top Cited PapersAddressing the minor-embedding problem in quantum annealing and evaluating state-of-the-art algorithm performance
- 22 February 2026
- Published by Wiley in Expert Systems
- Vol. 43 (4)
On the Transfer of Knowledge in Quantum Algorithms
Quantum computing is poised to transform computational paradigms across science and industry. As the field evolves, it can benefit from established classical methodologies, including promising paradigms such as Transfer of Knowledge (ToK). This work serves as a brief, self‐contained reference for ToK, unifying its core principles under a single formal framework. We introduce a joint notation that consolidates and extends prior work in Transfer Learning and Transfer Optimisation, bridging traditionally separate research lines and enabling a common language for knowledge reuse. Building on this foundation, we classify existing ToK strategies and principles into a structured taxonomy that helps researchers position their methods within a broader conceptual map. We then extend key transfer protocols to quantum computing, introducing two novel use cases—reverse annealing and multitasking Quantum Approximate Optimization Algorithm (QAOA)—alongside a sequential Variational Quantum Eigensolver (VQE) approach that supports and validates prior findings. These examples highlight ToK's potential to improve performance and generalisation in quantum algorithms. Finally, we outline challenges and opportunities for integrating ToK into quantum computing, emphasising its role in reducing resource demands and accelerating problem‐solving. This work lays the groundwork for future synergies between classical and quantum computing through a shared, transferable knowledge framework.
- 22 February 2026
- Published by Wiley in Expert Systems
- Vol. 43 (4)
On the Transfer of Knowledge in Quantum Algorithms
Quantum computing is poised to transform computational paradigms across science and industry. As the field evolves, it can benefit from established classical methodologies, including promising paradigms such as Transfer of Knowledge (ToK). This work serves as a brief, self‐contained reference for ToK, unifying its core principles under a single formal framework. We introduce a joint notation that consolidates and extends prior work in Transfer Learning and Transfer Optimisation, bridging traditionally separate research lines and enabling a common language for knowledge reuse. Building on this foundation, we classify existing ToK strategies and principles into a structured taxonomy that helps researchers position their methods within a broader conceptual map. We then extend key transfer protocols to quantum computing, introducing two novel use cases—reverse annealing and multitasking Quantum Approximate Optimization Algorithm (QAOA)—alongside a sequential Variational Quantum Eigensolver (VQE) approach that supports and validates prior findings. These examples highlight ToK's potential to improve performance and generalisation in quantum algorithms. Finally, we outline challenges and opportunities for integrating ToK into quantum computing, emphasising its role in reducing resource demands and accelerating problem‐solving. This work lays the groundwork for future synergies between classical and quantum computing through a shared, transferable knowledge framework.
- Open Access
Exploring the application of quantum technologies to industrial and real-world use cases
Recent advancements in quantum computing are leading to an era of practical utility, enabling the tackling of increasingly complex problems. The goal of this era is to leverage quantum computing to solve real-world problems in fields such as machine learning, optimization, and material simulation, using revolutionary quantum methods and machines. All this progress has been achieved even while being immersed in the noisy intermediate-scale quantum era, characterized by the current devices' inability to process medium-scale complex problems efficiently. Consequently, there has been a surge of interest in quantum algorithms in various fields. Multiple factors have played a role in this extraordinary development, with three being particularly noteworthy: (i) the development of larger devices with enhanced interconnections between their constituent qubits, (ii) the development of specialized frameworks, and (iii) the existence of well-known or ready-to-use hybrid schemes that simplify the method development process. In this context, this manuscript presents and overviews some recent contributions within this paradigm, showcasing the potential of quantum computing to emerge as a significant research catalyst in the fields of machine learning and optimization in the coming years.
Open AccessExploring the application of quantum technologies to industrial and real-world use cases
Recent advancements in quantum computing are leading to an era of practical utility, enabling the tackling of increasingly complex problems. The goal of this era is to leverage quantum computing to solve real-world problems in fields such as machine learning, optimization, and material simulation, using revolutionary quantum methods and machines. All this progress has been achieved even while being immersed in the noisy intermediate-scale quantum era, characterized by the current devices' inability to process medium-scale complex problems efficiently. Consequently, there has been a surge of interest in quantum algorithms in various fields. Multiple factors have played a role in this extraordinary development, with three being particularly noteworthy: (i) the development of larger devices with enhanced interconnections between their constituent qubits, (ii) the development of specialized frameworks, and (iii) the existence of well-known or ready-to-use hybrid schemes that simplify the method development process. In this context, this manuscript presents and overviews some recent contributions within this paradigm, showcasing the potential of quantum computing to emerge as a significant research catalyst in the fields of machine learning and optimization in the coming years.
- Open Access
- 5 May 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (7) , 1-6
Exploring the application of quantum technologies to industrial and real-world use cases
- 5 May 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (7) , 1-6
Open AccessExploring the application of quantum technologies to industrial and real-world use cases
- Open Access
- 21 October 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-14
Solving a real-world package delivery routing problem using quantum annealers
Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The real-world applicability of these problems is dependent on the objectives and constraints considered. Anyway, it is undeniable that it is often difficult to translate complex requirements into these classical formulations. The main objective of this research is to present a solving scheme for dealing with realistic instances while maintaining all the characteristics and restrictions of the original real-world problem. Thus, a quantum-classical strategy has been developed, coined Q4RPD, that considers a set of real constraints such as a heterogeneous fleet of vehicles, priority deliveries, and capacities characterized by two values: weight and dimensions of the packages. Q4RPD resorts to the Leap Constrained Quadratic Model Hybrid Solver of D-Wave. To demonstrate the application of Q4RPD, an experimentation composed of six different instances has been conducted, aiming to serve as illustrative examples.
- 21 October 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-14
Open AccessSolving a real-world package delivery routing problem using quantum annealers
Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The real-world applicability of these problems is dependent on the objectives and constraints considered. Anyway, it is undeniable that it is often difficult to translate complex requirements into these classical formulations. The main objective of this research is to present a solving scheme for dealing with realistic instances while maintaining all the characteristics and restrictions of the original real-world problem. Thus, a quantum-classical strategy has been developed, coined Q4RPD, that considers a set of real constraints such as a heterogeneous fleet of vehicles, priority deliveries, and capacities characterized by two values: weight and dimensions of the packages. Q4RPD resorts to the Leap Constrained Quadratic Model Hybrid Solver of D-Wave. To demonstrate the application of Q4RPD, an experimentation composed of six different instances has been conducted, aiming to serve as illustrative examples.
- Open Access
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 71808-71820
Quantum Optimization Methods for Satellite Mission Planning
Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a satellite. The ever-growing amount of satellites in orbit underscores the need to operate them efficiently, which requires solving many instances of the problem in short periods of time. However, current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative that could lead to significant improvements in solution quality or execution speed in the future. To this end, we study a planning problem with a variety of intricate constraints and discuss methods to encode them for quantum computers. Additionally, we experimentally assess the performance of quantum annealing and the quantum approximate optimization algorithm on a realistic and diverse dataset. Our results identify key aspects like graph connectivity and constraint structure that influence the performance of the methods. We explore the limits of today’s quantum algorithms and hardware, providing bounds on the problems that can be currently solved successfully and showing how the solution degrades as the complexity grows. This work aims to serve as a baseline for further research in the field and establish realistic expectations on current quantum optimization capabilities.
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 71808-71820
Open AccessQuantum Optimization Methods for Satellite Mission Planning
Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a satellite. The ever-growing amount of satellites in orbit underscores the need to operate them efficiently, which requires solving many instances of the problem in short periods of time. However, current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative that could lead to significant improvements in solution quality or execution speed in the future. To this end, we study a planning problem with a variety of intricate constraints and discuss methods to encode them for quantum computers. Additionally, we experimentally assess the performance of quantum annealing and the quantum approximate optimization algorithm on a realistic and diverse dataset. Our results identify key aspects like graph connectivity and constraint structure that influence the performance of the methods. We explore the limits of today’s quantum algorithms and hardware, providing bounds on the problems that can be currently solved successfully and showing how the solution degrades as the complexity grows. This work aims to serve as a baseline for further research in the field and establish realistic expectations on current quantum optimization capabilities.
- Open Access
QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
In this paper, we propose a quantum computing oriented benchmark for combinatorial optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally distributed over four well-known problems: Traveling Salesman Problem, Vehicle Routing Problem, one-dimensional Bin Packing Problem and the Maximum Cut Problem. The sizes of the instances in QOPTLib not only correspond to computationally addressable sizes, but also to the maximum length approachable with non-zero likelihood of getting a good result. In this regard, it is important to highlight that hybrid approaches are also taken into consideration. Thus, this benchmark constitutes the first effort to provide users a general-purpose dataset. Also in this paper, we introduce a first full solving of QOPTLib using two solvers based on quantum annealing. Our main intention with this is to establish a preliminary baseline, hoping to inspire other researchers to beat these outcomes with newly proposed quantum-based algorithms.
Open AccessQOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
In this paper, we propose a quantum computing oriented benchmark for combinatorial optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally distributed over four well-known problems: Traveling Salesman Problem, Vehicle Routing Problem, one-dimensional Bin Packing Problem and the Maximum Cut Problem. The sizes of the instances in QOPTLib not only correspond to computationally addressable sizes, but also to the maximum length approachable with non-zero likelihood of getting a good result. In this regard, it is important to highlight that hybrid approaches are also taken into consideration. Thus, this benchmark constitutes the first effort to provide users a general-purpose dataset. Also in this paper, we introduce a first full solving of QOPTLib using two solvers based on quantum annealing. Our main intention with this is to establish a preliminary baseline, hoping to inspire other researchers to beat these outcomes with newly proposed quantum-based algorithms.
- 22 August 2023
- Published by Springer Nature
- p. 49-63
QOPTLib: A Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
- 22 August 2023
- Published by Springer Nature
- p. 49-63
QOPTLib: A Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
- Open Access
- 21 July 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-11
Hybrid approach for solving real-world bin packing problem instances using quantum annealers
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (), considering different realistic characteristics, such as: (1) package and bin dimensions, (2) overweight restrictions, (3) affinities among item categories and (4) preferences for item ordering. permits the solving of real-world oriented instances of 3 dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.
- 21 July 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-11
Open AccessHybrid approach for solving real-world bin packing problem instances using quantum annealers
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (), considering different realistic characteristics, such as: (1) package and bin dimensions, (2) overweight restrictions, (3) affinities among item categories and (4) preferences for item ordering. permits the solving of real-world oriented instances of 3 dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.
- Open Access
Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (Q4RealBPP), considering different realistic characteristics, such as: i) package and bin dimensions, ii) overweight restrictions, iii) affinities among item categories and iv) preferences for item ordering. Q4RealBPP permits the solving of real-world oriented instances of 3dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.
Open AccessHybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (Q4RealBPP), considering different realistic characteristics, such as: i) package and bin dimensions, ii) overweight restrictions, iii) affinities among item categories and iv) preferences for item ordering. Q4RealBPP permits the solving of real-world oriented instances of 3dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.