Fault-Tolerant Resource Estimation of Quantum Random-Access Memories
Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca
Abstract
Quantum random-access lookup 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 article, 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.
Topics & Concepts
Construct (python library)Computer scienceQuantumLimitingResource (disambiguation)Function (biology)Theoretical computer scienceQuantum computerSet (abstract data type)Scheme (mathematics)Quantum algorithmQuantum informationQuantum gateString (physics)Quantum circuitSoftwareAlgorithmQuantum error correctionElectronic circuitEncoding (memory)MathematicsBoolean functionClass (philosophy)Quantum Computing Algorithms and ArchitectureRadiation Effects in ElectronicsQuantum Information and Cryptography