Quanta: New Free Tool Makes AI Search Cheaper and Smarter

Ioannis E. Livieris presents Quanta, an open-source Python library that unifies dense vector search over 4-bit quantised embeddings, BM25 full-text retrieval, and knowledge-graph traversal behind a single retrieval API. An advanced retrieval-augmented generation pipeline is typically assembled from three or four independently operated systems — an approximate nearest-neighbour index, a full-text search engine, a graph database, and a relational document store — each contributing its own deployment surface, configuration model, and failure modes, with integration logic written anew in every project. Quanta makes two design commitments that distinguish it from existing hybrid retrieval stacks. First, signals are combined by weighted reciprocal rank fusion rather than by normalising heterogeneous scores onto a shared range, which the author argues is ill-posed because such normalisations are query-dependent. Second, the graph is a candidate expander and not a relevance scorer: traversal widens the candidate pool, and the newly admitted documents are re-scored by the dense indexes under an identifier allowlist, so structural adjacency determines what is considered while content evidence determines how it ranks.