Scalable Passive QRAM
quant-ph
Submitted: 2026-10-02
Updated: 2026-10-02
License: http://creativecommons.org/licenses/by/4.0/
The gist: We present a blueprint for implementing the physical QRAM operation in a scalable, passive manner, proving its feasibility in principle.
Abstract
We present a blueprint for implementing the physical QRAM operation in a scalable, passive manner, proving its feasibility in principle. Our construction is passive because for an n-qubit address over N = 2 n memory bits the energy cost per QRAM query is O(N), and to our knowledge it is the first construction to use polylog N energy. The runtime for each query is O(squared N). It is achieved by evolving a pre-manufactured time-independent 4-local Hamiltonian with O(N) terms where every qubit participates in at most 4 terms.
Sources
- Efficient quantum algorithms for simulating sparse Hamiltonians
- The Grand Challenge of Quantum Applications
- Universal Quantum Random Access Memory: A Data-Independent Unitary with a Commuting-Projector Hamiltonian
- A distillation-teleportation protocol for fault-tolerant QRAM
- Rent's rule and extensibility in quantum computing
- Architectures for a quantum random access memory
- Adiabatic quantum algorithm for search engine ranking
- Design and Operation of Wafer-Scale Packages Containing >500 Superconducting Qubits
- Quantum algorithms for supervised and unsupervised machine learning
- A digitally controlled silicon quantum processing unit
- Implementation of a Quantum Metamaterial
- Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians
- Quantum support vector machine for big data classification
- Experimental realization of the bucket-brigade quantum random access memory
- Fundamental causal bounds of quantum random access memories
- Quantum Data Fitting
- Coding Theorem and Strong Converse for Quantum Channels
- Quantum Deep Learning
- Exponential quantum advantage in processing massive classical data
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians