Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

QuantumCLEF 2025: Overview of the Second Quantum Computing Challenge for Information Retrieval and Recommender Systems at CLEF

Pasin A., Ferrari Dacrema M., Cunha W., Goncalves M. A., Cremonesi P., Ferro N.

Published Jan 1, 2025• 0 citations
OpenAlex

Abstract

The emerging field of Quantum Computing (QC) is attracting considerable research interest due to its potential. It is in fact believed that QC could revolutionize the way we approach complex problems by significantly reducing the time required to solve them. Although QC is still in its early stages of development, certain problems can already be addressed using quantum computers, offering a glimpse into its capabilities. The goal of the QuantumCLEF lab is to raise awareness of QC and to design, develop, and evaluate new QC algorithms aimed at solving challenges typically encountered in the implementation of Information Retrieval (IR) and Recommender Systems (RS). Furthermore, the lab provides a valuable opportunity to engage with QC technologies, which are often difficult to access. In this work, we present an overview of the second edition of QuantumCLEF, a lab focused on applying Quantum Annealing (QA), a specific QC paradigm, to three tasks: Feature Selection for IR and RS systems, Instance Selection for IR systems, and Clustering for IR systems. A total of 44 teams registered for the lab, with 5 teams successfully submitting their runs in accordance with the lab guidelines. Given the novelty of the topics, participants were provided with extensive examples and comprehensive materials to help them understand how QA works and how to program quantum annealers.

Related papers

Using and Evaluating Quantum Computing for Information Retrieval and Recommender Systems

Maurizio Ferrari Dacrema, Andrea Pasin, Paolo Cremonesi +1 more

The field of Quantum Computing (QC) has gained significant popularity in recent years, due to its potential to provide benefits in terms of efficiency and effectiveness when employed to solve certain computationally intensive tasks. In both Information Retrieval (IR) and Recommender Systems (RS) we are required to build methods that apply complex processing on large and heterogeneous datasets, it is natural therefore to wonder whether QC could also be applied to boost their performance. The tutorial aims to provide first an introduction to QC for an audience that is not familiar with the technology, then to show how to apply the QC paradigm of Quantum Annealing (QA) to solve practical problems that are currently faced by IR and RS systems. During the tutorial, participants will be provided with the fundamentals required to understand QC and to apply it in practice by using a real D-Wave quantum annealer through APIs.

International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)•Jul 10, 2024•5 citations

Overview of QuantumCLEF 2025: The Second Quantum Computing Challenge for Information Retrieval and Recommender Systems at CLEF

Andrea Pasin, Maurizio Ferrari Dacrema, Washington Luiz Miranda da Cunha +3 more

Lecture notes in computer science•Sep 2, 2025•4 citations

Team SYZYGY at QuantumCLEF 2026: Feature Selection Using Quantum Annealing

Dhruv Khemani, Benedikt Kantz

Feature selection, the task of identifying the most informative subset of attributes from a large feature pool, is an NP-hard problem central to Information Retrieval (IR) and Recommender Systems (RS). This paper presents Team SYZYGY’s submission to Task 1 of the QuantumCLEF 2026 Lab, formulating feature selection as a Quadratic Unconstrained Binary Optimization (QUBO) problem solved on a D-Wave quantum annealer. For Task 1A (IR), we introduce five information-theoretic QUBO formulations that organically balance feature relevance and redundancy without hard cardinality constraints, combining mutual information, conditional mutual information, interaction information, and two normalized weighted mutual information variants. On the MQ2007 benchmark, our best configurations reduce the feature count from 46 to just 21 to 24 while surpassing both the full feature and recursive feature elimination baselines. For Task 1B (RS), a simplified collaborative driven QUBO aligns content based similarity with real user behavior, with the simulated annealer successfully improving over the full feature baseline while the physical quantum annealer is hampered by embedding complications. Across both tasks, quantum hardware completes sampling an order of magnitude faster than simulated annealing, though run to run inconsistencies on the physical QPU remain a key open challenge.

•Oct 4, 2026•0 citations

Overview of QuantumCLEF 2024: The Quantum Computing Challenge for Information Retrieval and Recommender Systems at CLEF

Andrea Pasin, Maurizio Ferrari Dacrema, Paolo Cremonesi +1 more

Lecture notes in computer science•Jan 1, 2024•16 citations

Investigating the Usage and Evaluation of Quantum Computing Technologies for Information Access

Andrea Pasin

Quantum Computing (QC) is an emerging research field that is attracting significant interest from the scientific community. In fact, it is believed that quantum computers can be employed to solve complex computational problems more efficiently than traditional computers, due to their inherent capabilities of exploring large search spaces very efficiently by leveraging the principles of quantum mechanics, such as superposition, entanglement, and tunnelling. However, quantum computers are still in their early stages of development and their applications are very limited, especially in the field of Information Access (IA). Nevertheless, IA systems often face complex optimization problems that might be solved more efficiently through the usage of quantum computers. This paper outlines the author's PhD objectives in designing new methodologies for the application and evaluation of QC technologies for IA problems. Furthermore, this work provides an overview of the achieved preliminary results and a discussion of possible future research directions.

ACM International Conference on Information and Knowledge Management (CIKM)•Nov 8, 2025•0 citations

Team GPLSI at QClef 2026: Quantum-Inspired Instance Selection and Clustering

Santiago Galiano Segura, Francisco Valero-Abellón, Mónica Sánchez Bellido +6 more

