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

IEEE Access

Trainable PQC-Based QRAM for Quantum Storage

Koustubh Phalak, Junde Li, Swaroop Ghosh

Published Jan 1, 2023• 10 citations
Publisher

Abstract

Quantum Machine Learning (QML) is a new domain of Machine Learning (ML) and Quantum Computing (QC) that uses a trainable Variational Quantum Circuit (VQC) to solve various learning problems. Classical data is transformed to the quantum Hilbert space using an embedding scheme and the VQC performs quantum operations on this transformed quantum data using parametric quantum gates. In this work, we present a new embedding scheme using Quantum Random Access Memory (QRAM) that takes address as input, and gives data as the output similar to a classical Random Access Memory (RAM). We propose a basic circuit-based QRAM architecture and its application in, (a) storage for ML usage and, (b) storage of binary data. For ML, we store images of digits dataset into the QRAM and perform binary classification using a Quantum Neural Network (QNN). We observe that QNN driven by the proposed QRAM converges faster (at$6^{th}$epoch) with 100% classification accuracy compared to QNN with normal embedding and classical Fully Connected Neural Network (FCNN) setups which converge with same accuracy at around$10^{th}$and$15^{th}$epochs, respectively. We obtain$\approx 63\%$classification accuracy on real hardware from IBM. For storage of binary data, we measure Hamming Distance (HD) and percentage correct predictions for quality evaluation of the proposed QRAM. We observe that the HD and percentage correct predictions worsens as the number of address lines increases. We propose two techniques to improve the QRAM accuracy namely, (i) clustering of raw data and allocating one QRAM per cluster and, (ii) bit splitting to divide wider data into smaller chunks and allocating one QRAM per split. Clustering provides best results by improving the HD for 9-address QRAM by$\approx 1.95\text{X}$than pure QRAM and$\approx 1.74\text{X}$improvement compared to bit-split (which provides$\approx 1.11\text{X}$improvement than pure QRAM).

DOI
10.1109/access.2023.3278600

Related papers

Approximate Quantum Random Access Memory Architectures

Koustubh Phalak, Junde Li, Swaroop Ghosh

Quantum supremacy in many applications using well-known quantum algorithms rely on availability of data in quantum format. Quantum Random Access Memory (QRAM), an equivalent of classical Random Access Memory (RAM), fulfills this requirement. However, the existing QRAM proposals either require qutrit technology and/or incur access challenges. We propose an approximate Parametric Quantum Circuit (PQC) based QRAM which takes address lines as input and gives out the corresponding data in these address lines as the output. We present two applications of the proposed PQC-based QRAM namely, storage of binary data and storage of machine learning (ML) dataset for classification.

arXiv:2210.14804•Oct 24, 2022•14 citations

Quantum Machine Learning for Classification Tasks:Variational Quantum Classifiers and Quantum Neural Networks

Dr K N S Lakshmi, Bondalapu Sandhya, Nasari Durga Prasad +2 more

Quantum Machine Learning (QML) has emerged as a compelling research domain that unites quantum computing principles with classical learning theory to address computationally demanding classification problems.This paper investigates two principal QML architectures-Variational Quantum Classifiers (VQC) and Quantum Neural Networks (QNN)-within the context of binary classification.We present an end-to-end hybrid quantum-classical pipeline applied to the UCI Mushroom dataset, comprising 22 categorical attributes, and demonstrate that quantumenhanced models can achieve competitive classification performance under present-day hardware constraints.The pipeline integrates Quantum Random Access Code (QRAC) encoding for dimensionality reduction, ZZFeatureMapbased quantum feature mapping, RealAmplitudes parameterized ansatz, and classical optimizer-driven parameter updates using the COBYLA algorithm.The complete system is deployed through a Flask web interface and containerized with Docker for reproducibility.Experimental results on a quantum simulator indicate a classification accuracy of 87.4%, precision of 0.891, and recall of 0.863, establishing the practical viability of NISQ-era quantum classifiers for structured categorical data.The paper further analyzes convergence behavior, circuit depth effects, and comparative performance against classical baselines, providing insights into the strengths and limitations of current QML architectures for real-world classification deployment.

