Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
arXiv:2502.06767 · doi:10.1145/3676641.3716256
Abstract
Quantum Random Access Memory (QRAM) is a crucial architectural component for querying classical or quantum data in superposition, enabling algorithms with wide-ranging applications in quantum arithmetic, quantum chemistry, machine learning, and quantum cryptography. In this work, we introduce Fat-Tree QRAM, a novel query architecture capable of pipelining multiple quantum queries simultaneously while maintaining desirable scalings in query speed and fidelity. Specifically, Fat-Tree QRAM performs independent queries in time using qubits, offering immense parallelism benefits over traditional QRAM architectures. To demonstrate its experimental feasibility, we propose modular and on-chip implementations of Fat-Tree QRAM based on superconducting circuits and analyze their performance and fidelity under realistic parameters. Furthermore, a query scheduling protocol is presented to maximize hardware utilization and access the underlying data at an optimal rate. These results suggest that Fat-Tree QRAM is an attractive architecture in a shared memory system for practical quantum computing.
17 pages, Accepted by ACM ASPLOS 2025. (V2)Fixing a formatting issue and adding new references
References in corpus (25)
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Grover's quantum searching algorithm is optimal
- Architectures for a quantum random access memory
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- 3D integrated superconducting qubits
- Quantum Computer Systems for Scientific Discovery
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Entanglement of trapped-ion qubits separated by 230 meters
- Distributed quantum phase estimation with entangled photons
- Unfolding the color code
- Solid-state qubits integrated with superconducting through-silicon vias
- Low-loss interconnects for modular superconducting quantum processors
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Universal fault-tolerant gates on concatenated stabilizer codes
- Arithmetic on a Distributed-Memory Quantum Multicomputer
- Resilience of quantum random access memory to generic noise
- Parallelising the Queries in Bucket Brigade Quantum RAM
- Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks
- Convex optimization using quantum oracles
- Data centers with quantum random access memory and quantum networks
- Systems Architecture for Quantum Random Access Memory
- Quantum Data Center: Perspectives
- Parallel Quantum Algorithm for Hamiltonian Simulation
- Parameter-Parallel Distributed Variational Quantum Algorithm