Fault tolerant resource estimation of quantum random-access memories [article]

Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca
2019 arXiv   pre-print
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 generic families of circuits which function as a qRAM, and analyze their resource costs when embedded in a surface code.
arXiv:1902.01329v1 fatcat:66nw4nsu5nh5ngh5k6oqgh2rly