Copertina

Quantum Sketches, Hashing, and Approximate Nearest Neighbors

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Hashemian, Sajjad
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Quantum Physics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
di: Danait, Ved, et al.
Pubblicazione: (2025)

Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
di: Khadiev, Kamil, et al.
Pubblicazione: (2026)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
di: Andoni, Alexandr, et al.
Pubblicazione: (2026)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
di: Li, Binhong, et al.
Pubblicazione: (2025)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
di: McCauley, Samuel
Pubblicazione: (2024)

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
di: Habib, Ruhan, et al.
Pubblicazione: (2025)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
di: Dehghankar, Mohsen, et al.
Pubblicazione: (2025)

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
di: Kociumaka, Tomasz, et al.
Pubblicazione: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
di: Liang, Anqi, et al.
Pubblicazione: (2024)

A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
di: Chen, Yanlin, et al.
Pubblicazione: (2024)

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
di: Parekh, Ojas, et al.
Pubblicazione: (2022)

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
di: Xie, Ningyi, et al.
Pubblicazione: (2023)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
di: Ma, Xinran, et al.
Pubblicazione: (2025)

SVD Provably Denoises Nearest Neighbor Data
di: Kannan, Ravindran, et al.
Pubblicazione: (2026)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
di: Bruch, Sebastian, et al.
Pubblicazione: (2025)

Approximate Nearest Neighbor Search with Window Filters
di: Engels, Joshua, et al.
Pubblicazione: (2024)

On the Communication Complexity of Approximate Pattern Matching
di: Kociumaka, Tomasz, et al.
Pubblicazione: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

Product-State Approximation Algorithms for the Transverse Field Ising Model
di: Lipardi, Vincenzo, et al.
Pubblicazione: (2026)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
di: Yin, Ziqi, et al.
Pubblicazione: (2026)

Sublinear Time Quantum Algorithm for Attention Approximation
di: Song, Zhao, et al.
Pubblicazione: (2026)

A Quantum Approximation Scheme for k-Means
di: Jaiswal, Ragesh
Pubblicazione: (2023)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
di: Chee, Yeow Meng, et al.
Pubblicazione: (2023)

Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families
di: Tate, Reuben, et al.
Pubblicazione: (2025)

Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
di: Jeffery, Stacey, et al.
Pubblicazione: (2024)

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
di: Parekh, Ojas
Pubblicazione: (2025)

Quantum Honest Byzantine Agreement as a Distributed Quantum Algorithm
di: Edwards, Marcus
Pubblicazione: (2023)

Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs
di: Khadiev, Kamil, et al.
Pubblicazione: (2025)

Quantum divide and conquer
di: Childs, Andrew M., et al.
Pubblicazione: (2022)

Quantum Subroutine Composition
di: Jeffery, Stacey
Pubblicazione: (2022)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
di: Li, Tongyang, et al.
Pubblicazione: (2024)

On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-Cut
di: Huang, Jeremy Ahrens, et al.
Pubblicazione: (2024)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
di: Bessa, Aline, et al.
Pubblicazione: (2023)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
di: Chatziafratis, Vaggos, et al.
Pubblicazione: (2023)

Loop Composition in Quantum Algorithms
di: Jeffery, Stacey, et al.
Pubblicazione: (2026)

Quantum-walk search in motion
di: Sahu, Himanshu, et al.
Pubblicazione: (2023)

Quantum Search on Bipartite Multigraphs
di: Bezerra, Gustavo Alves, et al.
Pubblicazione: (2025)

Quantum Speedup for Hypergraph Sparsification
di: Liu, Chenghua, et al.
Pubblicazione: (2025)

Error Interference in Quantum Simulation
di: Chen, Boyang, et al.
Pubblicazione: (2024)