Quantum Algorithm for Jaccard Similarity
<|reference_start|>Quantum Algorithm for Jaccard Similarity: Jaccard Similarity is a very common proximity measurement used to compute the similarity between two asymmetric binary vectors. Jaccard Similarity is the ratio between the 1s (Intersection of two vectors) to 1s (Union of two vectors). This paper introduces a quantum algorithm for finding the Jaccard Similarity 1s, in the Intersection and Union of two binary vectors. There are two sub-algorithms one for each. Measuring the register for respective algorithm gives count of number of 1 s in binary format. Implementation on IBM composer is also included.<|reference_end|>
@article{puram2024quantum,
    title={Quantum Algorithm for Jaccard Similarity},
    author={Varun Puram, Ruthvik Rao Bobbili and Johnson P Thomas},
    journal={arXiv preprint arXiv:2408.08940},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.08940},
    primaryClass={cs.DS}
}