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

International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia)

Design of a Superposition-Based Approximate QRAM for Noise-Tolerant Quantum Machine Learning

Sohrab Sajadimanesh, Ehsan Atoofian

Published Jan 9, 2026• 1 citation
Publisher

Abstract

Quantum Random Access Memory (QRAM) plays a pivotal role in accelerating quantum algorithms, especially in quantum machine learning. However, its implementation on noisy intermediate-scale quantum (NISQ) computers faces major challenges due to high qubit requirements and large circuit depth. These factors amplify quantum noise, limiting QRAM performance and scalability. In this work, we introduce a gate-pruning strategy that mitigates noise while preserving QRAM functionality. Our approach reduces circuit depth by eliminating small-angle rotation gates which are particularly noise-sensitive on NISQ hardware. This pruning significantly improves QRAM resilience without compromising data-loading efficiency or superposition-based querying. We further show that the pruned QRAM supports a variational quantum classifier capable of parallel training with logarithmic qubit scaling. Experiments on benchmark datasets confirm that our approach enhances noise resilience and classification accuracy, underscoring its potential for practical quantum machine learning in the NISQ era.

DOI
10.1145/3773656.3773677

Related papers

Optimization of Approximate Quantum Random Access Memory for NISQ Devices

Sohrab Sajadimanesh, Jean Paul Latyr Faye, Ehsan Atoofian

An integral aspect of quantum supremacy is the implementation of quantum queries which enable quantum circuits to process quantum data. Quantum random access memory (QRAM) is a promising architecture for realizing these queries. However, implementing QRAM on contemporary quantum computers presents significant challenges due to the substantial noise it introduces. In this paper, we propose a technique that identifies gates with small rotation angles and removes them to simplify QRAM circuits, addressing the challenge of quantum noise on NISQ devices. Among various QRAM architectures, approximate QRAMs exhibit unique characteristics that make them particularly suitable for quantum neural networks (QNNs). Approximate QRAMs leverage trainable QNNs to provide approximate data for a given address that closely matches the exact data. Since QNNs are inherently resilient to errors, the approximate nature of these QRAMs enables them to achieve high accuracy. Additionally, the approximate nature of QRAMs creates opportunities for reducing the number of gates and overall circuit depth. To mitigate potential accuracy loss, we retrain the pruned QRAM to maintain the performance of the original QRAM. Our evaluation on a real quantum computer demonstrates that pruning enhances the robustness of approximate QRAMs, allowing them to function effectively on NISQ devices.

IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•0 citations

Scalable Noise-Resilient Quantum Convolutional Neural Network Architecture for Large-Scale Image Classification on NISQ Device

Abburi Srirama Kanaka Ratnam, Durgesh Nandan

This study introduces a scalable and noise-tolerant quantum convolutional neural network (QCNN) architecture for large-scale image classification using Noisy Intermediate-Scale Quantum (NISQ) devices. The architecture employs a hybrid quantum-classical approach; classical data from the MNIST dataset are initially preprocessed before being converted into quantum states using angle encoding and superposition methods. The QCNN consists of Quantum Convolution Layers and classical layers of pooling and variational classification, which extract features from input images and classify them. To mitigate the impact of noise and hardware limitations, we applied a pruning-based optimization technique that reduces the circuit depth from 400 to 130 and the gate count from 900 to 280 while maintaining high accuracy (up to 0.94). The results also demonstrate an approximately 80% decrease in loss (from 1.20 to 0.25) and approximately 75% decrease in mean square error (from 0.50 to 0.12), and an increase in robustness (from 0.85 to 0.89). Finally, we found that our optimized QCNN has better classification performance than traditional QCNNs, and comparable performance to classical CNNs.

•Sep 1, 2026•0 citations

Resilience of Quantum Random Access Memory to Generic Noise

Connor T. Hann, Gideon Lee, S. M. Girvin +1 more

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:2012.05340•PRX Quantum•Apr 29, 2021•95 citations

Resilience of Quantum Random Access Memory to Generic Noise

Connor T. Hann, Gideon Lee, S. M. Girvin +1 more

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.

