arXiv subjects

Sai Nandan Morapakula

Publications and source records attributed to Sai Nandan Morapakula.

7 recordsLinked to original sources

arXiv2026

Closed Timelike Curve Decoding on Quantum Hardware

Deutsch closed timelike curves (D-CTCs) are described by a fixed-point condition for a chronology-violating register. We study a finite-dimensional circuit model that places a Hayden--Preskill/Yoshida--Kitaev recovery map inside such a consistency loop. A register-routing construction makes the Deutsch map explicit: an initial SWAP moves the incoming CTC state to an idle dump register, the scrambler and decoder act on the remaining active registers, and a final SWAP writes the recovered message back to the CTC register. When the active branch recovers the message, the induced map on the CTC register is the replacement channel $σ\mapsto ρ_M$, with the unique fixed point $ρ_M$. We implement the associated Lloyd-type post-selected decoder circuits on quantum hardware and formulate a classical-feedback iteration for the experimentally estimated map. Qiskit simulations and IBM-hardware data for single-qubit instances quantify decoder fidelity, post-selection overhead, routing-dependent noise, and quantum-geometric susceptibility.

quant-ph↗

arXiv2025

End-to-End Portfolio Optimization with Quantum Annealing

Hybrid-quantum classical optimization has emerged as a promising direction for addressing financial decision problems under current quantum hardware constraints. In this work we present a practical end-to-end portfolio optimization pipeline that combines (i) a continuous mean-variance and Sharpe-ratio formulation, (ii) a QUBO/CQM-based discrete asset selection stage solved using D-Wave's hybrid quantum annealing solver, (iii) classical convex optimization for computing optimal asset weights, and (iv) a quarterly rebalancing mechanism. Rather than claiming quantum advantage, our goal is to evaluate the feasibility and integration of these components within a deployable financial workflow. We empirically compare our hybrid pipeline against a fund manager in real time and indexes used in Indian stock market. The results indicate that the proposed framework can construct diversified portfolios and achieve competitive returns. We also report computational considerations and scalability observations drawn from the hybrid solver behaviour. While the experiments are limited to moderate sized portfolios dictated by current annealing hardware and QUBO embedding constraints, the study illustrates how quantum assisted selection and classical allocation can be combined coherently in a real-world setting. This work emphasizes methodological reproducibility and practical applicability, and aims to serve as a step toward larger-scale financial optimization workflows as quantum annealers continue to mature.

quant-ph↗

arXiv2025

Prediction of Stocks Index Price using Quantum GANs

This paper investigates the application of Quantum Generative Adversarial Networks (QGANs) for stock price prediction. Financial markets are inherently complex, marked by high volatility and intricate patterns that traditional models often fail to capture. QGANs, leveraging the power of quantum computing, offer a novel approach by combining the strengths of generative models with quantum machine learning techniques. We implement a QGAN model tailored for stock price prediction and evaluate its performance using historical stock market data. Our results demonstrate that QGANs can generate synthetic data closely resembling actual market behavior, leading to enhanced prediction accuracy. The experiment was conducted using the Stocks index price data and the AWS Braket SV1 simulator for training the QGAN circuits. The quantum-enhanced model outperforms classical Long Short-Term Memory (LSTM) and GAN models in terms of convergence speed and prediction accuracy. This research represents a key step toward integrating quantum computing in financial forecasting, offering potential advantages in speed and precision over traditional methods. The findings suggest important implications for traders, financial analysts, and researchers seeking advanced tools for market analysis.

cs.LG↗

arXiv2023

Introduction to Topological Superconductivity and Majorana Fermions for Quantum Engineers

In this tutorial paper, we provide an introduction to the briskly expanding research field of Majorana fermions in topological superconductors. We discuss several aspects of topological superconductivity and the advantages it brings to quantum computing. Mathematical derivation of the Kitaev model and BdG Hamiltonian is carried out to explain the phenomena of superconductivity and Majorana fermions. The Majorana fermions and the Non-Abelian statistics are described in detail along with their significance for quantum engineers. The theory provided led towards the engineering of the topological qubits using Majoranas.

quant-ph↗

arXiv2023

A Universal Quantum Technology Education Program

Quantum technology is an emerging cutting-edge field which offers a new paradigm for computation and research in the field of physics, mathematics and other scientific disciplines. This technology is of strategic importance to governments globally and heavy investments and budgets are being sanctioned to gain competitive advantage in terms of military, space and education. Due to this, it is important to understand the educational and research needs required to implement this technology at a large scale. Here, we propose a novel universal quantum technology master's curriculum which comprises a balance between quantum hardware and software skills to enhance the employability of professionals thereby reducing the skill shortage faced by the academic institutions and organizations today. The proposed curriculum holds the potential to revolutionize the quantum education ecosystem by reducing the pressure of hiring PhDs faced by startups and promoting the growth of a balanced scientific mindset in quantum research.

physics.ed-ph↗

arXiv2023

Quantum Natural Language Processing based Sentiment Analysis using lambeq Toolkit

Sentiment classification is one the best use case of classical natural language processing (NLP) where we can witness its power in various daily life domains such as banking, business and marketing industry. We already know how classical AI and machine learning can change and improve technology. Quantum natural language processing (QNLP) is a young and gradually emerging technology which has the potential to provide quantum advantage for NLP tasks. In this paper we show the first application of QNLP for sentiment analysis and achieve perfect test set accuracy for three different kinds of simulations and a decent accuracy for experiments ran on a noisy quantum device. We utilize the lambeq QNLP toolkit and $t|ket>$ by Cambridge Quantum (Quantinuum) to bring out the results.

quant-ph↗

arXiv2022

Variational Quantum Algorithms for Chemical Simulation and Drug Discovery

Quantum computing has gained a lot of attention recently, and scientists have seen potential applications in this field using quantum computing for Cryptography and Communication to Machine Learning and Healthcare. Protein folding has been one of the most interesting areas to study, and it is also one of the biggest problems of biochemistry. Each protein folds distinctively, and the difficulty of finding its stable shape rapidly increases with an increase in the number of amino acids in the chain. A moderate protein has about 100 amino acids, and the number of combinations one needs to verify to find the stable structure is enormous. At some point, the number of these combinations will be so vast that classical computers cannot even attempt to solve them. In this paper, we examine how this problem can be solved with the help of quantum computing using two different algorithms, Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), using Qiskit Nature. We compare the results of different quantum hardware and simulators and check how error mitigation affects the performance. Further, we make comparisons with SoTA algorithms and evaluate the reliability of the method.

quant-ph↗