Journal of Science Engineering Technology and Management Sciences•Mar 1, 2026•0 citations

DeepQMLP: A Scalable Quantum-Classical Hybrid Deep Neural Network Architecture for Classification

Mahabubul Alam, Swaroop Ghosh

Quantum machine learning (QML) is promising for potential speedups and improvements in conventional machine learning (ML) tasks (e.g., classification/regression). The search for ideal QML models is an active research field. This includes identification of efficient classical-to-quantum data encoding scheme, construction of parametric quantum circuits (PQC) with optimal expressivity and entanglement capability, and efficient output decoding scheme to minimize the required number of measurements, to name a few. However, most of the empirical/numerical studies lack a clear path towards scalability. Any potential benefit observed in a simulated environment may diminish in practical applications due to the limitations of noisy quantum hardware (e.g., under decoherence, gate-errors, and crosstalk). We present a scalable quantum-classical hybrid deep neural network (DeepQMLP) architecture inspired by classical deep neural network architectures. In DeepQMLP, stacked shallow Quantum Neural Network (QNN) models mimic the hidden layers of a classical feed-forward multi-layer perceptron network. Each QNN layer produces a new and potentially rich representation of the input data for the next layer. This new representation can be tuned by the parameters of the circuit. Shallow QNN models experience less decoherence, gate errors, etc. which make them (and the network) more resilient to quantum noise. We present numerical studies on a variety of classification problems to show the trainability of DeepQMLP. We also show that DeepQMLP performs reasonably well on unseen data and exhibits greater resilience to noise over QNN models that use a deep quantum circuit. DeepQMLP provided up to 25.3% lower loss and 7.92% higher accuracy during inference under noise than QMLP.

arXiv:2202.01899•International Conference on VLSI Design•Feb 1, 2022•9 citations

Scalable Quantum Neural Networks for Classification

Jindi Wu, Zeyi Tao, Qun Li

Many recent machine learning tasks resort to quantum computing to improve classification accuracy and training efficiency by taking advantage of quantum mechanics, known as quantum machine learning (QML). The variational quantum circuit (VQC) is frequently utilized to build a quantum neural network (QNN), which is a counterpart to the conventional neural network. Due to hardware limitations, however, current quantum devices only allow one to use few qubits to represent data and perform simple quantum computations. The limited quantum resource on a single quantum device degrades the data usage and limits the scale of the quantum circuits, preventing quantum advantage to some extent. To alleviate this constraint, we propose an approach to implementing a scalable quantum neural network (SQNN) by utilizing the quantum resource of multiple small-size quantum devices cooperatively. In an SQNN system, several quantum devices are used as quantum feature extractors, extracting local features from an input instance in parallel, and a quantum device works as a quantum predictor, performing prediction over the local features collected through classical communication channels. The quantum feature extractors in the SQNN system are independent of each other, so one can flexibly use quantum devices of varying sizes, with larger quantum devices extracting more local features. Especially, the SQNN can be performed on a single quantum device in a modular fashion. Our work is exploratory and carried out on a quantum system simulator using the TensorFlow Quantum library. The evaluation conducts a binary classification on the MNIST dataset. It shows that the SQNN model achieves a comparable classification accuracy to a regular QNN model of the same scale. Furthermore, it demonstrates that the SQNN model with more quantum resources can significantly improve classification accuracy.

arXiv:2208.07719•Aug 4, 2022•7 citations

EP-PQM: Efficient Parametric Probabilistic Quantum Memory With Fewer Qubits and Gates

Mushahid Khan, Jean Paul Latyr Faye, Udson C. Mendes +1 more

