Quick Navigation
Topics
Quantum Error Correction Fault Tolerance
Quantum Machine Learning
Quantum Simulation
Universal Quantum Random Access Memory: A Data-Independent Unitary with a Commuting-Projector Hamiltonian
arXiv
Authors: Leonardo Bohac
Year
2025
Paper ID
36552
Status
Preprint
Abstract Read
~2 min
Abstract Words
175
Citations
N/A
Abstract
Quantum random access memory (QRAM) is a central primitive for coherent data access in quantum algorithms, yet it remains controversial in practice because the wall-clock cost of "one lookup" can hide routing depth, control overhead, and geometric constraints. We present a universal QRAM construction (U-QRAM) in which the database is a physical memory register that participates in the lookup unitary as quantum control. This yields a single fixed, data-independent lookup unitary on A otimes D otimes M that is correct for all basis-encoded databases. Our first contribution is an explicit, exact Hamiltonian realization: U-QRAM equals a single time-independent evolution UQRAM = exp\(-iHtot\) where Htot is a sum of mutually commuting projector terms, one per memory cell, and the construction avoids control-dependent phase ambiguities. Our second contribution is an architectural sharpening: under unary (one-hot, mode-addressed) encoding of the address, each cell term becomes uniform and 3-local, delineating the most direct path toward constant-latency interpretations. We keep claims conservative by separating latency from work and stating explicit hardware assumptions required for constant wall-clock queries.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- Quantum random access memory (QRAM) is a central primitive for coherent data access in quantum algorithms, yet it remains controversial in practice because the wall-clock cost...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.