Abstract 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’s algorithm, as Grover’s algorithm does not function correctly for non-uniform distributions. We introduce the permutation trick that enables an exhaustive search by Grover’s algorithm in O(k) steps for k patterns, independent of n=2m. We compare this trick to the Ventura and Martinez trick, which requires O(n) steps for k patterns