Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms

Abstract

Quantum Random Access Memory (QRAM) is a critical component for enabling data queries in superposition, which is the cornerstone of quantum algorithms. Among various QRAM architectures, the bucket-brigade model stands out due to its noise resilience. This paper presents a hardware-efficient native gate set {iSCZ, C-iSCZ} for implementing bucket-brigade QRAM on superconducting platforms. The experimental feasibility of the proposed gate set is demonstrated, showing high fidelity and reduced complexity. By leveraging the complementary control property in QRAM, our approach directly substitutes the conventional {SWAP, CSWAP} gates with the new gate set, eliminating decomposition overhead and significantly reducing circuit depth and gate count.

19 pages, 15 figures

References in corpus (11)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The Quantum Internet
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• Quantum random access memory
• Architectures for a quantum random access memory
• High-Fidelity Single-Shot Toffoli Gate via Quantum Control
• Efficient Long-Range Entanglement using Dynamic Circuits
• Analysis of parametrically driven exchange-type (iSWAP) and two-photon (bSWAP) interactions between superconducting qubits
• Optimal synthesis of the Fredkin gate in a multilevel system

Cited by in corpus (5)

• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• SWAP-less Implementation of Quantum Algorithms
• Implementation of a quantum addressable router using superconducting qubits
• Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator
• Automated Discovery of Non-local Photonic Gates