Architectures for a quantum random access memory

Abstract

A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory sites, which may contain either quantum or classical information. RAMs and qRAMs with n-bit addresses can access 2^n memory sites. Any design for a RAM or qRAM then requires O(2^n) two-bit logic gates. At first sight this requirement might seem to make large scale quantum versions of such devices impractical, due to the difficulty of constructing and operating coherent devices with large numbers of quantum logic gates. Here we analyze two different RAM architectures (the conventional fanout and the "bucket brigade") and propose some proof-of-principle implementations which show that in principle only O(n) two-qubit physical interactions need take place during each qRAM call. That is, although a qRAM needs O(2^n) quantum logic gates, only O(n) need to be activated during a memory call. The resulting decrease in resources could give rise to the construction of large qRAMs that could operate without the need for extensive quantum error correction.

10 pages, 7 figures. Updated version includes the answers to the Referee

References in corpus (15)

• Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
• Measurement of conditional phase shifts for quantum logic
• Quantum random access memory
• Quantum teleportation between light and matter
• Resolving photon number states in a superconducting circuit
• Quantum information processing with circuit quantum electrodynamics
• Measurement-Induced Entanglement for Excitation Stored in Remote Atomic Ensembles
• Quantum private queries
• Tunable coupling of superconducting qubits
• Parametric coupling for superconducting qubits
• Probabilistic Quantum Memories
• Tunable coupling scheme for flux qubits at the optimal point
• Pattern recognition on a quantum computer
• Phase Transitions in Quantum Pattern Recognition
• Quantum algorithm for optical template recognition with noise filtering

Cited by in corpus (131)

