论文标题
量子随机访问记忆通过量子步行
Quantum random access memory via quantum walk
论文作者
论文摘要
提供了一种新颖的量子随机访问记忆（QRAM），并提供了量子步行。我们的QRAM依靠一个铲斗旅计划来访问存储单元。作为量子步行者，将左右手性的水桶引入水桶，并考虑其在完整的二进制树上的量子运动，我们可以有效地将水桶运送到指定的存储单元，并以量子叠加状态的形式以所需的信息填充水桶。我们的程序有几个优势。首先，我们不需要将任何量子设备放置在二进制树的节点上，因此在我们的QRAM架构中，保持连贯性的成本可以大大降低。其次，我们的方案完全平行。因此，仅需要o（n）步骤才能以量子叠加状态的形式访问和检索O（2N）数据。最后，我们的过程的简单性可以允许使用更简单的结构设计QRAM。
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(2n) data in the form of quantum superposition states. Finally, the simplicity of our procedure may allow the design of qRAM with simpler structures.
