Architectures for a quantum random access memory
Open accessAbstract
A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory sites, which may contain either quantum or classical information. RAMs and qRAMs with $n$-bit addresses can access ${2}^{n}$ memory sites. Any design for a RAM or qRAM then requires $O({2}^{n})$ two-bit logic gates. At first sight this requirement might seem to make large scale quantum versions of such devices impractical, due to the difficulty of constructing and operating coherent devices with large numbers of quantum logic gates. Here we analyze two different RAM architectures (the conventional fanout and the ``bucket brigade'') and propose some proof-of-principle implementations, which show that, in principle, only $O(n)$ two-qubit physical interactions need take place during each qRAM call. That is, although a qRAM needs $O({2}^{n})$ quantum logic gates, only $O(n)$ need to be activated during a memory call. The resulting decrease in resources could give rise to the construction of large qRAMs that could operate without the need for extensive quantum error correction.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
If the Hamiltonian and its first derivative are upper-bounded by a constant, a good approximation of the ground state can be reached for evolution time T = O(1/γ^2) where γ is the minimum gap (except for pathological cases).
“If the Hamiltonian and its first derivative are upper-bounded by a constant, a good approximation of the ground state can be reached for evolution time T = O ( 1 γ 2 ) where γ is the minimum gap (except for pathological cases 291 ).”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [291]
Although some blueprints for QRAM have been proposed, there is not, to our knowledge, yet a working device.
“Although some blueprints have been proposed [111,112], there is not, to our knowledge, yet a working device.”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [111]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,449 · see citing works
Strukov, D. B., Snider, G. S., Stewart, D. R., & Williams, R. S. (2008) · Nature · doi:10.1038/nature06932 · Cited by 11,744 · see citing works
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · see citing works
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A., Schuster, D. I., Blais, A., Frunzio, L., Huang, R. S., Majer, J., Kumar, S., Girvin, S. M., & Schoelkopf, R. J. (2004) · Nature · doi:10.1038/nature02851 · Cited by 3,796 · see citing works
(1965) · Vacuum · doi:10.1016/0042-207x(65)91016-x · Cited by 1,716 · see citing works
Horowitz, P., Hill, W., & Rollefson, R. J. (1990) · American Journal of Physics · doi:10.1119/1.16385 · Cited by 1,487 · see citing works
Measurement of Conditional Phase Shifts for Quantum Logic
Turchette, Q. A., Hood, C. J., Lange, W., Mabuchi, H., & Kimble, H. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4710 · Cited by 1,409 · see citing works
Giovannetti, V., Lloyd, S., & Maccone, L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.160501 · Cited by 935 · see citing works
Self-citationQuantum teleportation between light and matter
Sherson, J. F., Krauter, H., Olsson, R. K., Julsgaard, B., Hammerer, K., Cirac, J. I., & Polzik, E. S. (2006) · Nature · doi:10.1038/nature05136 · Cited by 910 · see citing works
Resolving photon number states in a superconducting circuit
Schuster, D., Houck, A., Schreier, J. A., Wallraff, A. J., Gambetta, J., Blais, A., Frunzio, L., Majer, J., Johnson, B., Devoret, M., et al. (2007) · Nature · doi:10.1038/nature05461 · Cited by 839 · see citing works
Quantum Walk Algorithm for Element Distinctness
Ambainis, A. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447311 · Cited by 727 · see citing works
Quantum-information processing with circuit quantum electrodynamics
Blais, A., Gambetta, J., Wallraff, A. J., Schuster, D., Girvin, S. M., Devoret, M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.75.032329 · Cited by 707 · see citing works
Measurement-induced entanglement for excitation stored in remote atomic ensembles
Chou, C. W., de Riedmatten, H., Felinto, D., Polyakov, S. V., van Enk, S. J., & Kimble, H. J. (2005) · Nature · doi:10.1038/nature04353 · Cited by 590 · see citing works
Horowitz, P., & Hill, W. (2015) · Cited by 511 · see citing works
Microelectronic circuit design
(1979) · Computer-Aided Design · doi:10.1016/0010-4485(79)90182-9 · Cited by 294 · see citing works
Giovannetti, V., Lloyd, S., & Maccone, L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.230502 · Cited by 217 · see citing works
Self-citationTunable Coupling of Superconducting Qubits
Blais, A., van den Brink, A. M., & Zagoskin, A. M. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.127901 · Cited by 181 · see citing works
Proceedings 44th IEEE Symposium on Foundations of Computer Science - FOCS 2003
(2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238173 · Cited by 147 · see citing works
Parametric coupling for superconducting qubits
Bertet, P., Harmans, C. J. P. M., & Mooij, J. E. (2006) · Physical Review B · doi:10.1103/physrevb.73.064512 · Cited by 138 · see citing works
Probabilistic Quantum Memories
Trugenberger, C. A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.067901 · Cited by 134 · see citing works
Tunable coupling scheme for flux qubits at the optimal point
Niskanen, A. O., Nakamura, Y., & Tsai, J.-S. (2006) · Physical Review B · doi:10.1103/physrevb.73.094506 · Cited by 109 · see citing works
Quantum Theory of High-resolution Length Measurement with a Fabry-Perot Interferometer
Ley, M., & Loudon, R. (1987) · Journal of Modern Optics · doi:10.1080/09500348714550251 · Cited by 99 · see citing works
Pattern recognition on a quantum computer
Schützhold, R. (2003) · Physical Review A · doi:10.1103/physreva.67.062311 · Cited by 97 · see citing works
Phase Transitions in Quantum Pattern Recognition
Trugenberger, C. A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.277903 · Cited by 51 · see citing works
Towards quantum template matching
Curtis, D., & MEYER, D. A. (2004) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.506669 · Cited by 43 · see citing works
Quantum algorithm for optical-template recognition with noise filtering
Schaller, G., & Schützhold, R. (2006) · Physical Review A · doi:10.1103/physreva.74.012303 · Cited by 21 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560 · see citing works
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385 · see citing works
Self-citationA Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646 · see citing works
Hybrid Quantum-Classical Algorithms and Quantum Error Mitigation
Endo, S., Cai, Z., Benjamin, S. C., & Yuan, X. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.032001 · Cited by 566 · see citing works
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383 · see citing works
Quantum algorithms for topological and geometric analysis of data
Lloyd, S., Garnerone, S., & Zanardi, P. (2016) · Nature Communications · doi:10.1038/ncomms10138 · Cited by 241 · see citing works
Self-citationA quantum deep convolutional neural network for image recognition
Li, Y., Zhou, R.-G., Xu, R., Luo, J., & Hu, W. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9f93 · Cited by 225 · see citing works
The prospects of quantum computing in computational molecular biology
Outeiral, C., Strahm, M., Shi, J., Morris, G. M., Benjamin, S. C., & Deane, C. M. (2021) · WIREs Computational Molecular Science · doi:10.1002/wcms.1481 · Cited by 232 · see citing works
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201 · see citing works
“Although concrete proposals to build QRAM exist 106,107 , a scalable fault-tolerant implementation is yet to be found 108–110 , making this at best a long-term prospect.”
Circuit-Based Quantum Random Access Memory for Classical Data
Park, D. K., Petruccione, F., & Rhee, J.-K. K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40439-3 · Cited by 151 · see citing works
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87 · see citing works
Experimental quantum private queries with linear optics
De Martini, F., Giovannetti, V., Lloyd, S., Maccone, L., Nagali, E., Sansoni, L., & Sciarrino, F. (2009) · Physical Review A · doi:10.1103/physreva.80.010302 · Cited by 81 · see citing works
Self-citation
- Authors
- Giovannetti, V., Lloyd, S., & Maccone, L.
- Affiliations
- Scuola Normale Superiore (IT)
- Massachusetts Institute of Technology (US)
- University of Pavia (IT)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2008-11-05
- Volume
- 78
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2094908058
- Cited by
- 306
- References
- 27
- Citations by year
- 2026: 14 · 2025: 42 · 2024: 38 · 2023: 43 · 2022: 31 · 2021: 44 · 2020: 31 · 2019: 21 · 2018: 11 · 2017: 4 · 2016: 9 · 2015: 4 · 2014: 7 · 2013: 1 · 2012: 2
- FWCI
- 2.10
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Scuola Normale Superiore di Pisa (submittedVersion)
- arXiv (Cornell University)
- Funders
- Scuola Normale Superiore
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum random access memory, two-qubit interactions, quantum gates, quantum error correction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
