Systems Architecture for Quantum Random Access Memory

Abstract

Operating on the principles of quantum mechanics, quantum algorithms hold the promise for solving problems that are beyond the reach of the best-available classical algorithms. An integral part of realizing such speedup is the implementation of quantum queries, which read data into forms that quantum computers can process. Quantum random access memory (QRAM) is a promising architecture for realizing quantum queries. However, implementing QRAM in practice poses significant challenges, including query latency, memory capacity and fault-tolerance. In this paper, we propose the first end-to-end system architecture for QRAM. First, we introduce a novel QRAM that hybridizes two existing implementations and achieves asymptotically superior scaling in space (qubit number) and time (circuit depth). Like in classical virtual memory, our construction enables queries to a virtual address space larger than what is actually available in hardware. Second, we present a compilation framework to synthesize, map, and schedule QRAM circuits on realistic hardware. For the first time, we demonstrate how to embed large-scale QRAM on a 2D Euclidean space, such as a grid layout, with minimal routing overhead. Third, we show how to leverage the intrinsic biased-noise resilience of the proposed QRAM for implementation on either Noisy Intermediate-Scale Quantum (NISQ) or Fault-Tolerant Quantum Computing (FTQC) hardware. Finally, we validate these results numerically via both classical simulation and quantum hardware experimentation. Our novel Feynman-path-based simulator allows for efficient simulation of noisy QRAM circuits at a larger scale than previously possible. Collectively, our results outline the set of software and hardware controls needed to implement practical QRAM.

References in corpus (24)

• Quantum Computing in the NISQ era and beyond
• Quantum algorithm for solving linear systems of equations
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Surface code quantum computing by lattice surgery
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Architectures for a quantum random access memory
• Halving the cost of quantum addition
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Bell's theorem with and without inequalities for the three-qubit Greenberger-Horne-Zeilinger and W states
• Entangling Bosonic Modes via an Engineered Exchange Interaction
• Quantum Circuit Placement
• Fault tolerant resource estimation of quantum random-access memories
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation
• Resilience of quantum random access memory to generic noise
• Optimal quantum circuit synthesis from Controlled-U gates
• T-count and T-depth of any multi-qubit unitary
• Convex optimization using quantum oracles
• SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
• Approximate Quantum Random Access Memory Architectures
• Efficient and Error-Resilient Data Access Protocols for a Limited-Sized Quantum Random Access Memory

Cited by in corpus (7)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Fundamental causal bounds of quantum random access memories
• A quantum random access memory (QRAM) using a polynomial encoding of binary strings
• Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
• Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator
• Error-Mitigated Multi-Layer Quantum Routing