Publications
publications by categories in reversed chronological order.
2025
- A Polylogarithmic-Time Quantum Algorithm for the Laplace TransformarXiv, Dec 2025Preprint
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not seen any efficient implementation on quantum computers due to its dissipative nature and hence non-unitary dynamics. However, a recent work has shown an efficient implementation for certain cases on quantum computers using the Taylor series. Unlike previous work , our work provides a completely different algorithm for doing Laplace Transform using Quantum Eigenvalue Transformation and Lap-LCHS, very efficiently at points which form an arithmetic progression. Our algorithm can implement N × N discrete Laplace transform in gate complexity that grows as O((log N)^3), assuming the efficient state preparation, where N = 2^n and n is the number of qubits, which is a superpolynomial speedup in number of gates over the best classical counterpart that has complexity O(N log N) for the same cases. Also, the circuit width grows as O(log N). Quantum Laplace Transform (QLT) may enable new Quantum algorithms for cases like solving differential equations in the Laplace domain, developing an inverse Laplace transform algorithm on quantum computers, imaginary time evolution in the resolvent domain for calculating ground state energy, and spectral estimation of non-Hermitian matrices.
@article{singh2025qlt, author = {Singh, Akash Kumar and Patra, Ashish Kumar and K. S. V., Anurag and P., Sai Shankar and Bhat, Ruchika and G., Jaiganesh}, title = {A Polylogarithmic-Time Quantum Algorithm for the Laplace Transform}, doi = {10.48550/arXiv.2512.17980}, url = {https://doi.org/10.48550/arXiv.2512.17980}, urldate = {2025-12-19}, month = dec, year = {2025}, journal = {arXiv}, publisher = {arXiv}, note = {Preprint}, } - Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian ReductionsarXiv, Dec 2025Preprint
Accurate determination of ground-state energies for molecules remains a challenge in quantum chemistry and a cornerstone for progress in fields such as drug discovery and materials design. The Variational Quantum Eigensolver (VQE) represents a leading hybrid quantum-classical paradigm for addressing this challenge; however, its widespread realization is limited by noise and the restricted scalability of current quantum hardware. Achieving efficient simulations on Noisy Intermediate-Scale Quantum (NISQ) devices and forthcoming Fault-Tolerant Application-Scalable Quantum (FASQ) systems demands a detailed understanding of how computational resources scale with molecular complexity and fermion-to-qubit encoding schemes. In this study, resource requirements for VQE implementations employing the Unitary Coupled Cluster Singles and Doubles (UCCSD) ansatz are systematically analyzed. The molecular Hamiltonian is formulated in second quantization and mapped to qubit operators through the Jordan-Wigner (JW), Bravyi-Kitaev (BK), and Parity (Pa) transformations. Hamiltonian reduction strategies, including Z2 tapering and frozen-core approximations, are examined to assess their effect on quantum resource scaling. The analysis reveals that appropriate transformations, when combined with symmetry-based reductions, can substantially reduce qubit counts by up to ≈50% and quantum gate counts by up to ≈45× for the representative set of molecular systems under study. This provides practical insights for executing chemically relevant simulations on NISQ and FASQ hardware.
@article{ksv2025resest, author = {K. S. V., Anurag and Patra, Ashish Kumar and Ghevade, Vikas Dattatraya and P., Sai Shankar and Bhat, Ruchika and V., Raghavendra and Maitra, Rahul and G., Jaiganesh}, title = {Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions}, doi = {10.48550/arXiv.2512.01605}, url = {https://doi.org/10.48550/arXiv.2512.01605}, urldate = {2025-12-01}, month = dec, year = {2025}, journal = {arXiv}, publisher = {arXiv}, note = {Preprint}, } - Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding FrameworkAshish Kumar Patra, Anurag K. S. V., Sai Shankar P., and 4 more authorsarXiv, Nov 2025Preprint
The accurate treatment of electron correlation in extended molecular systems remains computationally challenging using classical electronic structure methods. Hybrid quantum–classical algorithms offer a potential route to overcome these limitations; however, their practical deployment on existing quantum computers requires strategies that both reduce problem size and mitigate hardware noise. In this work, we combine Density Matrix Embedding Theory (DMET) with Sample-based Quantum Diagonalization (SQD) to compute ground-state energies of a set of natural ligand-like molecules in the minimal Slater Type Orbital (STO-3G) basis set. DMET provides a systematic fragmentation of a molecule into embedded impurity subproblems, while SQD enables construction and classical diagonalization of reduced configuration spaces through quantum sampling enhanced by iterative configuration recovery. The resulting embedded Hamiltonians are solved on IBM’s Eagle R3 superconducting quantum hardware (IBM Sherbrooke). The DMET-SQD energies obtained for all systems considered exhibit strong agreement with DMET-FCI benchmark values within chemical accuracy (1 kcal/mol). These results demonstrate that sample-based quantum methods, when integrated with a robust embedding framework, can reliably extend quantum computation towards simulation of chemically relevant molecular systems, showcasing potential applications in the field of drug discovery.
@article{patra2025dmetsqdibm, author = {Patra, Ashish Kumar and K. S. V., Anurag and P., Sai Shankar and Bhat, Ruchika and V., Raghavendra and Maitra, Rahul and G., Jaiganesh}, title = {Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding Framework}, doi = {10.48550/arXiv.2511.22158}, url = {https://doi.org/10.48550/arXiv.2511.22158}, urldate = {2025-11-27}, month = nov, year = {2025}, journal = {arXiv}, publisher = {arXiv}, note = {Preprint}, } - Survey of Quantum Algorithms: Foundations, Frameworks and ApplicationsAuthorea, Nov 2025Preprint
Quantum computing has transformed computational paradigms through its unique principles and algorithms. This paper provides a systematic overview of quantum algorithms, their application-based classification, and their industrial relevance. It surveys the broader areas of the field from a chronological perspective and highlights significant advances. The study also identifies emerging trends and key research directions in quantum algorithm development.
@article{patra2025qalgo, author = {Patra, Ashish Kumar and K. S. V., Anurag and Ghevade, Vikas Dattatraya and P., Sai Shankar and Bhat, Ruchika and Saxena, Amit and V., Raghavendra and G., Jaiganesh}, title = {Survey of Quantum Algorithms: Foundations, Frameworks and Applications}, doi = {10.22541/au.176341037.72812424/v1}, url = {https://doi.org/10.22541/au.176341037.72812424/v1}, urldate = {2025-11-23}, month = nov, year = {2025}, journal = {Authorea}, publisher = {Wiley}, note = {Preprint}, } - Potential Energy Surface Scan of n-butane Using Various Quantum Chemistry SoftwareAuthorea, Jul 2025Preprint
A potential energy surface (PES) scan is central to numerous problems in quantum chemistry, including identifying reaction mechanisms, reaction kinetics, transition states, activation barrier, etc. This work details the potential energy surface scan of the dihedral angle of the molecule n-butane using various open-source/freeware computational quantum chemistry software, including CP2K, GAMESS, NWChem, ORCA, Psi4, and PySCF. The input preparation, adopted methodology, execution flow, and results are discussed in detail, equipping readers with the necessary hands-on knowledge of computational tools to perform electronic structure calculations through a dihedral scan.
@article{ksv2025pes, author = {K. S. V., Anurag and Patra, Ashish Kumar and Anand, Chinmay and Ghevade, Vikas Dattatraya and V., Raghavendra and Bhat, Ruchika and G., Jaiganesh}, title = {Potential Energy Surface Scan of n-butane Using Various Quantum Chemistry Software}, doi = {10.22541/au.174624847.78353339/v2}, url = {https://doi.org/10.22541/au.174624847.78353339/v2}, urldate = {2025-09-14}, month = jul, year = {2025}, journal = {Authorea}, publisher = {Wiley}, note = {Preprint}, }
2024
- FPGA-based Toeplitz Strong Extractor for Quantum Random Number GeneratorsIn 2024 IEEE 5th India Council International Subsections Conference (INDISCON), Aug 2024Conference Paper
Quantum Random Number Generators (QRNGs) serve as high-entropy sources for Quantum Key Distribution (QKD) systems. However, the raw data from these quantum sources require post-processing to achieve a nearly uniform distribution. This work presents a state-of-the-art implementation of the Toeplitz Strong Extractor on an FPGA, achieving a benchmark extraction speed of 26.57 Gbps. A detailed implementation flow of the post-processing on the FPGA is provided, along with the execution speeds obtained for different randomness extraction ratios. Raw data from an in-house phase noise-based QRNG is processed on the FPGA using this implementation, and the output is validated using the NIST STS 2.1.2 statistical randomness test suite.
@inproceedings{chouhan2024fpgaTSE, author = {Chouhan, Shubham and K. S. V., Anurag and Raghavan, G. and P., Kanaka Raju}, booktitle = {2024 IEEE 5th India Council International Subsections Conference (INDISCON)}, title = {FPGA-based Toeplitz Strong Extractor for Quantum Random Number Generators}, month = aug, year = {2024}, volume = {}, number = {}, pages = {1-5}, doi = {10.1109/INDISCON62179.2024.10744392}, url = {https://doi.org/10.1109/INDISCON62179.2024.10744392}, urldate = {2025-09-14}, note = {Conference Paper}, } - High-efficiency Implementation of Toeplitz Strong Extractor for PRNG and QRNG Output on CPU/GPU Hardware SystemsAnurag K. S. V., G. Raghavan, and Kanaka Raju P.Physica Scripta, Jun 2024Journal Paper
Random Number Generators (RNGs) are devices whose utility spans from cryptography to gambling. Depending on the source of the random seed, RNGs are classified as Pseudo-Random Number Generators (PRNGs), which are based on mathematical algorithms, True Random Number Generators (TRNGs) sourced through seemingly random physical processes, and finally, Quantum Random Number Generators (QRNGs) which harness the intrinsic randomness of measured outcomes of quantum states. To ensure that the output of a QRNG is private and nearly uniform, the raw data undergoes a strong extraction process such as Toeplitz or Trevisan Hashing. The extraction process needs to be extremely efficient to achieve high-speed random number generation. The present work demonstrates state-of-the-art methods for performing information-theoretically provable randomness extraction using variations of the Toeplitz Hashing algorithm. These algorithms are implemented on various hardware for comprehensive analysis. Subsequently, these methods are applied to two raw data sets from a PRNG source and a quantum source. A new benchmark of 19.5 Gbps for Randomness Extraction using the Fast Fourier Transform-based Toeplitz Strong Extractor is demonstrated in this work. The implementation of the algorithm on a GPU-based system demonstrates notably enhanced speed, marking a significant leap beyond the existing state-of-the-art implementations.
@article{ksv2024gpuTSE, author = {K. S. V., Anurag and Raghavan, G. and P., Kanaka Raju}, pages = {075115}, publisher = {IOP Publishing}, title = {High-efficiency Implementation of Toeplitz Strong Extractor for PRNG and QRNG Output on CPU/GPU Hardware Systems}, doi = {10.1088/1402-4896/ad587f}, url = {https://doi.org/10.1088/1402-4896/ad587f}, urldate = {2025-09-14}, volume = {99}, month = jun, year = {2024}, journal = {Physica Scripta}, note = {Journal Paper}, } - Development of a High-Speed Quantum Random Number Generator Harvesting Quantum Phase FluctuationsAnurag K. S. V., Kanaka Raju P., and G. RaghavanIn International Conference on Quantum Technologies and Applications 2024 (ICQTA24), Feb 2024Poster Presentation
This poster presents the development of a high-speed, low-cost, and reliable quantum random number generator (QRNG) based on phase noise, suitable for quantum key distribution and cryptographic applications. It details the experimental setup using a laser, delayed Mach-Zehnder interferometer (MZI), photo diode, and oscilloscope, achieving a raw data generation rate of 2.0 Gbps. Post-processing techniques, including matrix multiplication and Fast Fourier Transform-based Toeplitz hashing, ensure the output passes all 16 NIST SP 800-22 randomness tests, verifying uniformity and unpredictability.
@inproceedings{ksv2024qrng, author = {K. S. V., Anurag and P., Kanaka Raju and Raghavan, G.}, title = {Development of a High-Speed Quantum Random Number Generator Harvesting Quantum Phase Fluctuations}, booktitle = {International Conference on Quantum Technologies and Applications 2024 (ICQTA24)}, year = {2024}, month = feb, address = {MAHE, Manipal, KA, India}, organization = {School of Quantum Technology, Defence Institute of Advanced Technology}, doi = {10.13140/RG.2.2.22320.98569}, url = {https://doi.org/10.13140/RG.2.2.22320.98569}, note = {Poster Presentation}, } - Implementation and Evaluation of Toeplitz Strong Extractor for Post-Processing of QRNGs on Various Hardware SystemsAnurag K. S. V., G. Raghavan, and Kanaka Raju P.In International Conference on Quantum Technologies and Applications 2024 (ICQTA24), Feb 2024Poster Presentation
This poster presents the implementation and benchmarking of Toeplitz strong extractors for QRNG post-processing across multiple hardware platforms. By comparing matrix-multiplication and FFT-based Toeplitz hashing, we demonstrate significant gains in speed and memory efficiency when extracting information-theoretically secure quantum randomness. Our optimized FFT implementation achieves up to 3.7 Gbps on an Nvidia Quadro GV100 GPU, confirming the practicality of high-throughput, secure randomness extraction for modern QRNG systems.
@inproceedings{ksv2024pp, author = {K. S. V., Anurag and Raghavan, G. and P., Kanaka Raju}, title = {Implementation and Evaluation of Toeplitz Strong Extractor for Post-Processing of QRNGs on Various Hardware Systems}, booktitle = {International Conference on Quantum Technologies and Applications 2024 (ICQTA24)}, year = {2024}, month = feb, address = {MAHE, Manipal, KA, India}, organization = {School of Quantum Technology, Defence Institute of Advanced Technology}, doi = {10.13140/RG.2.2.33226.17606}, url = {https://doi.org/10.13140/RG.2.2.33226.17606}, note = {Poster Presentation}, }
2022
- Temporal and Correlational Analysis of Air Pollution and Covid-19 across Major Metropolis in IndiaAnurag K. S. V. and B. Bhaskara RaoInternational Journal of Innovative Technology and Exploring Engineering, Oct 2022Journal Paper
This study aimed to check the temporal variations in Air Pollution levels using Air Quality Index in major cities spanning geographically across India and understand the correlation between the severity of Covid-19 and the concentrations of the six key air pollutants. The study considered a tenure between May-June 2020 when there was a drastic shift in human behavior due to Unlock period in India. It employed Spearman’s Rank Correlation Coefficient, which better understands monotonic function association between two variables for correlation. The study successfully established statistical evidence of improvement in the air quality of 29% (average) in May and June of 2020 compared to 2019 in the cities under study. A significant correlation was also established between air pollution and covid-19 across various cities in India, with Delhi and Mumbai exhibiting a weak negative correlation. At the same time, Hyderabad and Bengaluru showed a moderate negative correlation. On the other hand, the city of Chennai implied a strong positive correlation between air pollution and Covid-19.
@article{ksv2022airpollution, author = {K. S. V., Anurag and Rao, B. Bhaskara}, pages = {1-6}, publisher = {Blue Eyes Intelligence Engineering and Sciences Publication}, title = {Temporal and Correlational Analysis of Air Pollution and Covid-19 across Major Metropolis in India}, doi = {10.35940/ijitee.k9277.10111122}, url = {http://doi.org/10.35940/ijitee.K9277.10111122}, urldate = {2025-09-14}, volume = {11}, month = oct, year = {2022}, journal = {International Journal of Innovative Technology and Exploring Engineering}, note = {Journal Paper}, }
