Results 31 to 40 of about 18,306 (156)
Quantum Period Finding is Compression Robust
, 2021 We study quantum period finding algorithms such as Simon and Shor (and its variants Eker{\aa}-H{\aa}stad and Mosca-Ekert). For a periodic function $f$ these algorithms produce -- via some quantum embedding of $f$ -- a quantum superposition $\sum_x |x ...
May, Alexander, Schlieper, Lars
core
One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers [PDF]
, 2019 Sketches are probabilistic data structures that can provide approximate results within mathematically proven error bounds while using orders of magnitude less memory than traditional approaches.
G Cormode +9 more
core +2 more sources
Entanglement purification of unknown quantum states [PDF]
, 2000 A concern has been expressed that ``the Jaynes principle can produce fake entanglement'' [R. Horodecki et al., Phys. Rev. A {\bf 59}, 1799 (1999)]. In this paper we discuss the general problem of distilling maximally entangled states from $N$ copies of a
A. K. Rajagopal +29 more
core +2 more sources
Hashing to detect identical ordering of species in a shared sublattice
Science and Technology of Advanced Materials: MethodsFinding very low energy configurations of species on a shared sublattice is unavoidable in some problems governed by ground states of the sublattice, such as voltage curve estimation of battery cathode materials. Calculations of partial occupancy systems,
Yoyo Hinuma
doaj +1 more source
Subword Semantic Hashing for Intent Classification on Small Datasets
, 2019 In this paper, we introduce the use of Semantic Hashing as embedding for the task of Intent Classification and achieve state-of-the-art performance on three frequently used benchmarks.
Alonso, Pedro +8 more
core +1 more source
Attacks on quantum key distribution protocols that employ non-ITS authentication
, 2015 We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously.
A Abidin +25 more
core +1 more source
The Message Authentication Code Based on Universal Hashing
Безопасность информационных технологий, 2012 The article covers the research of message authentication codes based on universal hashing. The new message authentication code algorithm is described here. The analysis of the algorithm is also provided in this article.
T. A. Bilyk, A. U. Nesterenko
doaj
On Symmetric and Asymmetric LSHs for Inner Product Search [PDF]
, 2015 We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context.
Neyshabur, Behnam, Srebro, Nathan
core
Smart Chaining: Templing and Temple Search
IEEE AccessHash tables continue to be at the forefront of applications that require fast data lookup, but their usefulness in practice depends on effective collision resolution. Classical approaches like chaining (linked lists) and open addressing (linear/quadratic/
Rajeev Ranjan Kumar Tripathi +4 more
doaj +1 more source
Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
, 2018 The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions ...
A Andoni +12 more
core +1 more source