Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Layered Algorithm Stack for a Hybrid QRAM Architecture

Vitthal Saxena

Published Jul 25, 2026• 0 citations
Publisher

Abstract

This paper introduces an end-to-end algorithmic architecture for a hybrid SiC memory, PIC routed QRAM design which is then simulated for demonstrating various applications such as Grover’s, Shor’s and mitigation of barren plateaus in QAOA applications. The architecture follows a six-layered design where the layers correspond to, starting with interaction with the physical hardware (adiabatic Raman write operations into divacancy spin memories, MZI bucket-brigade and dual-rail heralded readoperations), then a QRAM instruction set (involves a lookup unitary with polylogarithmic error scaling), followed by a memory management layer and then an error correction layer which uses erasureconversion to get a simulated dataset for the final two software layers. The penultimate layer defines essential re-usable primitives and the final layer is the application test layer where the aboveapplications are demonstrated. Altogether, this architecture exhibits a physically realizable QRAM, scalable up to 2^10-2^14 cells enabled by an algorithmic stack of practical industrial use case.

DOI
10.5281/zenodo.21549556

Related papers

Hybrid Photonic and Quantum Dot QRAM Architecture

Vitthal Saxena

This paper proposes a hybrid Quantum Random Access Memory (QRAM) architecture comprised of a silicon based photonic integrated circuit (PIC) platform coupled with SiC spin memories. The materials foundation of this work focuses on the physical realization of the architecture through heterogeneous integration of SiC color centres as memory onto Si based photonic waveguides. It discusses the fabrication routes, coupling efficiencies, loss minimization, and coherence preservation necessary for the reliable operation of large scale QRAMs, supported by quantitative performance estimates derived from Chen et al.’s analytical fidelity model. With a carefully designed, analysed and novel architecture for a QRAM, the contributions outlined in this paper propose a roadmap towards a scalable, photonic spin hybrid QRAM that should be compatible for manufacturing with the existing/near-term foundries and then extensible into modular and distributed quantum computing systems.

•Dec 31, 2025•0 citations

Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks

K. C. Chen, Wenhan Dai, Carlos Errando-Herranz +2 more

A quantum random access memory (qRAM) is considered an essential computing unit to enable polynomial speedups in quantum information processing.Proposed implementations include the use of neutral atoms and superconducting circuits to construct a binary tree but these systems still require demonstrations of the elementary components.Here, we propose a photonic-integrated-circuit (PIC) architecture integrated with solid-state memories as a viable platform for constructing a qRAM.We also present an alternative scheme based on quantum teleportation and extend it to the context of quantum networks.Both implementations realize the two key qRAM operations, (1) quantum state transfer and (2) quantum routing, with already demonstrated components: electro-optic modulators, a Mach-Zehnder interferometer (MZI) network, and nanocavities coupled to artificial atoms for spin-based memory writing and retrieval.Our approaches furthermore benefit from built-in error detection based on photon heralding.Detailed theoretical analysis of the qRAM efficiency and query fidelity shows that our proposal presents viable near-term designs for a general qRAM.

arXiv:2103.07623•PRX Quantum•Aug 3, 2021•43 citations

Heterogeneously error-corrected QRAMs

Ansh Singal, Kaitlin N. Smith

Quantum Random Access Memory (QRAM) holds the promise of enabling several large scale applications of quantum computers. However, designing fault tolerant QRAMs for large scale applications is still an open problem due to the poor error and resource scaling of current architectures. Existing protocols often overlook the need for error correcting QRAMs, which will be required for data-intensive, fault-tolerant applications. However, naively error correcting all qubits used to implement the QRAM is prohibitively resource intensive, quickly becoming infeasible for large applications. To fill this gap, we propose a novel QRAM architecture that leverages variable strength error correction. We strongly error-correct qubits that heavily influence query fidelity, and lightly correct less critical regions of the QRAM. This scheme produces queries with fidelity bounded by a constant for arbitrarily sized QRAMs without requiring improvements in physical hardware. Furthermore, the heterogeneous scheme requires 5x fewer resources (for depth 30 QRAM) and quadratically slower error scaling as compared to a uniformly error corrected Bucket Brigade QRAM. In this work, we present a rigorous analysis of the query fidelity scaling and perform resource analyses of two variations of the heterogeneous architecture using the surface code. We verify our results using numerical simulations and compare our results against several other existing QRAM techniques. Through our results, we quantitatively prove the optimal scaling of the heterogeneous architecture, paving a way for data-intensive and fault tolerant quantum applications.

