Quantum Associative Memory with Improved Distributed Queries (original) (raw)
2013, International Journal of Theoretical Physics
Related papers
Parallelizing the queries in a bucket-brigade quantum random access memory
Physical Review A, 2020
Quantum algorithms often use quantum random access memory (QRAM) for accessing information stored in a databaselike manner. QRAM has to be fast, resource efficient, and fault tolerant. The latter is often influenced by access speeds, because shorter times introduce less exposure of the stored information to noise. The total execution time of an algorithm depends on the QRAM access time which includes (i) address translation time and (ii) effective query time. The bucket-brigade QRAM was proposed to achieve faster addressing at the cost of exponentially many ancillas. We illustrate a systematic method to significantly reduce the effective query time by using mathrmClifford+T\mathrm{Clifford}+TmathrmClifford+T gate parallelism. The method does not introduce any ancilla qubits. Our parallelization method is compatible with the surface code quantum error correction. We show that parallelization is a result of advantageous Toffoli gate decomposition in terms of mathrmClifford+T\mathrm{Clifford}+TmathrmClifford+T gates, and after addresses have be...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.