Machine learning (ML) classification tasks can be carried out on a quantum computer (QC) using probabilistic quantum memory (PQM) and its extension, parametric PQM (P-PQM), by calculating the Hamming distance between an input pattern and a database of$r$patterns containing$z$features with$a$distinct attributes. For PQM and P-PQM to correctly compute the Hamming distance, the feature must be encoded using one-hot encoding, which is memory intensive for multiattribute datasets with$a>2$. We can represent multiattribute data more compactly by replacing one-hot encoding with label encoding; both encodings yield the same Hamming distance. Implementing this replacement on a classical computer is trivial. However, replacing these encoding schemes on a QC is not straightforward because PQM and P-PQM operate at the bit level, rather than at the feature level (a feature is represented by a binary string of 0’s and 1’s). We present an enhanced P-PQM, called efficient P-PQM (EP-PQM), that allows label encoding of data stored in a PQM data structure and reduces the circuit depth of the data storage and retrieval procedures. We show implementations for an ideal QC and a noisy intermediate-scale quantum (NISQ) device. Our complexity analysis shows that the EP-PQM approach requires$O(z \log _{2}(a))$qubits as opposed to$O(za)$qubits for P-PQM. EP-PQM also requires fewer gates, reducing gate count from$O(rza)$to$O(rz\log _{2}(a))$. For five datasets, we demonstrate that training an ML classification model using EP-PQM requires 48% to 77% fewer qubits than P-PQM for datasets with$a>2$. EP-PQM reduces circuit depth in the range of 60% to 96%, depending on the dataset. The depth decreases further with a decomposed circuit, ranging between 94% and 99%. EP-PQM requires less space; thus, it can train on and classify larger datasets than previous PQM implementations on NISQ devices. Furthermore, reducing the number of gates speeds up the classification and reduces the noise associated with deep quantum circuits. Thus, EP-PQM brings us closer to scalable ML on an NISQ device.

arXiv:2201.07265•IEEE Transactions on Quantum Engineering•Jan 1, 2022•9 citations

Quantum Machine Learning: Practical Cases

Amine Zeguendry, Zahi Jarir, Mohamed Quafafou

Machine learning (ML) is often listed among the most potential applications for quantum computing. This is in reality a puzzling choice: Nowadays machine learning algorithms are extremely powerful in practice, but still theoretically challenging to understand. Quantum computing, in contrast, does not give actual benchmarks on practical scales. However, theory remains the main tool we have to determine if it may become important for a task. Although it is far from reaching its full potential, nevertheless, it presents several techniques to efficiently deal with the problem which are tough to solve traditionally. In this perspective we deploy the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance with that of its classical counterpart namely the Convolutional Neural Networks (CNNs). We used a quanvolutional layer to separate the pixel data and demonstrate the advantage of applying QNN on a quantum computer. Finally, we implement the Variational Quantum Classifier (VQC) and several classical classifiers built on the Iris dataset, in order to compare their accuracies. We employed amplitude encoding to map data into the large Hilbert space of a quantum computer. The results revealed that the QNN model and VQC had high accuracy and low loss value compared to their purely classical counterparts.