arXiv:2504.21687•Apr 30, 2025•2 citations

Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor

Sheng Zhang, Yun-Jie Wang, Peng Wang +19 more

Quantum routers (QRouters) are essential components of bucket-brigade quantum random access memory (QRAM), enabling quantum applications such as Grover’s search and quantum machine learning. Despite significant theoretical advances, achieving scalable and coherent QRouters experimentally remains challenging. Here, we demonstrate coherent quantum routers using a superconducting quantum processor, laying a practical foundation for scalable QRAM systems. The quantum router at the core of our implementation utilizes the transition composite gate scheme, wherein auxiliary energy levels temporarily mediate conditional interactions. By leveraging two-qubit primitives in its construction, the quantum router preserves straightforward initialization and calibration while significantly reducing circuit depth and duration relative to traditional gate-based decompositions. Moreover, by encoding routing addresses in the nonadjacent qutrit states | 0 ⟩ and | 2 ⟩ , our design inherently enables erasure-detection capability, providing efficient postselection to mitigate routing errors. Experimentally, we achieve an average fidelity of 94.8% across three individual QRouters, and we validate scalability through a two-layer quantum routing network achieving a fidelity of 82.4%. Our results represent a significant advancement in quantum routing technology, providing enhanced fidelity, built-in error resilience, and practical scalability crucial for the development of future QRAM and large-scale quantum computing architectures.

arXiv:2505.13958•Physical Review X•Jul 24, 2026•6 citations

Technical analysis of the Resource-efficient Quantum Walkers Quantum Random Access Memory

Giuseppe De Riso, Giuseppe Catalano, Seth Lloyd +2 more

Quantum Random Access Memory (qRAM) is a critical component for achieving quantum advantage in algorithms ranging from database search to quantum machine learning. In a recently introduced model [arXiv:2508.02855], we proposed a resource-efficient qRAM architecture based on discrete-time quantum walkers. This article serves as a comprehensive technical follow-up, providing the full mathematical derivations, detailed protocol specifications, and in-depth resource analysis. Moreover, we extend the original proposal with novel techniques for the purpose of making the qRAM implementation more realistic. Our model resolves the primary drawbacks of leading qRAM proposals: it avoids the exponential number of active nodes $\mathcal{O}(2^n)$ required by the "Bucket Brigade" architecture by employing a number of quantum walkers that scales linearly with the address and message sizes, $n$ and $m$, respectively. Simultaneously, it overcomes the spatial bottlenecks of previous quantum-walker schemes by eliminating the need for multiple parallel trees. We propose two algorithmic paradigms: the long- and the short-range approaches, which differ by the length of interaction of the main routing gates employed in the qRAM. We formalize the routing, message-copy, and walker retrieval phases for both variants and we show how, while the long-range scheme employs controlled gates having a multitude of target systems, the short-range approach decomposes these interactions into sequences of 2- and 3-body local gates, which improves the architecture's feasibility for near-term experimental implementation. Finally, our comprehensive resource analysis confirms that the short-range approach achieves the optimal $\mathcal{O}(n+m)$ circuit depth. Within these two paradigms, we explore the potential of different types of quantum walkers, namely bosons, dual-rail qubits and four-level qudits.

quant-pharXiv:2609.40020•Oct 1, 2026•0 citations

Quantum processing unit

Vinod Kumar Khanna

