Resilience of quantum random access memory to generic noise
arXiv:2012.05340 · doi:10.1103/PRXQuantum.2.020311
Abstract
Quantum random access memory (QRAM)--memory which stores classical data but allows queries to be performed in superposition--is required for the implementation of numerous quantum algorithms. While naive implementations of QRAM are highly susceptible to decoherence and hence not scalable, it has been argued that the bucket brigade QRAM architecture [Giovannetti et al., Phys. Rev. Lett. 100 160501 (2008)] is highly resilient to noise, with the infidelity of a query scaling only logarithmically with the memory size. In prior analyses, however, this favorable scaling followed directly from the use of contrived noise models, thus leaving open the question of whether experimental implementations would actually enjoy the purported scaling advantage. In this work, we study the effects of decoherence on QRAM in full generality. Our main result is a proof that this favorable infidelity scaling holds for arbitrary error channels (including, e.g., depolarizing noise and coherent errors). Our proof identifies the origin of this noise resilience as the limited entanglement among the memory's components, and it also reveals that significant architectural simplifications can be made while preserving the noise resilience. We verify these results numerically using a novel classical algorithm for the efficient simulation of noisy QRAM circuits. Our findings indicate that QRAM can be implemented with existing hardware in realistically noisy devices, and that high-fidelity queries are possible without quantum error correction. Furthermore, we also prove that the benefits of the bucket-brigade architecture persist when quantum error correction is used, in which case the scheme offers improved hardware efficiency and resilience to logical errors.
arXiv comment18+13 pages, 9+2 figures, updated to match published version
References in corpus (39)
- Quantum Machine Learning
- Quantum algorithm for solving linear systems of equations
- Quantum Chemistry in the Age of Quantum Computing
- Quantum random access memory
- Hamiltonian Simulation by Qubitization
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Toward the first quantum simulation with quantum speedup
- Quantum Data Fitting
- Quantum machine learning: a classical perspective
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Architectures for a quantum random access memory
- Quantum private queries
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Bias-preserving gates with stabilized cat qubits
- Repetition Cat Qubits for Fault-Tolerant Quantum Computation
- Quantum gradient descent for linear systems and least squares
- Hardware-efficient quantum random access memory with hybrid quantum acoustic systems
- Quantum computation with realistic magic state factories
- Circuit-Based Quantum Random Access Memory for Classical Data
- Random access quantum information processors
- On the robustness of bucket brigade quantum RAM
- Surface code implementation of block code state distillation
- Pattern recognition on a quantum computer
- Fault tolerant resource estimation of quantum random-access memories
- Scalable quantum memory in the ultrastrong coupling regime
- Universal fault-tolerant gates on concatenated stabilizer codes
- Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
- Experimental realization of 105-qubit random access quantum memory
- A Robust Quantum Random Access Memory
- Path-Independent Quantum Gates with Noisy Ancilla
- Circuit-based quantum random access memory for classical data with continuous amplitudes
- Black-box Hamiltonian simulation and unitary implementation
- Decoherence and entanglement degradation of a qubit-qutrit system in non-inertial frames
- Error-transparent quantum gates for small logical qubit architectures
- Parallelising the Queries in Bucket Brigade Quantum RAM
- Geometric measure of quantum discord for a two-parameter class of states in a qubit-qutrit system under various dissipative channels
- A network-ready random-access qubits memory
- Quantum algorithm for optical template recognition with noise filtering
- Error-transparent evolution: the ability of multi-body interactions to bypass decoherence
Cited by in corpus (41)
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Block-encoding structured matrices for data input in quantum computing
- Quantum Resources Required to Block-Encode a Matrix of Classical Data
- Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks
- Data centers with quantum random access memory and quantum networks
- Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
- Systems Architecture for Quantum Random Access Memory
- Quantum Computing Methods for Supply Chain Management
- Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
- Quantum Data Center: Perspectives
- Circuit complexity of quantum access models for encoding classical data
- End-to-end resource analysis for quantum interior point methods and portfolio optimization
- Quantum algorithms for scientific computing
- Quantum diffusion map for nonlinear dimensionality reduction
- Error Suppression for Arbitrary-Size Black Box Quantum Operations
- Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms
- Quantum algorithms for SVD-based data representation and analysis
- Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization
- Ancilla-Error-Transparent Controlled Beam Splitter Gate
- Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
- QRAM: A Survey and Critique
- Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM
- Quantum Power Flows: From Theory to Practice
- Fundamental causal bounds of quantum random access memories
- Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms
- Quantum matching pursuit: A quantum algorithm for sparse representations
- Quantum algorithm for the Vlasov simulation of the large-scale structure formation with massive neutrinos
- Quantum random access memory with transmon-controlled phonon routing
- A quantum random access memory (QRAM) using a polynomial encoding of binary strings
- Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
- Fault-tolerance in qudit circuit design
- Simulation of open quantum systems on universal quantum computers
- Towards robust variational quantum simulation of Lindblad dynamics via stochastic Magnus expansion
- Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
- Implementation of a quantum addressable router using superconducting qubits
- Unified Architecture for Quantum Lookup Tables
- Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator
- Synthesis of Single Qutrit Circuits from Clifford+R
- Robust and optimal loading of general classical data into quantum computers