A resource-efficient quantum-walker Quantum RAM

TL;DR

This paper presents a new, resource-efficient quantum RAM architecture that simplifies implementation and maintains optimal query complexity by using local operations and a modular design.

Contribution

It introduces a novel quantum RAM architecture that reduces resource demands and simplifies experimental implementation while preserving optimal quantum query complexity.

Findings

Reduces resource requirements compared to previous qRAM proposals.

Uses local unitary operations and short-range interactions for simplicity.

Maintains optimal complexity scaling for quantum queries.

Abstract

Efficient and coherent data retrieval and storage are essential for harnessing quantum algorithms' speedup. Such a fundamental task is addressed by a quantum Random Access Memory (qRAM). Despite their promising scaling properties, current qRAM proposals demand excessive resources and rely on operations beyond the capabilities of current hardware requirements, rendering their practical realization inefficient. We introduce a novel architecture that significantly reduces resource requirements while preserving optimal complexity scaling for quantum queries. Moreover, unlike previous proposals, our algorithm design leverages a simple, repeated operational block based exclusively on local unitary operations and short-range interactions between a limited number of quantum walkers traveling over a single binary tree. This novel approach not only simplifies experimental requirements by reducing the complexity of necessary operations but also enhances the architecture's scalability by ensuring a resource-efficient, modular design that maintains optimal quantum query performance.