A Robust Quantum Random Access Memory

TL;DR

This paper proposes a new quantum random access memory scheme that reduces the average number of manipulations per memory call, potentially decreasing error rates and operation time in quantum memory systems.

Contribution

It introduces a scheme requiring fewer manipulations per memory call compared to traditional architectures, enhancing efficiency and robustness of quantum RAM.

Findings

Reduces average manipulations from n(n+5)/2 to n/2 per memory call.

Potentially lowers overall error rates in quantum memory operations.

Discusses a physical implementation for storing and reading arbitrary states.

Abstract

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, in which only average $n/2$ times manipulation is required to accomplish a memory call. This scheme may significantly decrease the time spent on a memory call and the average overall error rate per memory call. A physical implementation scheme for storing an arbitrary state in a selected memory cell followed by reading it out is discussed.