This paper presents the participation of the GPLSI team in the Quantum CLEF (QClef) Lab at CLEF 2026, focusing on Task 2 - Instance Selection and Task 3 - Clustering. The QClef Lab explores the applicability of quantum and quantum-inspired techniques to core AI tasks, emphasizing optimization efficiency and data reduction. For Task 2, we propose two multi-paradigm approaches for selecting representative training instances for sentiment classification: a precision-driven, SVM-augmented LocalSets method, and a compression-driven Reinforcement Learning approach based on stratified topological partitioning. For Task 3, we introduce a unified quantum-inspired clustering framework that integrates four distinct pivot selection strategies for document grouping in embedding space. Our methods achieved competitive performance across both tasks, highlighting a fundamental trade-off between predictive accuracy and computational efficiency. Notably, our LocalSets approach achieved the second highest classification effectiveness for instance selection, while our novel Query-aware Multilevel Graph Clustering strategy delivered the most robust results for Task 3, effectively balancing ranking preservation (nDCG@10) and cluster compactness (DBI). Overall, our findings support the potential of annealing-based techniques to deliver effective trade-offs between performance and computational efficiency in realistic machine learning pipelines.

•Oct 4, 2026•0 citations
The emerging field of Quantum Computing (QC) is attracting considerable research interest due to its potential. It is in fact believed that QC could revolutionize the way we approach complex problems by significantly reducing the time required to solve them. Although QC is still in its early stages of development, certain problems can already be addressed using quantum computers, offering a glimpse into its capabilities. The goal of the QuantumCLEF lab is to raise awareness of QC and to design, develop, and evaluate new QC algorithms aimed at solving challenges typically encountered in the implementation of Information Retrieval (IR) and Recommender Systems (RS). Furthermore, the lab provides a valuable opportunity to engage with QC technologies, which are often difficult to access. In this work, we present an overview of the second edition of QuantumCLEF, a lab focused on applying Quantum Annealing (QA), a specific QC paradigm, to three tasks: Feature Selection for IR and RS systems, Instance Selection for IR systems, and Clustering for IR systems. A total of 44 teams registered for the lab, with 5 teams successfully submitting their runs in accordance with the lab guidelines. Given the novelty of the topics, participants were provided with extensive examples and comprehensive materials to help them understand how QA works and how to program quantum annealers.
The field of Quantum Computing (QC) has gained significant popularity in recent years, due to its potential to provide benefits in terms of efficiency and effectiveness when employed to solve certain computationally intensive tasks. In both Information Retrieval (IR) and Recommender Systems (RS) we are required to build methods that apply complex processing on large and heterogeneous datasets, it is natural therefore to wonder whether QC could also be applied to boost their performance. The tutorial aims to provide first an introduction to QC for an audience that is not familiar with the technology, then to show how to apply the QC paradigm of Quantum Annealing (QA) to solve practical problems that are currently faced by IR and RS systems. During the tutorial, participants will be provided with the fundamentals required to understand QC and to apply it in practice by using a real D-Wave quantum annealer through APIs.
Feature selection, the task of identifying the most informative subset of attributes from a large feature pool, is an NP-hard problem central to Information Retrieval (IR) and Recommender Systems (RS). This paper presents Team SYZYGY’s submission to Task 1 of the QuantumCLEF 2026 Lab, formulating feature selection as a Quadratic Unconstrained Binary Optimization (QUBO) problem solved on a D-Wave quantum annealer. For Task 1A (IR), we introduce five information-theoretic QUBO formulations that organically balance feature relevance and redundancy without hard cardinality constraints, combining mutual information, conditional mutual information, interaction information, and two normalized weighted mutual information variants. On the MQ2007 benchmark, our best configurations reduce the feature count from 46 to just 21 to 24 while surpassing both the full feature and recursive feature elimination baselines. For Task 1B (RS), a simplified collaborative driven QUBO aligns content based similarity with real user behavior, with the simulated annealer successfully improving over the full feature baseline while the physical quantum annealer is hampered by embedding complications. Across both tasks, quantum hardware completes sampling an order of magnitude faster than simulated annealing, though run to run inconsistencies on the physical QPU remain a key open challenge.
Quantum Computing (QC) is an emerging research field that is attracting significant interest from the scientific community. In fact, it is believed that quantum computers can be employed to solve complex computational problems more efficiently than traditional computers, due to their inherent capabilities of exploring large search spaces very efficiently by leveraging the principles of quantum mechanics, such as superposition, entanglement, and tunnelling. However, quantum computers are still in their early stages of development and their applications are very limited, especially in the field of Information Access (IA). Nevertheless, IA systems often face complex optimization problems that might be solved more efficiently through the usage of quantum computers. This paper outlines the author's PhD objectives in designing new methodologies for the application and evaluation of QC technologies for IA problems. Furthermore, this work provides an overview of the achieved preliminary results and a discussion of possible future research directions.
This paper presents the participation of the GPLSI team in the Quantum CLEF (QClef) Lab at CLEF 2026, focusing on Task 2 - Instance Selection and Task 3 - Clustering. The QClef Lab explores the applicability of quantum and quantum-inspired techniques to core AI tasks, emphasizing optimization efficiency and data reduction. For Task 2, we propose two multi-paradigm approaches for selecting representative training instances for sentiment classification: a precision-driven, SVM-augmented LocalSets method, and a compression-driven Reinforcement Learning approach based on stratified topological partitioning. For Task 3, we introduce a unified quantum-inspired clustering framework that integrates four distinct pivot selection strategies for document grouping in embedding space. Our methods achieved competitive performance across both tasks, highlighting a fundamental trade-off between predictive accuracy and computational efficiency. Notably, our LocalSets approach achieved the second highest classification effectiveness for instance selection, while our novel Query-aware Multilevel Graph Clustering strategy delivered the most robust results for Task 3, effectively balancing ranking preservation (nDCG@10) and cluster compactness (DBI). Overall, our findings support the potential of annealing-based techniques to deliver effective trade-offs between performance and computational efficiency in realistic machine learning pipelines.