Two-level quantum walkers on directed graphs II: An application to qRAM
R. Asaka, K. Sakai, R. Yahagi · 2023 · Phys. Rev. A
| 编号 QR026 | 主题 架构设计 | 链接 arXiv:2204.08709 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
This is the second paper in a series of two. Using a multi-particle continuous-time quantum walk with two internal states, which has been formulated in the first paper (arXiv:2112.08119), we physically implement a quantum random access memory (qRAM). Data with address information are dual-rail encoded into quantum walkers. The walker pass through perfect binary trees to access the designated memory cells and copy the data stored in the cells. A roundabout gate allocated at each node serves as a router to move the walker from the parent node to one of two child nodes, depending on the internal state of the walker. In this process, the address information is sequentially encoded into the internal states so that the walkers are adequately delivered to the target cells. The present qRAM, which processes 2n m-qubit data, is implemented in a quantum circuit of depth and requires O(n + m) qubit resources. This is more eficient than the conventional bucket-brigade qRAM that requires ) steps and O(2n + m) qubit resources for processing. Moreover, since the walkers are not entangled with any device on the binary trees, the cost of maintaining coherence can be reduced. Notably, by simply passing quantum walkers through binary trees, data can be automatically extracted in a quantum superposition state. In other words, any time-dependent control is not required.
本站词条在引用该文献时，会以 wikilink（sources/QR026）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。