Searcharxiv⌕ Search

arXiv subjects

Saurabh Shivpuje

Publications and source records attributed to Saurabh Shivpuje.

4 recordsLinked to original sources

Sample-based Quantum Diagonalization Methods for Modeling the Photochemistry of Diazirine and Diazo Compounds

Diazirines and diazo compounds are widely employed as photoreactive precursors for generating carbenes, key intermediates in chemical biology and materials science. However, computationally modeling their reaction pathways remains challenging due to a need for large active spaces and the requirement to accurately capture excited-state surfaces along with transition states and conical intersections. In this work, we utilize a hybrid quantum-classical workflow for investigating carbene formation in representative diazirine-diazomethane systems. Our approach leverages Sample-based Quantum Diagonalization (SQD) and its extended variant (Ext-SQD) for ground and excited-state analysis, combined with classical tools for geometry optimization, active-space selection, and diagnostic evaluation. Quantum computations were carried out on superconducting quantum processors, and results for both aliphatic and aryl-substituted diazirine-diazomethane pairs were benchmarked against established classical methods, including DFT, CCSD, CASCI, and SCI. SQD achieves accuracy surpassing the chemical accuracy threshold for nearly all stationary points on the potential energy surface of parent diazirine relative to the CASCI(12,10) reference, and remains close to chemical accuracy for phenyl-substituted diazirine in a (30,30) active space, with an average deviation of 1.1 kcal/mol relative to the SCI benchmark. SQD closely follows CASCI and SCI trends, showing consistent agreement. The findings demonstrate the promise of quantum computing frameworks in modeling photochemical transformations of electronically complex and pharmacologically relevant molecules.

physics.chem-ph↗

Towards secondary structure prediction of longer mRNA sequences using a quantum-centric optimization scheme

Accurate prediction of mRNA secondary structure is critical for understanding gene expression, translation efficiency, and advancing mRNA-based therapeutics. However, the combinatorial complexity of possible foldings, especially in long sequences, poses significant computational challenges for classical algorithms. In this work, we propose a scalable, quantum-centric optimization framework that integrates quantum sampling with classical post-processing to tackle this problem. Building on a Quadratic Unconstrained Binary Optimization (QUBO) formulation of the mRNA folding task, we develop two complementary workflows: a Conditional Value at Risk (CVaR)-based variational quantum algorithm enhanced with gauge transformations and local search, and an Instantaneous Quantum Polynomial (IQP) circuit-based scheme where training is done classically and sampling is delegated to quantum hardware. We demonstrate the effectiveness of these approaches using IBM quantum processors, solving problem instances with up to 156 qubits and circuits containing up to 950 nonlocal gates, corresponding to mRNA sequences of up to 60 nucleotides. Additionally, we validate scalability of the CVaR algorithm on a tensor network simulator, reaching up to 354 qubits in noiseless settings. These results demonstrate the growing practical capabilities of hybrid quantum-classical methods for tackling large-scale biological optimization problems.

quant-ph↗

Designing variational ansatz for quantum-enabled simulation of non-unitary dynamical evolution -- an excursion into Dicke supperradiance

Adaptive Variational Quantum Dynamics (AVQD) algorithms offer a promising approach to providing quantum-enabled solutions for systems treated within the purview of open quantum dynamical evolution. In this study, we employ the unrestricted vectorization variant of AVQD to simulate and benchmark various non-unitarily evolving systems. We exemplify how construction of an expressible ansatz unitary and the associated operator pool can be implemented to analyze examples such as the Fenna Matthews Olson complex (FMO) and even the permutational invariant Dicke model of quantum optics. We furthermore show an efficient decomposition scheme for the ansatz used, which can extend its applications to a wide range of other open quantum system scenarios in near future. In all cases the results obtained are in excellent agreement with exact numerical computations which bolsters the effectiveness of this technique. Our successful demonstrations pave the way for utilizing this adaptive variational technique to study complex systems in chemistry and physics, like light harvesting devices, thermal, and opto mechanical switches, to name a few.

quant-ph↗

Simulating Open Quantum System Dynamics on NISQ Computers with Generalized Quantum Master Equations

We present a quantum algorithm based on the Generalized Quantum Master Equation (GQME) approach to simulate open quantum system dynamics on noisy intermediate-scale quantum (NISQ) computers. This approach overcomes the limitations of the Lindblad equation, which assumes weak system-bath coupling and Markovity, by providing a rigorous derivation of the equations of motion for any subset of elements of the reduced density matrix. The memory kernel resulting from the effect of the remaining degrees of freedom is used as input to calculate the corresponding non-unitary propagator. We demonstrate how the Sz.-Nagy dilation theorem can be employed to transform the non-unitary propagator into a unitary one in a higher-dimensional Hilbert space, which can then be implemented on quantum circuits of NISQ computers. We validate our quantum algorithm as applied to the spin-boson benchmark model by analyzing the impact of the quantum circuit depth on the accuracy of the results when the subset is limited to the diagonal elements of the reduced density matrix. Our findings demonstrate that our approach yields reliable results on NISQ IBM computers.

quant-ph↗