International Conference on Innovations in Intelligent Systems and Applications (INISTA)•Aug 8, 2022•5 citations
Quantum Machine Learning (QML) is a new domain of Machine Learning (ML) and Quantum Computing (QC) that uses a trainable Variational Quantum Circuit (VQC) to solve various learning problems. Classical data is transformed to the quantum Hilbert space using an embedding scheme and the VQC performs quantum operations on this transformed quantum data using parametric quantum gates. In this work, we present a new embedding scheme using Quantum Random Access Memory (QRAM) that takes address as input, and gives data as the output similar to a classical Random Access Memory (RAM). We propose a basic circuit-based QRAM architecture and its application in, (a) storage for ML usage and, (b) storage of binary data. For ML, we store images of digits dataset into the QRAM and perform binary classification using a Quantum Neural Network (QNN). We observe that QNN driven by the proposed QRAM converges faster (at6th6^{th}6thepoch) with 100% classification accuracy compared to QNN with normal embedding and classical Fully Connected Neural Network (FCNN) setups which converge with same accuracy at around10th10^{th}10thand15th15^{th}15thepochs, respectively. We obtain≈63%\approx 63\%≈63%classification accuracy on real hardware from IBM. For storage of binary data, we measure Hamming Distance (HD) and percentage correct predictions for quality evaluation of the proposed QRAM. We observe that the HD and percentage correct predictions worsens as the number of address lines increases. We propose two techniques to improve the QRAM accuracy namely, (i) clustering of raw data and allocating one QRAM per cluster and, (ii) bit splitting to divide wider data into smaller chunks and allocating one QRAM per split. Clustering provides best results by improving the HD for 9-address QRAM by≈1.95X\approx 1.95\text{X}≈1.95Xthan pure QRAM and≈1.74X\approx 1.74\text{X}≈1.74Ximprovement compared to bit-split (which provides≈1.11X\approx 1.11\text{X}≈1.11Ximprovement than pure QRAM).
Quantum supremacy in many applications using well-known quantum algorithms rely on availability of data in quantum format. Quantum Random Access Memory (QRAM), an equivalent of classical Random Access Memory (RAM), fulfills this requirement. However, the existing QRAM proposals either require qutrit technology and/or incur access challenges. We propose an approximate Parametric Quantum Circuit (PQC) based QRAM which takes address lines as input and gives out the corresponding data in these address lines as the output. We present two applications of the proposed PQC-based QRAM namely, storage of binary data and storage of machine learning (ML) dataset for classification.
Quantum Machine Learning (QML) has emerged as a compelling research domain that unites quantum computing principles with classical learning theory to address computationally demanding classification problems.This paper investigates two principal QML architectures-Variational Quantum Classifiers (VQC) and Quantum Neural Networks (QNN)-within the context of binary classification.We present an end-to-end hybrid quantum-classical pipeline applied to the UCI Mushroom dataset, comprising 22 categorical attributes, and demonstrate that quantumenhanced models can achieve competitive classification performance under present-day hardware constraints.The pipeline integrates Quantum Random Access Code (QRAC) encoding for dimensionality reduction, ZZFeatureMapbased quantum feature mapping, RealAmplitudes parameterized ansatz, and classical optimizer-driven parameter updates using the COBYLA algorithm.The complete system is deployed through a Flask web interface and containerized with Docker for reproducibility.Experimental results on a quantum simulator indicate a classification accuracy of 87.4%, precision of 0.891, and recall of 0.863, establishing the practical viability of NISQ-era quantum classifiers for structured categorical data.The paper further analyzes convergence behavior, circuit depth effects, and comparative performance against classical baselines, providing insights into the strengths and limitations of current QML architectures for real-world classification deployment.
Quantum machine learning (QML) is promising for potential speedups and improvements in conventional machine learning (ML) tasks (e.g., classification/regression). The search for ideal QML models is an active research field. This includes identification of efficient classical-to-quantum data encoding scheme, construction of parametric quantum circuits (PQC) with optimal expressivity and entanglement capability, and efficient output decoding scheme to minimize the required number of measurements, to name a few. However, most of the empirical/numerical studies lack a clear path towards scalability. Any potential benefit observed in a simulated environment may diminish in practical applications due to the limitations of noisy quantum hardware (e.g., under decoherence, gate-errors, and crosstalk). We present a scalable quantum-classical hybrid deep neural network (DeepQMLP) architecture inspired by classical deep neural network architectures. In DeepQMLP, stacked shallow Quantum Neural Network (QNN) models mimic the hidden layers of a classical feed-forward multi-layer perceptron network. Each QNN layer produces a new and potentially rich representation of the input data for the next layer. This new representation can be tuned by the parameters of the circuit. Shallow QNN models experience less decoherence, gate errors, etc. which make them (and the network) more resilient to quantum noise. We present numerical studies on a variety of classification problems to show the trainability of DeepQMLP. We also show that DeepQMLP performs reasonably well on unseen data and exhibits greater resilience to noise over QNN models that use a deep quantum circuit. DeepQMLP provided up to 25.3% lower loss and 7.92% higher accuracy during inference under noise than QMLP.
Many recent machine learning tasks resort to quantum computing to improve classification accuracy and training efficiency by taking advantage of quantum mechanics, known as quantum machine learning (QML). The variational quantum circuit (VQC) is frequently utilized to build a quantum neural network (QNN), which is a counterpart to the conventional neural network. Due to hardware limitations, however, current quantum devices only allow one to use few qubits to represent data and perform simple quantum computations. The limited quantum resource on a single quantum device degrades the data usage and limits the scale of the quantum circuits, preventing quantum advantage to some extent. To alleviate this constraint, we propose an approach to implementing a scalable quantum neural network (SQNN) by utilizing the quantum resource of multiple small-size quantum devices cooperatively. In an SQNN system, several quantum devices are used as quantum feature extractors, extracting local features from an input instance in parallel, and a quantum device works as a quantum predictor, performing prediction over the local features collected through classical communication channels. The quantum feature extractors in the SQNN system are independent of each other, so one can flexibly use quantum devices of varying sizes, with larger quantum devices extracting more local features. Especially, the SQNN can be performed on a single quantum device in a modular fashion. Our work is exploratory and carried out on a quantum system simulator using the TensorFlow Quantum library. The evaluation conducts a binary classification on the MNIST dataset. It shows that the SQNN model achieves a comparable classification accuracy to a regular QNN model of the same scale. Furthermore, it demonstrates that the SQNN model with more quantum resources can significantly improve classification accuracy.
Machine learning (ML) classification tasks can be carried out on a quantum computer (QC) using probabilistic quantum memory (PQM) and its extension, parametric PQM (P-PQM), by calculating the Hamming distance between an input pattern and a database ofrrrpatterns containingzzzfeatures withaaadistinct attributes. For PQM and P-PQM to correctly compute the Hamming distance, the feature must be encoded using one-hot encoding, which is memory intensive for multiattribute datasets witha>2a>2a>2. We can represent multiattribute data more compactly by replacing one-hot encoding with label encoding; both encodings yield the same Hamming distance. Implementing this replacement on a classical computer is trivial. However, replacing these encoding schemes on a QC is not straightforward because PQM and P-PQM operate at the bit level, rather than at the feature level (a feature is represented by a binary string of 0’s and 1’s). We present an enhanced P-PQM, called efficient P-PQM (EP-PQM), that allows label encoding of data stored in a PQM data structure and reduces the circuit depth of the data storage and retrieval procedures. We show implementations for an ideal QC and a noisy intermediate-scale quantum (NISQ) device. Our complexity analysis shows that the EP-PQM approach requiresO(zlog⁡2(a))O(z \log _{2}(a))O(zlog2​(a))qubits as opposed toO(za)O(za)O(za)qubits for P-PQM. EP-PQM also requires fewer gates, reducing gate count fromO(rza)O(rza)O(rza)toO(rzlog⁡2(a))O(rz\log _{2}(a))O(rzlog2​(a)). For five datasets, we demonstrate that training an ML classification model using EP-PQM requires 48% to 77% fewer qubits than P-PQM for datasets witha>2a>2a>2. EP-PQM reduces circuit depth in the range of 60% to 96%, depending on the dataset. The depth decreases further with a decomposed circuit, ranging between 94% and 99%. EP-PQM requires less space; thus, it can train on and classify larger datasets than previous PQM implementations on NISQ devices. Furthermore, reducing the number of gates speeds up the classification and reduces the noise associated with deep quantum circuits. Thus, EP-PQM brings us closer to scalable ML on an NISQ device.
Machine learning (ML) is often listed among the most potential applications for quantum computing. This is in reality a puzzling choice: Nowadays machine learning algorithms are extremely powerful in practice, but still theoretically challenging to understand. Quantum computing, in contrast, does not give actual benchmarks on practical scales. However, theory remains the main tool we have to determine if it may become important for a task. Although it is far from reaching its full potential, nevertheless, it presents several techniques to efficiently deal with the problem which are tough to solve traditionally. In this perspective we deploy the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance with that of its classical counterpart namely the Convolutional Neural Networks (CNNs). We used a quanvolutional layer to separate the pixel data and demonstrate the advantage of applying QNN on a quantum computer. Finally, we implement the Variational Quantum Classifier (VQC) and several classical classifiers built on the Iris dataset, in order to compare their accuracies. We employed amplitude encoding to map data into the large Hilbert space of a quantum computer. The results revealed that the QNN model and VQC had high accuracy and low loss value compared to their purely classical counterparts.