A Robust Quantum Random Access Memory

Abstract

A "bucket brigade" architecture for a quantum random memory of $N=2^n$ memory cells needs $n(n+5)/2$ times of quantum manipulation on control circuit nodes per memory call. Here we propose a scheme, in which only average $n/2$ times manipulation is required to accomplish a memory call. This scheme may significantly decrease the time spent on a memory call and the average overall error rate per memory call. A physical implementation scheme for storing an arbitrary state in a selected memory cell followed by reading it out is discussed.

5 pages, 3 figures

References in corpus (4)

• Quantum random access memory
• Architectures for a quantum random access memory
• Quantum computing with collective ensembles of multi-level systems
• Optimized magnetic lattices for ultracold atomic ensembles

Cited by in corpus (31)

• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• The prospects of quantum computing in computational molecular biology
• On the robustness of bucket brigade quantum RAM
• Resilience of quantum random access memory to generic noise
• Quantum algorithm and quantum circuit for A-Optimal Projection: dimensionality reduction
• Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Advances in quantum machine learning
• Data centers with quantum random access memory and quantum networks
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Quantum random access memory via quantum walk
• Realizing quantum linear regression with auxiliary qumodes
• Parallel quantum trajectories via forking for sampling without redundancy
• Quantum search of a real unstructured database
• Multi-qubit time-bin quantum RAM
• Error Suppression for Arbitrary-Size Black Box Quantum Operations
• Multiple single-photon generations in three-level atoms coupled to cavity with non-Markovian effects
• Quantum Quantitative Trading: High-Frequency Statistical Arbitrage Algorithm
• Applications of the Adversary Method in Quantum Query Algorithms
• Controlled quantum search on structured databases
• Ancilla-Error-Transparent Controlled Beam Splitter Gate
• Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM
• QRAM: A Survey and Critique
• Proposal for a transmon-based quantum router
• Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applications
• 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
• Quantum-classical reinforcement learning for decoding noisy classical parity information
• Implementation of a quantum addressable router using superconducting qubits
• Robust and optimal loading of general classical data into quantum computers