Related papers: Quantum Algorithm for Jaccard Similarity
Consider collections $\mathcal{A}$ and $\mathcal{B}$ of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from $\mathcal{A}\times \mathcal{B}$ that has similarity higher than a given threshold…
Parity measurement is a central tool to many quantum information processing tasks. In this Letter, we propose a method to directly measure two- and four-qubit parity with low overhead in hard- and software, while remaining robust to…
Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in…
Quantum programs exhibit inherent non-deterministic behavior, which poses more significant challenges for error discovery compared to classical programs. While several testing methods have been proposed for quantum programs, they often…
Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of $O(N^{3/4}\log N)$ (measured in quantum memory accesses and accesses to each list). The…
ABCDE is a sophisticated technique for evaluating differences between very large clusterings. Its main metric that characterizes the magnitude of the difference between two clusterings is the JaccardDistance, which is a true distance metric…
Anomaly detection is a vital technique for exploring signatures of new physics Beyond the Standard Model (BSM) at the Large Hadron Collider (LHC). The vast number of collisions generated by the LHC demands sophisticated deep learning…
The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…
Efficient measures to determine similarity of quantum states, such as the fidelity metric, have been widely studied. In this paper, we address the problem of defining a similarity measure for quantum operations that can be…
The fundamental problem of similarity studies, in the frame of data-mining, is to examine and detect similar items in articles, papers, books, with huge sizes. In this paper, we are interested in the probabilistic, and the statistical and…
Coherence is a defining property of quantum theory that accounts for quantum advantage in many quantum information tasks. Although many coherence quantifiers have been introduced in various contexts, the lack of efficient methods to…
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the…
Quantum tomography is an important tool for obtaining information about the quantum state from experimental data. In this study, we conduct a comparative analysis of various quantum tomography protocols, including protocols based on highly…
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undirected graph given as an adjacency matrix, and show that this can be done in query complexity that is asymptotically the same, up to log…
We propose a hybrid quantum approach to threshold and binarize a grayscale image through unsharp measurements (UM) relying on image histogram. Generally, the histograms are characterized by multiple overlapping normal distributions…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. Quantum search algorithm can be described as the rotation of state vectors in…
This paper addresses the problem of estimating the containment and similarity between two sets using only random samples from each set, without relying on sketches of full sets. The study introduces a binomial model for predicting the…
Suppose one has access to oracles generating samples from two unknown probability distributions P and Q on some N-element set. How many samples does one need to test whether the two distributions are close or far from each other in the…
A joint measurement of two observables is a {\it simultaneous} measurement of both quantities upon the {\it same} quantum system. When two quantum-mechanical observables do not commute, then a joint measurement of these observables cannot…
One of the central features of quantum theory is that there are pairs of quantum observables that cannot be measured simultaneously. This incompatibility of quantum observables is a necessary ingredient in several quantum phenomena, such as…