2025/10/08 by Andreas Wichert, Wichert, Andreas
Computer Science · Materials Science · #1P68 81P68 81P68 #Chemical and Physical Properties of Materials #F.2.2 #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2510.07354
openalex publication_date 2025/10/08 · openalex created_date 2025/10/11 · openalex updated_date 2026/07/28
We present a novel quantum storage algorithm for k binary vectors of dimension m into a superposition of a m qubit quantum state based on a permutation technique. We compare this algorithm to the storage algorithm proposed by Ventura and Martinez. The permutation technique is simpler and can lead to an additional reduction through the reduce algorithm. To retrieve a binary vector from the superposition of k vectors represented by a m qubit quantum state, we must use a modified version of Grover algorithm, as Grover algorithm does not function correctly for non uniform distributions. We introduce the permutation trick that enables an exhaustive search by Grover algorithm in square root of k steps for k patterns, independent of n equal two power m. We compare this trick to the Ventura and Martinez trick, which requires square root of n steps for k patterns.