High-dimensional Similarity Search With Quantum-assisted Variational Autoencoder

Abstract

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the Quantum-assisted Variational Autoencoder has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclid

Stats

• citations14
• S2 citations—
• github stars0
• HF likes0
• heat score8.82
• arxiv keygao2020high

Related papers

• Leanvec: Searching Vectors Faster By Making Them Fit (2023)0.00
• Interleaved Composite Quantization For High-dimensional Similarity Search (2019)0.00
• SAQ: Pushing The Limits Of Vector Quantization Through Code Adjustment And Dimension Segmentation (2025)0.00
• Gleanvec: Accelerating Vector Search With Minimalist Nonlinear Dimensionality Reduction (2024)0.00
• Qwlsh: Cache-conscious Indexing For Processing Similarity Search Query Workloads In High-dimensional Spaces (2019)4.52
• Accurate Deep Representation Quantization With Gradient Snapping Layer For Similarity Search (2016)0.00
• SQUASH: Serverless And Distributed Quantization-based Attributed Vector Similarity Search (2025)0.00
• Central Similarity Quantization For Efficient Image And Video Retrieval (2019)23.49