PhD Seminar: Olivia Di Matteo
Quantum random-access memories (qRAM) are required by numerous quantum algorithms. In many cases, qRAM queries are the limiting factor in the implementation of these algorithms. In the limit of a large number of queries, there will be a massive resource overhead, as in this regime it is not possible to bypass the need for active error correction. In this talk, I will present our work towards quantifying this overhead. We will explore a variety of different qRAM circuits designed to query classical bits in superposition. We analyze space-time tradeoffs, and also compute explicit resources required to embed a large qRAM query in a surface code. This talk is based on joint work with Vlad Gheorghiu and Michele Mosca.