A resource-efficient quantum-walker quantum RAM

G. De Riso, G. Catalano, S. Lloyd, V. Giovannetti, D. De Santis · 2025 · arXiv

| 编号 QR058 | 主题 架构设计 | 链接 arXiv:2508.02855 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Eficient 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 ineficient. We introduce a novel architecture that significantly reduces re source 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-eficient, modular design that maintains optimal quantum query performance.

本站词条在引用该文献时，会以 wikilink（sources/QR058）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。