#QuantumNeuralNetworks

[govindhtech]

Quantum Recurrent Embedding Neural Networks Approach

Quantum Recurrent Embedding Neural Network

Trainability issues as network depth increases are a common challenge in finding scalable machine learning models for complex physical systems. Researchers have developed a novel approach dubbed the Quantum Recurrent Embedding Neural Network (QRENN) to overcome these limitations with its unique architecture and strong theoretical foundations.

Mingrui Jing, Erdong Huang, Xiao Shi, and Xin Wang from the Hong Kong University of Science and Technology (Guangzhou) Thrust of Artificial Intelligence, Information Hub and Shengyu Zhang from Tencent Quantum Laboratory made this groundbreaking finding. As detailed in the article “Quantum Recurrent Embedding Neural Network,” the QRENN can avoid “barren plateaus,” a common and critical difficulty in deep quantum neural network training when gradients rapidly drop. Additionally, the QRENN resists classical simulation.

The QRENN uses universal quantum circuit designs  and ResNet's fast-track paths for deep learning. Maintaining a sufficient “joint eigenspace overlap,” which assesses the closeness between the input quantum state and the network's internal feature representations, enables trainability. The persistence of overlap has been proven by dynamical Lie algebra researchers.

Applying QRENN to Hamiltonian classification, namely identifying symmetry-protected topological (SPT) phases of matter, has proven its theoretical design. SPT phases are different states of matter with significant features, making them hard to identify in condensed matter physics. The QRENN's ability to categorise Hamiltonians and recognise topological phases shows its utility in supervised learning.

Numerical tests demonstrate that the QRENN can be trained as the quantum system evolves. This is crucial for tackling complex real-world challenges. In simulations with a one-dimensional cluster-Ising Hamiltonian, overlap decreased polynomially as system size increased instead of exponentially. This shows that the network may maintain gradients during training, avoiding the vanishing gradient issue of many QNN architectures.

This paper solves a significant limitation in quantum machine learning by establishing the trainability of a certain QRENN architecture. This allows for more powerful and scalable quantum machine learning models. Future study will examine QRENN applications in financial modelling, drug development, and materials science. Researchers want to improve training algorithms and study unsupervised and reinforcement learning with hybrid quantum-classical algorithms that take advantage of both computing paradigms.

Quantum Recurrent Embedding Neural Network with Explanation (QRENN) provides more information.

Quantum machine learning (QML) has advanced with the Quantum Recurrent Embedding Neural Network (QRENN), which solves the trainability problem that plagues deep quantum neural networks.

Challenge: Barren Mountains Conventional quantum neural networks (QNNs) often experience “barren plateau” occurrences. As system complexity or network depth increase, gradients needed for network training drop exponentially. Vanishing gradients stop learning, making it difficult to train large, complex QNNs for real-world applications.

The e Solution and QRENN Foundations Two major developments by QRENN aim to improve trainability and prevent arid plateaus:

General quantum circuit designs and well-known deep learning algorithms, especially ResNet's fast-track pathways (residual networks), inspired its creation. ResNets are notable for their effective training in traditional deep learning because they use “skip connections” to circumvent layers.

Joint Eigenspace Overlap: QRENN's trainability relies on its large “joint eigenspace overlap”. Overlap refers to the degree of similarity between the input quantum state and the network's internal feature representations. By preserving this overlap, QRENN ensures gradients remain large. This preservation is rigorously shown using dynamical Lie algebras, which are fundamental for analysing quantum circuit behaviour and characterising physical system symmetries.

Architectural details of CV-QRNN When information is represented in continuous variables (qumodes) instead of discrete qubits, the Continuous-Variable Quantum Recurrent Neural Network (CV-QRNN) functions.

Inspired by Vanilla RNN: The CV-QRNN design is based on the vanilla RNN architecture, which processes data sequences recurrently. The no-cloning theorem prevents classical RNN versions like LSTM and GRU from being implemented on a quantum computer, however CV-QRNN modifies the fundamental RNN notion.

A single quantum layer (L) affects n qumodes in CV-QRNN. First, qumodes are created in vacuum.

Important Quantum Gates: The network processes data via quantum gates:

By acting on a subset of qumodes, displacement gates (D) encode classical input data into the quantum network. Squeezing Gates (S): Give qumodes complicated squeeze parameters.

Multiport Interferometers (I): They perform complex linear transformations on several qumodes using beam splitters and phase shifters.

Nonlinearity by Measurement: CV-QRNN provides machine learning nonlinearity using measurements and a quantum system's tensor product structure. After processing, some qumodes (register modes) are transferred to the next iteration, while a subset (input modes) undergo a homodyne measurement and are reset to vacuum. After scaling by a trainable parameter, this measurement's result is input for the next cycle.

Performance and Advantages

According to computer simulations, CV-QRNN trained 200% faster than a traditional LSTM network. The former obtained ideal parameters (cost function ≤ 10⁻⁵) in 100 epochs, while the later took 200. Due to the massive processing power and energy consumption of big classical machine learning models, faster training is necessary.

Scalability: The QRENN can be trained as the quantum system grows, which is crucial for practical use. As system size increases, joint eigenspace overlap reduces polynomially, not exponentially.

Task Execution:

Classifying Hamiltonians and detecting symmetry-protected topological phases proves its utility in supervised learning.

Time Series Prediction and Forecasting: CV-QRNN predicted and forecast quasi-periodic functions such the Bessel function, sine, triangle wave, and damped cosine after 100 epochs.