•Apr 29, 2021•57 citations

Quantum Random Access Memory (QRAM) for Accelerating Machine Learning

Jincheng Zhang

The burgeoning field of machine learning (ML) is increasingly reliant on massive datasets for training complex models, particularly deep neural networks. However, the retrieval of data from conventional memory systems represents a significant bottleneck, limiting the scalability and efficiency of ML algorithms. This research proposes a Quantum Random Access Memory (QRAM) architecture designed to overcome this limitation by leveraging quantum mechanical principles. The core concept involves encoding data into qubits and utilizing quantum random access to achieve near-instantaneous data retrieval. This paper details a novel QRAM architecture, focusing on qubit arrangement, control mechanisms, and strategies for minimizing decoherence – a primary challenge in quantum computing. The theoretical framework explores the potential acceleration achievable through QRAM in deep neural network training, with the primary goal of dramatically reducing training times. We present a detailed mathematical model outlining the data encoding process, quantum access protocols, and the expected performance gains. The architecture incorporates error mitigation techniques and discusses the scalability of the design for increasingly complex datasets. The research highlights the transformative potential of QRAM in accelerating ML, addressing a fundamental constraint within the current landscape of computational learning.

•Sep 7, 2026•0 citations

Quantum Machine Learning for Noisy Intermediate-Scale Quantum Devices: A Comprehensive Review

Quantum computing has emerged as a transformative paradigm capable of addressing computational challenges beyond the reach of classical systems.In the current era of Noisy Intermediate-Scale Quantum (NISQ) devices, practical quantum hardware is characterized by limited qubit counts, short coherence times, gate errors, and the absence of full error correction.Despite these constraints, significant progress has been made in developing quantum machine learning (QML) techniques tailored to operate on near-term quantum processors.This paper presents a comprehensive review of Quantum Machine Learning in the context of NISQ computing.We first outline the fundamental principles of quantum computing, including qubits, superposition, entanglement, and quantum parallelism, followed by a detailed discussion of the NISQ computing model and its hardware limitations.The review then examines hybrid quantum-classical learning frameworks, variational quantum algorithms, quantum data encoding strategies, and noise mitigation techniques that enable practical implementation on existing platforms.Emerging applications across healthcare, finance, cybersecurity, climate modeling, and materials science are also surveyed to highlight the real-world potential of QML.Furthermore, key challenges such as scalability, trainability issues, and algorithmic robustness are analyzed, along with current research efforts aimed at overcoming these barriers.The paper concludes by identifying promising future directions for advancing QML toward quantum advantage.This review aims to provide researchers and practitioners with a structured understanding of the capabilities, limitations, and opportunities of quantum machine learning in the NISQ era .

