Quantum random access memory via quantum walk

@article{Asaka2021QuantumRA,
  title={Quantum random access memory via quantum walk},
  author={Ryo Asaka and Kazumitsu Sakai and Ryoko Yahagi},
  journal={Quantum Science \& Technology},
  year={2021},
  volume={6}
}
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… 
Two-level Quantum Walkers on Directed Graphs I: Universal Quantum Computing
We propose a universal quantum computation via a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states. A dual-rail encoding is adopted to convert the information: a
Response to glassy disorder in coin on spread of quantum walker
We analyze the response to incorporation of glassy disorder in the coin operation of a discrete-time quantum walk in one dimension. We find that the ballistic spread of the disorder-free quantum

References

SHOWING 1-10 OF 30 REFERENCES
Architectures for a quantum random access memory
A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory
Circuit-Based Quantum Random Access Memory for Classical Data
TLDR
This work presents a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way and presents a procedure to convert classical training data for a quantum supervised learning algorithm to a quantum state.
Quantum random access memory.
TLDR
An architecture that exponentially reduces the requirements for a memory call: O(logN) switches need be thrown instead of the N used in conventional RAM designs, which yields a more robust QRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing.
Optimal usage of quantum random access memory in quantum machine learning
By considering an unreliable oracle in a query-based model of quantum learning, we present a tradeoff relation between the oracle's reliability and the reusability of the quantum state of the input
Universal Computation by Multiparticle Quantum Walk
TLDR
The construction of a scalable quantum computer architecture based on multiple interacting quantum walkers could, in principle, be used as an architecture for building a scaled quantum computer with no need for time-dependent control.
On the Robustness of Bucket Brigade Quantum RAM
TLDR
It is argued that quantum error correction for the circuit causes the quantum bucket brigade architecture to lose its primary advantage of a small number of "active" gates, since all components have to be actively error corrected.
Universal computation by multi-particle quantum walk arXiv
Quantum walk is a versatile and intuitive framework for developing quantum algorithms. Applications of quantum walk include an example of exponential speedup over classical computation [6] and
Robust quantum random access memory
A "bucket brigade" architecture for a quantum random memory of $N=2^n$ memory cells needs $n(n+5)/2$ times of quantum manipulation on control circuit nodes per memory call. Here we propose a scheme,
Fault-Tolerant Resource Estimation of Quantum Random-Access Memories
TLDR
The cost of fault-tolerantly implementing a quantum random-access memory (qRAM) is studied, and opportunities for qubit-time tradeoffs are discussed and their resource costs when embedded in a surface code are estimated.
Universal quantum computation using the discrete-time quantum walk
A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501
...
1
2
3
...