Quantum sketching protocols for Hamming distance and beyond
نویسندگان
چکیده
منابع مشابه
Improved Sketching of Hamming Distance with Error Correcting
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not only we reduce the sketch size, but also restore the differences between the streams. Our contribution: For two streams with hamming distance bounded by k we show a sketch of size O(k logn) with O(logn) processing time ...
متن کاملQuantum Dot Structures Measuring Hamming Distance for Associative Memories
ABSTRACT This paper describes new quantum-dot circuits that measure a Hamming distance by using the Coulomb repulsion effect between quantum dots. Measuring similarity between patterns expressed by a Hamming distance is a basic function for various information processing. Quantum dot structures realizing these circuits are also proposed, which will be constructed by using the well-controlled na...
متن کاملHamming distance for conjugates
Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of...
متن کاملA Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance
The Gap-Hamming distance problem is the promise problem of deciding if the Hamming distance h between two strings of length n is greater than a or less than b, where the gap g = |a − b| ≥ 1 and a and b could depend on n. In this short note, we give a lower bound of Ω( √ n/g) on the quantum query complexity of computing the GapHamming distance between two given strings of lenght n. The proof is ...
متن کاملTowards Quantum Distance Bounding Protocols
Distance Bounding (DB) is a security technique through which it is possible to determine an upper-bound on the physical distance between two parties (denoted as verifier and prover). These protocols typically combine physical properties of the communication channel with cryptographic challenge-response schemes. A key challenge to design secure DB protocols is to keep the time required by the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2019
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.99.062331