Fault tolerant resource estimation of quantum random-access memories
Quantum Physics
2020-01-24 v2
Abstract
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation of the algorithm. In this paper we study the cost of fault-tolerantly implementing a qRAM. We construct and analyze generic families of circuits that function as a qRAM, discuss opportunities for qubit-time tradeoffs, and estimate their resource costs when embedded in a surface code.
Cite
@article{arxiv.1902.01329,
title = {Fault tolerant resource estimation of quantum random-access memories},
author = {Olivia Di Matteo and Vlad Gheorghiu and Michele Mosca},
journal= {arXiv preprint arXiv:1902.01329},
year = {2020}
}
Comments
14 pages, 14 figures. Code repository available in references. To appear in IEEE Transactions on Quantum Engineering