A novel concept of quantum random access memory (qRAM) employing a quantum walk is provided. Our qRAM relies on a bucket brigade scheme to access the memory cells. Introducing a bucket with chirality left and right as a quantum walker, and considering its quantum motion on a full binary tree, we can efficiently deliver the bucket to the designated memory cells, and fill the bucket with the desired information in the form of quantum superposition states. Our procedure has several advantages. First, we do not need to place any quantum devices at the nodes of the binary tree, and hence in our qRAM architecture, the cost to maintain the coherence can be significantly reduced. Second, our scheme is fully parallelized. Consequently, only O(n) steps are required to access and retrieve O(2 ⁿ ) data in the form of quantum superposition states. Finally, the simplicity of our procedure may allow the design of qRAM with simpler structures.

提供了采用量子游走的量子随机存取存储器 (qRAM) 的新概念。我们的 qRAM 依靠桶旅方案来访问存储单元。引进具有手性水桶左和右的量子学步车，并考虑在满二叉树的量子运动，就可以有效地在量子叠加的形式所需的信息传递水桶到指定的存储单元，并装满铲斗状态。我们的程序有几个优点。首先，我们不需要在二叉树的节点上放置任何量子设备，因此在我们的 qRAM 架构中，保持一致性的成本可以显着降低。其次，我们的方案是完全并行化的。因此，只有O ( n) 步骤需要以量子叠加态的形式访问和检索O (2 ⁿ ) 数据。最后，我们程序的简单性可能允许设计具有更简单结构的 qRAM。