• Quantum Chemistry in the Age of Quantum Computing
• Quantum principal component analysis
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum machine learning: a classical perspective
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A quantum linear system algorithm for dense matrices
• Efficient Distributed Quantum Computing
• The prospects of quantum computing in computational molecular biology
• Challenges and Opportunities in Quantum Optimization
• Quantum gradient descent for linear systems and least squares
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Hardware-efficient quantum random access memory with hybrid quantum acoustic systems
• Circuit-Based Quantum Random Access Memory for Classical Data
• Quantum Adversarial Machine Learning
• Quantum singular value decomposition of non-sparse low-rank matrices
• On the robustness of bucket brigade quantum RAM
• Coherent transfer of quantum information in silicon using resonant SWAP gates
• Biology and medicine in the landscape of quantum advantages
• Fault tolerant resource estimation of quantum random-access memories
• A Quantum Algorithm for Solving Linear Differential Equations: Theory and Experiment
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Quantum Private Queries: security analysis
• Quantum Analog-Digital Conversion
• Quantum K-nearest neighbor classification algorithm based on Hamming distance
• Scalable quantum memory in the ultrastrong coupling regime
• Resilience of quantum random access memory to generic noise
• Quantum Fourier Transform in Computational Basis
• Quantum Natural Language Processing on Near-Term Quantum Computers
• Deterministic Grover search with a restricted oracle
• A Robust Quantum Random Access Memory
• Hybrid quantum algorithms for flow problems
• An All-Pair Quantum SVM Approach for Big Data Multiclass Classification
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits
• Universal Adversarial Examples and Perturbations for Quantum Classifiers
• Advances in quantum machine learning
• Non-IID Quantum Federated Learning with One-shot Communication Complexity
• Grover search revisited; application to image pattern matching
• Variational Quantum Evolution Equation Solver
• Quantum Differentially Private Sparse Regression Learning
• Quantum circuit for the fast Fourier transform
• Quantum Capsule Networks
• Data centers with quantum random access memory and quantum networks
• Continuous-variable quantum Gaussian process regression and quantum singular value decomposition of non-sparse low rank matrices
• Optimizing a Polynomial Function on a Quantum Simulator
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Systems Architecture for Quantum Random Access Memory
• Quantum random access memory via quantum walk
• Programmable Superpositions of Ising Configurations
• Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systems
• Predicting excited states from ground state wavefunction by supervised quantum machine learning
• Quantum speedup for track reconstruction in particle accelerators
• Quantum Data Center: Perspectives
• Optimal Usage of Quantum Random Access Memory in Quantum Machine Learning
• Networked Quantum Services
• Protocol for implementing quantum nonparametric learning with trapped ions
• Quantum algorithms for scientific computing
• Realizing quantum linear regression with auxiliary qumodes
• Quantum-enhanced least-square support vector machine: simplified quantum algorithm and sparse solutions
• Fast graph operations in quantum computation
• Quantum Gradient Algorithm for General Polynomials
• Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems
• Quantum Algorithm for Unsupervised Anomaly Detection
• Parallel quantum trajectories via forking for sampling without redundancy
• Quantum Expectation-Maximization Algorithm
• Error Suppression for Arbitrary-Size Black Box Quantum Operations
• An efficient quantum algorithm for spectral estimation
• Experimental demonstration of quantum learning speed-up with classical input data
• Quantum search of a real unstructured database
• Multi-qubit time-bin quantum RAM
• Small quantum computers and large classical data sets
• Quantum Algorithm for Solving a Quadratic Nonlinear System of Equations
• Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization
• High fidelity state transfer in binary tree spin networks
• Quantum Quantitative Trading: High-Frequency Statistical Arbitrage Algorithm
• Ancilla-Error-Transparent Controlled Beam Splitter Gate
• Gaussian Kernel in Quantum Learning
• Controlled quantum search on structured databases
• Applications of the Adversary Method in Quantum Query Algorithms
• Quantum data encoding as a distinct abstraction layer in the design of quantum circuits
• QRAM: A Survey and Critique
• Quantum Finite Volume Method for Computational Fluid Dynamics with Classical Input and Output
• Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applications
• Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
• Proposal for a transmon-based quantum router
• Designing ground states of Hopfield networks for quantum state preparation
• Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms
• Linear Regression by Quantum Amplitude Estimation and its Extension to Convex Optimization
• Quantum solvability of noisy linear problems by divide-and-conquer strategy
• Quantum matching pursuit: A quantum algorithm for sparse representations
• Hybrid algorithms to solve linear systems of equations with limited qubit resources
• Quantum Newton's method for solving system of nonlinear algebraic equations
• Quantum random access memory with transmon-controlled phonon routing
• An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications
• Quantum density peak clustering
• Quantum secure learning with classical samples
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
• Quantum Semi-Supervised Learning with Quantum Supremacy
• Quantum Algorithms for the Pathwise Lasso
• A quantum random access memory (QRAM) using a polynomial encoding of binary strings
• Conditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pricing
• Information compression via hidden subgroup quantum autoencoders
• Tangible reduction in learning sample complexity with large classical samples and small quantum system
• Quantum Algorithm for Radiative Transfer Equation
• Quantum-classical reinforcement learning for decoding noisy classical parity information
• Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
• Hybrid Quantum-Classical Algorithm For Robust Optimization via Stochastic-Gradient Online Learning
• Quantum Calculation for Two-Stream Instability and Advection Test of Vlasov-Maxwell Equations: Numerical Evaluation of Hamiltonian Simulation
• Implementation of a quantum addressable router using superconducting qubits
• Efficient quantum circuits for dense and non-unitary operators
• Quantum clustering and jet reconstruction at the LHC
• Noisy Quantum Trees: Infinite Protection Without Correction
• Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
• The Quantum Monadology
• Exponential Error Convergence in Data Classification with Optimized Random Features: Acceleration by Quantum Machine Learning
• Quantum Alphatron: quantum advantage for learning with kernels and noise
• Context aware quantum simulation of a matrix stored in quantum memory
• Quantum Machine Learning For Classical Data
• Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator
• Unified Architecture for Quantum Lookup Tables
• Sample-size-reduction of quantum states for the noisy linear problem
• Quantum amplitude damping for solving homogeneous linear differential equations: A noninterferometric algorithm
• Robust and optimal loading of general classical data into quantum computers
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms
• Quantum Speedup of Monte Carlo Integration with respect to the Number of Dimensions and its Application to Finance
• Quantum Search for Gravitational Wave of Massive Black Hole Binaries
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks
• Quantum algorithm for collisionless Boltzmann simulation of self-gravitating systems
• Note on (active-)QRAM-style data access as a quantum circuit