Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator

Abstract

Quantum random access memory (QRAM) is a critical primitive for quantum algorithms that require data lookup in superposition, but its lack of fault tolerance poses a major obstacle to practical deployment. Error filtration (EF) has been proposed as a hardware-efficient alternative to error correction, capable of suppressing incoherent noise without encoding overhead. However, its performance in realistic QRAM systems with moderate fidelity has remained unclear, as existing analyses rely on asymptotic approximations and numerical simulations have been limited to small sizes. We address this gap using a new simulator for bucket-brigade (BB) QRAM that combines sparse state encoding with a noise-aware pruning algorithm. This framework provides full quantum state access and scales efficiently, enabling us to probe EF performance in size and noise regimes far beyond previous studies. Our simulations reveal suppression anomalies at high noise levels or large address sizes, where post-selection probability fundamentally constrains EF scaling. Incorporating this effect, we refine EF theory into near-deterministic criteria linking base infidelity to achievable suppression, thereby delineating the regime in which EF yields progressive improvement. Beyond refining EF, we quantitatively characterize the runtime and memory costs of our noisy BB QRAM simulator, achieving simulations of systems with 20 layers using less than 1 GB of memory. This efficiency is what enables us to probe parameter regimes beyond previous work and to establish the simulator as a practical, ``fine-print'' analysis tool for assessing QRAM as a quantum resource.

14 pages / 8 figures (main text) and 11 pages / 4 figures (appendices)

References in corpus (29)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• Quantum algorithm for solving linear systems of equations
• Quantum support vector machine for big data classification
• Quantum Chemistry in the Age of Quantum Computing
• Quantum principal component analysis
• Quantum random access memory
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum Error Mitigation
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Stim: a fast stabilizer circuit simulator
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Architectures for a quantum random access memory
• Preconditioned quantum linear system algorithm
• Circuit-Based Quantum Random Access Memory for Classical Data
• Fault tolerant resource estimation of quantum random-access memories
• Resilience of quantum random access memory to generic noise
• Beyond NISQ: The Megaquop Machine
• Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks
• Quantum random access memory via quantum walk
• Systems Architecture for Quantum Random Access Memory
• Error Suppression for Arbitrary-Size Black Box Quantum Operations
• Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization
• Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM
• QRAM: A Survey and Critique
• Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms
• Quantum random access memory with transmon-controlled phonon routing
• A quantum random access memory (QRAM) using a polynomial encoding of binary strings