Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Institute of Physics eBooks

Quantum random access memory

Hafiz Md. Hasan Babu

Published May 1, 2020• 13 citations
Publisher
DOI
10.1088/978-0-7503-2747-3ch14

Related papers

Quantum random access memory put to the test

Connor T. Hann

Nature Physics•May 1, 2026•0 citations

A bucket-brigade quantum random access memory

Fanhao Shen, Yujie Ji, Debin Xiang +20 more

Nature Physics•Mar 16, 2026•3 citations

Resource-efficient quantum-walker quantum random access memory

Giuseppe De Riso, Giuseppe Catalano, Seth Lloyd +2 more

Physical Review Research•Oct 2, 2026•0 citations

Quantum random access memory utilizing discrete-time and continuous-time quantum walks

Ryo Asaka

•Mar 18, 2024•0 citations

Quantum Algorithm for Finding Minimum Values in a Quantum Random Access Memory

Anton S. Albino, Lucas Queiroz Galvão, Mauro Q. Nooblath Neto +2 more

Brazilian Journal of Physics•Oct 15, 2025•2 citations

Quantum Random Access Memory

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone

A random access memory (RAM) uses n bits to randomly address N=2(n) distinct memory cells. A quantum random access memory (QRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(logN) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust QRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical implementation is presented.

arXiv:0708.1879•Physical Review Letters•Apr 21, 2008•936 citations
A random access memory (RAM) uses n bits to randomly address N=2(n) distinct memory cells. A quantum random access memory (QRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(logN) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust QRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical implementation is presented.