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

arXiv:1411.3843

Quantum emulation of query extension in information retrieval

Romàn R. Zapatrin

Published Nov 14, 2014• 1 citation
arXivHTMLPDF

Abstract

An operationalistic scheme, called Melucci metaphor, is suggested representing Information Retrieval as physical measurements with beam of particles playing the role of the flow of retrieved documents. The possibilities of query expansion by extra term are studied from this perspective, when the particles-`docuscles' are assumed to be of classical or quantum nature. It is shown that in both cases the choice of an extra term based on Bayesian belief revision is still valid on the qualitative level for boosting the relevance of the retrieved documents.

DOI
10.48550/arxiv.1411.3843

Related papers

Quantum contextuality in classical information retrieval

Romàn R. Zapatrin

Document ranking based on probabilistic evaluations of relevance is known to exhibit non-classical correlations, which may be explained by admitting a complex structure of the event space, namely, by assuming the events to emerge from multiple sample spaces. The structure of event space formed by overlapping sample spaces is known in quantum mechanics, they may exhibit some counter-intuitive features, called quantum contextuality. In this Note I observe that from the structural point of view quantum contextuality looks similar to personalization of information retrieval scenarios. Along these lines, Knowledge Revision is treated as operationalistic measurement and a way to quantify the rate of personalization of Information Retrieval scenarios is suggested.

arXiv:1205.5632•Fundamental Journal of Mathematics and Applications•Jun 30, 2018•1 citation

A Query Algebra for Quantum Information Retrieval.

Annalina Caputo, Benjamin Piwowarski, Mounia Lalmas

Abstract The formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework is based on the notion of information need vector spaces, where events, such as document relevance, correspond to subspaces, and user information needs are represented as weighted sets of vectors. In this paper, we look at possible ways to build, using an algebra defined over weighted sets, sophisticated query representations and report on corresponding experiments on TREC. 1

IIR eBooks•Jan 1, 2011•5 citations

A toy model of information retrieval system based on quantum probability

Romàn R. Zapatrin

Recent numerical results show that non-Bayesian knowledge revision may be helpful in search engine training and optimization. In order to demonstrate how basic assumption about about the physical nature (and hence the observed statistics) of retrieved documents can affect the performance of search engines we suggest an idealized toy model with minimal number of parameters.

arXiv:1305.5330•May 23, 2013•1 citation

Exploring a multidimensional representation of documents and queries

Benjamin Piwowarski, Mounia Lalmas, Ingo Frommholz +1 more

n Information Retrieval (IR), whether implicitly or explicitly, queries and documents are often represented as vectors. However, it may be more beneficial to consider documents and/or queries as multidimensional objects. Our belief is this would allow building "truly" interactive IR systems, i.e., where interaction is fully incorporated in the IR framework. The probabilistic formalism of quantum physics represents events and densities as multidimensional objects. This paper presents our first step towards building an interactive IR framework upon this formalism, by stating how the first interaction of the retrieval process, when the user types a query, can be formalised.

•Apr 28, 2010•12 citations

Quantum Approach for Contextual Search, Retrieval, and Ranking of Classical Information

A. P. Alodjants, A. E. Avdyushina, Dmitriy V. Tsarev +2 more

Quantum-inspired algorithms represent an important direction in modern software information technologies that use heuristic methods and approaches of quantum science. This work presents a quantum approach for document search, retrieval, and ranking based on the Bell-like test, which is well-known in quantum physics. We propose quantum probability theory in the hyperspace analog to language (HAL) framework exploiting a Hilbert space for word and document vector specification. The quantum approach allows for accounting for specific user preferences in different contexts. To verify the algorithm proposed, we use a dataset of synthetic advertising text documents from travel agencies generated by the OpenAI GPT-4 model. We show that the "entanglement" in two-word document search and retrieval can be recognized as the frequent occurrence of two words in incompatible query contexts. We have found that the user preferences and word ordering in the query play a significant role in relatively small sizes of the HAL window. The comparison with the cosine similarity metrics demonstrates the key advantages of our approach based on the user-enforced contextual and semantic relationships between words and not just their superficial occurrence in texts. Our approach to retrieving and ranking documents allows for the creation of new information search engines that require no resource-intensive deep machine learning algorithms.

Entropy•Oct 13, 2024•7 citations

Getting Beyond the State of the Art of Information Retrieval with Quantum Theory

Massimo Melucci

According to the probability ranking principle, the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key point of this principle is the separation of the document set into two subsets with a given level of fallout and with the highest recall. If subsets of set measures are replaced by subspaces and space measures, we obtain an alternative theory stemming from Quantum Theory. That theory is named after vector probability because vectors represent event like sets do in classical probability. The paper shows that the separation into vector subspaces is more effective than the separation into subsets with the same available evidence. The result is proved mathematically and verified experimentally. In general, the paper suggests that quantum theory is not only a source of rhetoric inspiration, but is a sufficient condition to improve retrieval effectiveness in a principled way.

arXiv:1108.5575•Aug 29, 2011•0 citations
An operationalistic scheme, called Melucci metaphor, is suggested representing Information Retrieval as physical measurements with beam of particles playing the role of the flow of retrieved documents. The possibilities of query expansion by extra term are studied from this perspective, when the particles-`docuscles' are assumed to be of classical or quantum nature. It is shown that in both cases the choice of an extra term based on Bayesian belief revision is still valid on the qualitative level for boosting the relevance of the retrieved documents.
Document ranking based on probabilistic evaluations of relevance is known to exhibit non-classical correlations, which may be explained by admitting a complex structure of the event space, namely, by assuming the events to emerge from multiple sample spaces. The structure of event space formed by overlapping sample spaces is known in quantum mechanics, they may exhibit some counter-intuitive features, called quantum contextuality. In this Note I observe that from the structural point of view quantum contextuality looks similar to personalization of information retrieval scenarios. Along these lines, Knowledge Revision is treated as operationalistic measurement and a way to quantify the rate of personalization of Information Retrieval scenarios is suggested.
Abstract The formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework is based on the notion of information need vector spaces, where events, such as document relevance, correspond to subspaces, and user information needs are represented as weighted sets of vectors. In this paper, we look at possible ways to build, using an algebra defined over weighted sets, sophisticated query representations and report on corresponding experiments on TREC. 1
n Information Retrieval (IR), whether implicitly or explicitly, queries and documents are often represented as vectors. However, it may be more beneficial to consider documents and/or queries as multidimensional objects. Our belief is this would allow building "truly" interactive IR systems, i.e., where interaction is fully incorporated in the IR framework. The probabilistic formalism of quantum physics represents events and densities as multidimensional objects. This paper presents our first step towards building an interactive IR framework upon this formalism, by stating how the first interaction of the retrieval process, when the user types a query, can be formalised.
Quantum-inspired algorithms represent an important direction in modern software information technologies that use heuristic methods and approaches of quantum science. This work presents a quantum approach for document search, retrieval, and ranking based on the Bell-like test, which is well-known in quantum physics. We propose quantum probability theory in the hyperspace analog to language (HAL) framework exploiting a Hilbert space for word and document vector specification. The quantum approach allows for accounting for specific user preferences in different contexts. To verify the algorithm proposed, we use a dataset of synthetic advertising text documents from travel agencies generated by the OpenAI GPT-4 model. We show that the "entanglement" in two-word document search and retrieval can be recognized as the frequent occurrence of two words in incompatible query contexts. We have found that the user preferences and word ordering in the query play a significant role in relatively small sizes of the HAL window. The comparison with the cosine similarity metrics demonstrates the key advantages of our approach based on the user-enforced contextual and semantic relationships between words and not just their superficial occurrence in texts. Our approach to retrieving and ranking documents allows for the creation of new information search engines that require no resource-intensive deep machine learning algorithms.
According to the probability ranking principle, the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key point of this principle is the separation of the document set into two subsets with a given level of fallout and with the highest recall. If subsets of set measures are replaced by subspaces and space measures, we obtain an alternative theory stemming from Quantum Theory. That theory is named after vector probability because vectors represent event like sets do in classical probability. The paper shows that the separation into vector subspaces is more effective than the separation into subsets with the same available evidence. The result is proved mathematically and verified experimentally. In general, the paper suggests that quantum theory is not only a source of rhetoric inspiration, but is a sufficient condition to improve retrieval effectiveness in a principled way.