MNIST Image Classification: Classified handwritten digits like “3” and “6” with 85% accuracy. The quantum network learnt, even though a classical LSTM had fewer epochs and 93% accuracy for this job.

CV-QRNN can be implemented using commercial room-temperature quantum-photonic hardware. This includes powerful homodyne detectors, lasers, beam splitters, phase shifters, and squeezers. Strong Kerr-type interactions are difficult to generate, but nonlinearity measurement eliminates them.

Future research will study how QRENN can be applied to more complex problems, such as financial modelling, medical development, and materials science. We'll also investigate its unsupervised and reinforcement learning potential and develop more efficient and scalable training algorithms.

Research on hybrid quantum-classical algorithms is vital. Next, test these models on quantum hardware instead of simulators. Researchers also seek to evaluate CV-QRNN performance using complex real-world data like hurricane strength and establish more equal frameworks for comparing conventional and quantum networks, such as effective dimension based on quantum Fisher information.

[govindhtech]

Quantum Support Vector Machines In Prostate Cancer Detection

Quantum SVMs

Recent studies show that  Quantum Machine Learning (QML) techniques, particularly Quantum Support Vector Machines (QSVMs), can improve disease detection, especially in complex and unbalanced healthcare datasets. In datasets for diabetes, heart failure, and prostate cancer, quantum models outperform conventional machine learning methods in key areas.

Modern medicine struggles to accurately and earlyly diagnose diseases. Unbalanced datasets in medicine, where there are often many more positive examples than negative cases, are a key impediment. This imbalance makes standard machine learning algorithms perform worse. Scientists are investigating whether quantum computing, which uses entanglement and superposition, can improve pattern recognition in these tough scenarios.

A comparative analysis by Tudisco et al. and published by Quantum Zeitgeist compared QNNs and QSVMs to classical algorithms like Logistic Regression, Decision Trees, Random Forests, and classical SVMs. Quantum methods were tested on prostate cancer, heart failure, and diabetic healthcare datasets to overcome unbalanced data.

QSVMs outperform QNNs and classical models on all datasets. This suggests quantum models excel at difficult categorisation problems. This superiority was notably evident in datasets with significant imbalance, a common healthcare issue. The Heart Failure dataset is severely imbalanced, and standard methods often fail to achieve high recall. Quantum models did better. Quantum models, particularly QSVMs, performed better at detecting positive examples (high recall) in these situations, implying improved diagnosis accuracy in complex clinical scenarios. Quantum models look more beneficial with class difference.

QNNs had good precision scores but overfitted training data, limiting their usefulness. Overfitting occurs when a model learns the training data too well and catches noise and features instead of essential patterns, reducing generalisation performance on unseen data. However, QSVMs were more resilient and reliable. QSVM's high recall across all datasets shows its ability to dependably identify positive cases in various clinical scenarios. Avoiding overfitting in QNNs may require studying alternate circuit design and hyperparameter tuning.

A study called “Quantum Support Vector Machine for Prostate Cancer Detection: A Performance Analysis” examined how QSVM could improve prostate cancer detection over regular SVM. Early identification improves prostate cancer treatment and results. Classical SVMs increase biomedical data interpretation, but large, high-dimensional datasets limit them. QSVMs, which use quantum notions like superposition and entanglement, can manage multidimensional data and speed up operations.

The prostate cancer technique used the Kaggle Prostate Cancer Dataset, which initially comprised 100 observations with 9 variables, including clinical and diagnostic data. The dataset's initial class imbalance was corrected using RandomOverSampler during preparation. The data was normalised and normalised using MinMaxScaler and StandardScaler to increase feature comparability and prepare for quantum encoding. Oversampled to 124 samples, processed data was divided into training (80%) and testing (20%) subsets.

The QSVM approach relied on a quantum feature map architecture, the ZZFeatureMap with full entanglement, carefully selected and tested to match the dataset. This feature map encodes conventional data into quantum states, allowing the quantum system to express complex data correlations in high-dimensional regions using entanglement. QSVM estimates the inner product (overlap) of quantum states that represent data points to generate the kernel function for SVM classification. This estimator measures the likelihood of witnessing the starting state using a quantum circuit.

Prostate cancer experiments provide compelling evidence:

Kernel matrix analysis revealed different patterns. The RBF kernel of the classical SVM showed high similarity values across data points, suggesting a strongly connected feature space. However, QSVM's ZZFeatureMap produced a more dispersed feature space with fewer high off-diagonal values. This implies that the quantum feature space's unique properties boosted class distinguishability.

QSVM outperformed classical SVM (87.89% accuracy, 85.42% sensitivity) on the training dataset with 100% accuracy and sensitivity. As shown, the quantum feature map distinguishes classes without overlap during training.

On the test dataset, both models were 92% accurate. QSVM surpassed SVM in essential medical diagnostic measures, with 100% sensitivity and 93.33% F1-Score on test data, compared to 92.86% and 92.86% for SVM.

Importantly, the QSVM model had no False Negatives (missing malignant cases) in the test data. Only one False Negative occurred in the SVM model. QSVM's great sensitivity is vital in medical circumstances when a false negative could lead to an ailment going undiagnosed and untreated. Quantum feature mapping increases class separation and allows more complex representations.

Cross-validation studies demonstrated that the SVM model was more stable across data subsets than the QSVM, suggesting that the QSVM model overfitted to the training data despite its great performance on the test set. We discuss how QSVM's improved sensitivity and F1-Score aid medical diagnosis. Quantum feature mapping's ability to create a unique, dispersed feature space, especially when separating complex data points, improves performance. QSVM was used to categorise prostate cancer datasets for the first time.