Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM
Ryo Asaka, Kazumitsu Sakai, Ryoko Yahagi

TL;DR
This paper proposes a quantum walk-based implementation of qRAM that is more efficient and maintains coherence better than traditional methods, enabling automatic superposition data extraction without time-dependent control.
Contribution
It introduces a novel multi-particle quantum walk approach for qRAM with improved efficiency and coherence preservation compared to existing bucket-brigade models.
Findings
Quantum walk-based qRAM processes $2^n$ $m$-qubit data efficiently.
Circuit depth is $O(n ext{log}(n+m))$, with $O(n+m)$ qubits required.
Data can be extracted in superposition without control operations.
Abstract
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 walkers 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 -qubit data, is implemented in a quantum circuit of depth and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