International Research Journal of Modernization in Engineering Technology and Science•Apr 9, 2026•0 citations
Quantum Random Access Memory (QRAM) plays a pivotal role in accelerating quantum algorithms, especially in quantum machine learning. However, its implementation on noisy intermediate-scale quantum (NISQ) computers faces major challenges due to high qubit requirements and large circuit depth. These factors amplify quantum noise, limiting QRAM performance and scalability. In this work, we introduce a gate-pruning strategy that mitigates noise while preserving QRAM functionality. Our approach reduces circuit depth by eliminating small-angle rotation gates which are particularly noise-sensitive on NISQ hardware. This pruning significantly improves QRAM resilience without compromising data-loading efficiency or superposition-based querying. We further show that the pruned QRAM supports a variational quantum classifier capable of parallel training with logarithmic qubit scaling. Experiments on benchmark datasets confirm that our approach enhances noise resilience and classification accuracy, underscoring its potential for practical quantum machine learning in the NISQ era.
An integral aspect of quantum supremacy is the implementation of quantum queries which enable quantum circuits to process quantum data. Quantum random access memory (QRAM) is a promising architecture for realizing these queries. However, implementing QRAM on contemporary quantum computers presents significant challenges due to the substantial noise it introduces. In this paper, we propose a technique that identifies gates with small rotation angles and removes them to simplify QRAM circuits, addressing the challenge of quantum noise on NISQ devices. Among various QRAM architectures, approximate QRAMs exhibit unique characteristics that make them particularly suitable for quantum neural networks (QNNs). Approximate QRAMs leverage trainable QNNs to provide approximate data for a given address that closely matches the exact data. Since QNNs are inherently resilient to errors, the approximate nature of these QRAMs enables them to achieve high accuracy. Additionally, the approximate nature of QRAMs creates opportunities for reducing the number of gates and overall circuit depth. To mitigate potential accuracy loss, we retrain the pruned QRAM to maintain the performance of the original QRAM. Our evaluation on a real quantum computer demonstrates that pruning enhances the robustness of approximate QRAMs, allowing them to function effectively on NISQ devices.
This study introduces a scalable and noise-tolerant quantum convolutional neural network (QCNN) architecture for large-scale image classification using Noisy Intermediate-Scale Quantum (NISQ) devices. The architecture employs a hybrid quantum-classical approach; classical data from the MNIST dataset are initially preprocessed before being converted into quantum states using angle encoding and superposition methods. The QCNN consists of Quantum Convolution Layers and classical layers of pooling and variational classification, which extract features from input images and classify them. To mitigate the impact of noise and hardware limitations, we applied a pruning-based optimization technique that reduces the circuit depth from 400 to 130 and the gate count from 900 to 280 while maintaining high accuracy (up to 0.94). The results also demonstrate an approximately 80% decrease in loss (from 1.20 to 0.25) and approximately 75% decrease in mean square error (from 0.50 to 0.12), and an increase in robustness (from 0.85 to 0.89). Finally, we found that our optimized QCNN has better classification performance than traditional QCNNs, and comparable performance to classical CNNs.
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.
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.
The burgeoning field of machine learning (ML) is increasingly reliant on massive datasets for training complex models, particularly deep neural networks. However, the retrieval of data from conventional memory systems represents a significant bottleneck, limiting the scalability and efficiency of ML algorithms. This research proposes a Quantum Random Access Memory (QRAM) architecture designed to overcome this limitation by leveraging quantum mechanical principles. The core concept involves encoding data into qubits and utilizing quantum random access to achieve near-instantaneous data retrieval. This paper details a novel QRAM architecture, focusing on qubit arrangement, control mechanisms, and strategies for minimizing decoherence – a primary challenge in quantum computing. The theoretical framework explores the potential acceleration achievable through QRAM in deep neural network training, with the primary goal of dramatically reducing training times. We present a detailed mathematical model outlining the data encoding process, quantum access protocols, and the expected performance gains. The architecture incorporates error mitigation techniques and discusses the scalability of the design for increasingly complex datasets. The research highlights the transformative potential of QRAM in accelerating ML, addressing a fundamental constraint within the current landscape of computational learning.
Quantum computing has emerged as a transformative paradigm capable of addressing computational challenges beyond the reach of classical systems.In the current era of Noisy Intermediate-Scale Quantum (NISQ) devices, practical quantum hardware is characterized by limited qubit counts, short coherence times, gate errors, and the absence of full error correction.Despite these constraints, significant progress has been made in developing quantum machine learning (QML) techniques tailored to operate on near-term quantum processors.This paper presents a comprehensive review of Quantum Machine Learning in the context of NISQ computing.We first outline the fundamental principles of quantum computing, including qubits, superposition, entanglement, and quantum parallelism, followed by a detailed discussion of the NISQ computing model and its hardware limitations.The review then examines hybrid quantum-classical learning frameworks, variational quantum algorithms, quantum data encoding strategies, and noise mitigation techniques that enable practical implementation on existing platforms.Emerging applications across healthcare, finance, cybersecurity, climate modeling, and materials science are also surveyed to highlight the real-world potential of QML.Furthermore, key challenges such as scalability, trainability issues, and algorithmic robustness are analyzed, along with current research efforts aimed at overcoming these barriers.The paper concludes by identifying promising future directions for advancing QML toward quantum advantage.This review aims to provide researchers and practitioners with a structured understanding of the capabilities, limitations, and opportunities of quantum machine learning in the NISQ era .