We present a construction for Quantum Random Access Memory (QRAM) that achieves a single, data-independent unitary operator. Unlike routing-based approaches or circuit methods that yield data-dependent unitaries, our Universal QRAM encodes data in memory qubits that act as quantum control signals within a block-diagonal permutation structure. The key insight is that memory qubits serve as control signals, enabling coherent lookup when addresses are in superposition. For N addresses with K-bit data words, the construction requires $\log_2 N + K + NK$ qubits and decomposes into exactly $NK$ multi-controlled gates. We verify the construction for $N \in \{2, 4, 8, 16\}$ and $K \in \{1, 2, 3, 4\}$, confirming that the resulting unitary is a pure permutation matrix with zero error across all data configurations. This approach simplifies QRAM implementation by separating fixed circuit structure from variable data encoding.
Comments
11 pages, 9 figures, 4 tables. Includes supplementary Python code: Qiskit implementation for IBM Quantum hardware and NumPy verification of the mathematical construction. Preprint also available at https://zenodo.org/records/17930212
We present a construction for Quantum Random Access Memory (QRAM) that achieves a single, data-independent unitary operator. Unlike routing-based approaches or circuit methods that yield data-dependent unitaries, our Universal QRAM encodes data in memory qubits that act as quantum control signals within a block-diagonal permutation structure. The key insight is that memory qubits serve as control signals, enabling coherent lookup when addresses are in superposition. For N addresses with K-bit data words, the construction requires log2N+K+NK qubits and decomposes into exactly NK multi-controlled gates. We verify the construction for N∈{2,4,8,16} and K∈{1,2,3,4}, confirming that the resulting unitary is a pure permutation matrix with zero error across all data configurations. This approach simplifies QRAM implementation by separating fixed circuit structure from variable data encoding.
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 ⊗ D ⊗ 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 U_QRAM = exp(-iH_tot) where H_tot 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.
Universal QRAM (U-QRAM) is a fixed, data-independent unitary interface that implements coherent random-access reads relative to a designated computational "truth-table" basis on the memory register. This work studies restricted-access inference: the memory register is persistent but inaccessible, while an experimenter may prepare and measure only accessible registers and may invoke the fixed read interaction.
Allowing the memory to be in an arbitrary quantum state (pure or mixed, possibly entangled with an inaccessible reference system, or a coherent superposition of truth tables), we establish a sharp, protocol-independent limitation of read-only access. For any finite-query protocol -- including arbitrary accessible ancillas, intermediate measurements, adaptivity, and general CPTP processing between queries -- the induced output state on the accessible registers depends on the memory state only through its diagonal in the truth-table basis. Equivalently, read-only access factors through dephasing (pinching) in that basis; coherences between distinct truth tables are operationally invisible.
Consequently, every memory-hypothesis testing task reduces to a standard state-discrimination problem on the accessible registers, and the minimum-error optimal measurement is characterized by Helstrom theory. We illustrate the framework with three explicit examples: (i) the phase-kickback reduction recovering the one-query Bernstein-Vazirani/Deutsch-Jozsa geometry, (ii) a minimal Helstrom instance with optimal success probability 3/4, and (iii) perfect indistinguishability of relative phases in entangled truth-table superpositions.
Quantum random access memory (qRAM) remains a persistent bottleneck---not because the lookup specification is unclear, but because implementing a single coherent query can demand deep active control, long-range routing, or unrealistic unit-cost oracle assumptions. We address this tension through a universal, data-independent lookup unitary (U-QRAM) in which the database resides in memory qubits and functions as quantum control. Our first contribution is a hardware-explicit reformulation: U-QRAM equals time evolution under a single time-independent Hamiltonian that is a sum of mutually commuting projector terms---one per memory cell. Because these terms commute, the order of application is irrelevant: they may be executed sequentially or in parallel without changing the target unitary. Our second contribution identifies the most direct path to constant-locality interactions: when addresses are encoded in a unary (one-hot, mode-addressed) register, each Hamiltonian term reduces to 3-local form, replacing the usual (log N)-controlled fan-in barrier with spatial or modal selectivity. We maintain conservative claims: constant latency requires explicit hardware assumptions (global buses, all-to-all connectivity, or native multi-body interactions), and we provide compiled circuit baselines for when such assumptions do not hold.
Quantum query is a basic subroutine in many quantum algorithms, and Quantum Random Access Memory (QRAM) provides a natural way to realize such coherent query access. In delegated settings, however, a standard QRAM query interface can expose sensitive information to the server. This paper introduces oblivious QRAM, a cryptographic abstraction for privacy-preserving delegated coherent query access. The protocol consists of an offline refresh phase and an online protected query phase. The database is stored in an encrypted and shuffled layout, and each query is protected by coherent address masking using either a quantum-secure pseudorandom permutation (qPRP) based method or a quantum one-time pad (qOTP) based method. In the adopted client model, the online protection adds only modest quantum overhead beyond the query register, avoiding the exponential quantum resources that would otherwise be required by an equivalent local QRAM construction. The qPRP-based variant also supports multi-query use by distributing database refresh across multiple queries to reduce classical communication. To address malicious servers, decoy checks are further incorporated to strengthen privacy protection and enable probabilistic tampering detection. Compared with fully blind quantum computing, this framework provides a lighter abstraction tailored to private delegated QRAM access, significantly reducing quantum resource requirements on both the client and server sides and achieving an exponential reduction in quantum communication.
Quantum random-access memory (QRAM) is a mechanism to access data (quantum or classical) based on addresses which are themselves a quantum state. QRAM has a long and controversial history, and here we survey and expand arguments and constructions for and against. We use two primary categories of QRAM from the literature: (1) active, which requires external intervention and control for each QRAM query (e.g. the error-corrected circuit model), and (2) passive, which requires no external input or energy once the query is initiated. In the active model, there is a powerful opportunity cost argument: in many applications, one could repurpose the control hardware for the qubits in the QRAM (or the qubits themselves) to run an extremely parallel classical algorithm to achieve the same results just as fast. We apply these arguments in detail to quantum linear algebra and prove that most asymptotic quantum advantage disappears with active QRAM systems, with some nuance related to the architectural assumptions. Escaping the constraints of active QRAM requires ballistic computation with passive memory, which creates an array of dubious physical assumptions, which we examine in detail. Considering these details, in everything we could find, all non-circuit QRAM proposals fall short in one aspect or another. In summary, we conclude that cheap, asymptotically scalable passive QRAM is unlikely with existing proposals, due to fundamental obstacles that we highlight. These obstacles are deeply rooted in the requirements of QRAM, but are not provably inevitable; we hope that our results will help guide research into QRAM technologies that circumvent or mitigate these obstacles. Finally, circuit-based QRAM still helps in many applications, and so we additionally provide a survey of state-of-the-art techniques as a resource for algorithm designers using QRAM.
Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size and a fully error-correction implementation, it is essential to consider a practical case where the QRAM has a limited size. In this work, we focus on the access of larger data sizes without keeping on increasing the size of the QRAM. Firstly, we address the challenge of word length, as real-world datasets typically have larger word lengths than the single-bit data that most previous studies have focused on. We propose a novel protocol for loading data with larger word lengths k without increasing the number of QRAM levels n. By exploiting the parallelism in the data query process, our protocol achieves a time complexity of O(n+k) and improves error scaling performance compared to existing approaches. Secondly, we provide a data-loading method for general-sized data access tasks when the number of data items exceeds 2n, which outperforms the existing hybrid QRAM+QROM architecture. Our method contributes to the development of time and error-optimized data access protocols for QRAM devices, reducing the qubit count and error requirements for QRAM implementation, and making it easier to construct practical QRAM devices with a limited number of physical qubits.