Incompatibility of classical memory for quantum computing is explained. Efficient storage/modification of quantum or classical data is accomplished by using a quantum random-access memory (QRAM). A QRAM applies the principle of quantum superposition for simultaneously accessing all the data stored in the memory cell to assure the superior performance of quantum algorithms. Data reading and writing in a bucket-brigade QRAM are described and the feasibility of its optical implementation is discussed. Quantum computers are understood through layered architectures, viz., 3-, 4-, and 5-layer architectures. Organization of a superconducting quantum computer is illustrated by considering a generic architecture. The superconducting transmon qubits produced inside a dilution refrigerator are manipulated by sequences of microwave pulses. Electronic systems used for producing the control signals and reading the quantum information are described. Quantum computers have been built by several industry giants. Improved quantum processors are being assembled with continuous advancements and refinements. Future computing is likely to follow a hybrid paradigm in which the quantum computers will work in tandem with classical computers in a seamless, integrated environment. Each type of computing will complement the strengths and weaknesses of its counterpart.

Institute of Physics eBooks•Jan 1, 2025•0 citations
This paper introduces an end-to-end algorithmic architecture for a hybrid SiC memory, PIC routed QRAM design which is then simulated for demonstrating various applications such as Grover’s, Shor’s and mitigation of barren plateaus in QAOA applications. The architecture follows a six-layered design where the layers correspond to, starting with interaction with the physical hardware (adiabatic Raman write operations into divacancy spin memories, MZI bucket-brigade and dual-rail heralded readoperations), then a QRAM instruction set (involves a lookup unitary with polylogarithmic error scaling), followed by a memory management layer and then an error correction layer which uses erasureconversion to get a simulated dataset for the final two software layers. The penultimate layer defines essential re-usable primitives and the final layer is the application test layer where the aboveapplications are demonstrated. Altogether, this architecture exhibits a physically realizable QRAM, scalable up to 2^10-2^14 cells enabled by an algorithmic stack of practical industrial use case.
This paper proposes a hybrid Quantum Random Access Memory (QRAM) architecture comprised of a silicon based photonic integrated circuit (PIC) platform coupled with SiC spin memories. The materials foundation of this work focuses on the physical realization of the architecture through heterogeneous integration of SiC color centres as memory onto Si based photonic waveguides. It discusses the fabrication routes, coupling efficiencies, loss minimization, and coherence preservation necessary for the reliable operation of large scale QRAMs, supported by quantitative performance estimates derived from Chen et al.’s analytical fidelity model. With a carefully designed, analysed and novel architecture for a QRAM, the contributions outlined in this paper propose a roadmap towards a scalable, photonic spin hybrid QRAM that should be compatible for manufacturing with the existing/near-term foundries and then extensible into modular and distributed quantum computing systems.
A quantum random access memory (qRAM) is considered an essential computing unit to enable polynomial speedups in quantum information processing.Proposed implementations include the use of neutral atoms and superconducting circuits to construct a binary tree but these systems still require demonstrations of the elementary components.Here, we propose a photonic-integrated-circuit (PIC) architecture integrated with solid-state memories as a viable platform for constructing a qRAM.We also present an alternative scheme based on quantum teleportation and extend it to the context of quantum networks.Both implementations realize the two key qRAM operations, (1) quantum state transfer and (2) quantum routing, with already demonstrated components: electro-optic modulators, a Mach-Zehnder interferometer (MZI) network, and nanocavities coupled to artificial atoms for spin-based memory writing and retrieval.Our approaches furthermore benefit from built-in error detection based on photon heralding.Detailed theoretical analysis of the qRAM efficiency and query fidelity shows that our proposal presents viable near-term designs for a general qRAM.
Quantum Random Access Memory (QRAM) holds the promise of enabling several large scale applications of quantum computers. However, designing fault tolerant QRAMs for large scale applications is still an open problem due to the poor error and resource scaling of current architectures. Existing protocols often overlook the need for error correcting QRAMs, which will be required for data-intensive, fault-tolerant applications. However, naively error correcting all qubits used to implement the QRAM is prohibitively resource intensive, quickly becoming infeasible for large applications. To fill this gap, we propose a novel QRAM architecture that leverages variable strength error correction. We strongly error-correct qubits that heavily influence query fidelity, and lightly correct less critical regions of the QRAM. This scheme produces queries with fidelity bounded by a constant for arbitrarily sized QRAMs without requiring improvements in physical hardware. Furthermore, the heterogeneous scheme requires 5x fewer resources (for depth 30 QRAM) and quadratically slower error scaling as compared to a uniformly error corrected Bucket Brigade QRAM. In this work, we present a rigorous analysis of the query fidelity scaling and perform resource analyses of two variations of the heterogeneous architecture using the surface code. We verify our results using numerical simulations and compare our results against several other existing QRAM techniques. Through our results, we quantitatively prove the optimal scaling of the heterogeneous architecture, paving a way for data-intensive and fault tolerant quantum applications.
Quantum routers (QRouters) are essential components of bucket-brigade quantum random access memory (QRAM), enabling quantum applications such as Grover’s search and quantum machine learning. Despite significant theoretical advances, achieving scalable and coherent QRouters experimentally remains challenging. Here, we demonstrate coherent quantum routers using a superconducting quantum processor, laying a practical foundation for scalable QRAM systems. The quantum router at the core of our implementation utilizes the transition composite gate scheme, wherein auxiliary energy levels temporarily mediate conditional interactions. By leveraging two-qubit primitives in its construction, the quantum router preserves straightforward initialization and calibration while significantly reducing circuit depth and duration relative to traditional gate-based decompositions. Moreover, by encoding routing addresses in the nonadjacent qutrit states | 0 ⟩ and | 2 ⟩ , our design inherently enables erasure-detection capability, providing efficient postselection to mitigate routing errors. Experimentally, we achieve an average fidelity of 94.8% across three individual QRouters, and we validate scalability through a two-layer quantum routing network achieving a fidelity of 82.4%. Our results represent a significant advancement in quantum routing technology, providing enhanced fidelity, built-in error resilience, and practical scalability crucial for the development of future QRAM and large-scale quantum computing architectures.
Quantum Random Access Memory (qRAM) is a critical component for achieving quantum advantage in algorithms ranging from database search to quantum machine learning. In a recently introduced model [arXiv:2508.02855], we proposed a resource-efficient qRAM architecture based on discrete-time quantum walkers. This article serves as a comprehensive technical follow-up, providing the full mathematical derivations, detailed protocol specifications, and in-depth resource analysis. Moreover, we extend the original proposal with novel techniques for the purpose of making the qRAM implementation more realistic. Our model resolves the primary drawbacks of leading qRAM proposals: it avoids the exponential number of active nodes O(2n)\mathcal{O}(2^n)O(2n) required by the "Bucket Brigade" architecture by employing a number of quantum walkers that scales linearly with the address and message sizes, nnn and mmm, respectively. Simultaneously, it overcomes the spatial bottlenecks of previous quantum-walker schemes by eliminating the need for multiple parallel trees. We propose two algorithmic paradigms: the long- and the short-range approaches, which differ by the length of interaction of the main routing gates employed in the qRAM. We formalize the routing, message-copy, and walker retrieval phases for both variants and we show how, while the long-range scheme employs controlled gates having a multitude of target systems, the short-range approach decomposes these interactions into sequences of 2- and 3-body local gates, which improves the architecture's feasibility for near-term experimental implementation. Finally, our comprehensive resource analysis confirms that the short-range approach achieves the optimal O(n+m)\mathcal{O}(n+m)O(n+m) circuit depth. Within these two paradigms, we explore the potential of different types of quantum walkers, namely bosons, dual-rail qubits and four-level qudits.
Incompatibility of classical memory for quantum computing is explained. Efficient storage/modification of quantum or classical data is accomplished by using a quantum random-access memory (QRAM). A QRAM applies the principle of quantum superposition for simultaneously accessing all the data stored in the memory cell to assure the superior performance of quantum algorithms. Data reading and writing in a bucket-brigade QRAM are described and the feasibility of its optical implementation is discussed. Quantum computers are understood through layered architectures, viz., 3-, 4-, and 5-layer architectures. Organization of a superconducting quantum computer is illustrated by considering a generic architecture. The superconducting transmon qubits produced inside a dilution refrigerator are manipulated by sequences of microwave pulses. Electronic systems used for producing the control signals and reading the quantum information are described. Quantum computers have been built by several industry giants. Improved quantum processors are being assembled with continuous advancements and refinements. Future computing is likely to follow a hybrid paradigm in which the quantum computers will work in tandem with classical computers in a seamless, integrated environment. Each type of computing will complement the strengths and weaknesses of its counterpart.