Advances in Information Retrieval

Volume 5993 of the series Lecture Notes in Computer Science pp 357-369

Using the Quantum Probability Ranking Principle to Rank Interdependent Documents

  • Guido ZucconAffiliated withDepartment of Computing Science, University of Glasgow
  • , Leif AzzopardiAffiliated withDepartment of Computing Science, University of Glasgow

* Final gross prices may vary according to local VAT.

Get Access


A known limitation of the Probability Ranking Principle (PRP) is that it does not cater for dependence between documents. Recently, the Quantum Probability Ranking Principle (QPRP) has been proposed, which implicitly captures dependencies between documents through “quantum interference”. This paper explores whether this new ranking principle leads to improved performance for subtopic retrieval, where novelty and diversity is required. In a thorough empirical investigation, models based on the PRP, as well as other recently proposed ranking strategies for subtopic retrieval (i.e. Maximal Marginal Relevance (MMR) and Portfolio Theory(PT)), are compared against the QPRP. On the given task, it is shown that the QPRP outperforms these other ranking strategies. And unlike MMR and PT, one of the main advantages of the QPRP is that no parameter estimation/tuning is required; making the QPRP both simple and effective. This research demonstrates that the application of quantum theory to problems within information retrieval can lead to significant improvements.