Searcharxiv⌕ Search

arXiv subjects

Hamed Mohammadbagherpoor

Publications and source records attributed to Hamed Mohammadbagherpoor.

17 recordsLinked to original sources

Quantum-Enhanced QSAR for DYRK1A: Evaluating Complementary and Utility QPU-Derived Molecular Representations

In drug discovery, hit identification selects a limited set of compounds for experimental evaluation from a larger collection of candidates. Because laboratory screening capacity is limited, that choice determines which chemical series continue into further investigation. A hit that is not assayed does not enter confirmation or the analog series, and that chemical series is not opened. For the DYRK1A kinase, the same test molecules were scored from a tabular representation of molecular descriptors and from a vector measured on a quantum processor, with the same RBF-SVM. The question is whether the two models propose the same set for experimental evaluation: they propose different compounds. The model on the vector measured on the quantum processor includes compounds that the tabular representation leaves out, and among them are already-labeled actives. The tabular representation includes actives that the vector measured on the quantum processor leaves out. What is reported is that set: who enters, with what label, and whether published chemistry already mentions it. No formal quantum advantage is claimed, nor a mechanism for why the two vectors separate differently. Those compounds fall within the neighborhood that both representations already cover; what changes is which model marks them active. From that follows the cost of predictive disagreement: each model would send a different chemical series to experimental evaluation.

quant-ph↗

Improving Quantum Recurrent Neural Networks with Amplitude Encoding

Recurrent Neural Networks (RNNs) are widely used to model complex temporal dependencies in sequential data. Quantum Recurrent Neural Networks (QRNNs) extend this idea to quantum machine learning by using quantum circuits inspired by classical recurrent architectures. In this paper, we propose three modifications to existing QRNN implementations that improve performance, generalization, and circuit efficiency. First, we introduce a simple preprocessing technique that augments amplitude encoded inputs with their prenormalized magnitudes, improving generalization on two financial data sets. Second, we show that a trained model can achieve comparable results with an approximate feature map rather than an expensive exact state preparation circuit. Third, we present a novel QRNN circuit architecture that is mathematically equivalent to the original model on ideal processors, but significantly reduces circuit depth. We demonstrate how these techniques can be put together to improve the performance of a QRNN when making predictions on real world financial data sets.

quant-ph↗

Benchmarking Ansatze for Pauli Correlation Encoding in the Maximum Independent Set Problem

The increasing complexity of 5G and emerging 6G wireless networks has intensified the need for scalable optimization techniques capable of addressing computationally challenging combinatorial problems. While quantum optimization offers a promising alternative, current near-term quantum hardware remains limited by qubit availability, noise, and scalability constraints. Pauli Correlation Encoding (PCE) has emerged as a qubit-efficient optimization framework that addresses these challenges through polynomial variable compression. However, the impact of compression on representability and solution recovery remains poorly understood. In this work, we investigate the hypothesis that increasing compression ratios introduce representability constraints arising from algebraic closure relationships among encoded Pauli observables. Using Maximum Independent Set benchmark problems, we evaluate multiple PCE ansatz designs and compression ratios. We find that ansatz selection is critical to both solution quality and feasibility, with two ansatz families consistently outperforming alternatives and achieving approximation ratios approaching 0.9. Furthermore, increasing circuit repetitions provides limited benefit and can degrade performance. Most notably, reducing compression by increasing the number of available qubits significantly improves raw solution quality, while post-processed performance remains comparatively stable. These findings suggest that representability effects play an important role in compressed PCE encodings and provide new insight into the relationship among compression, ansatz design, decoding, and solution quality in scalable quantum optimization.

quant-ph↗

Sample-based quantum diagonalization approach for open-shell transition-metal complexes in gas and implicit-solvent

Open-shell $3d$ transition-metal complexes pose a stringent challenge for correlated electronic-structure methods because near-degenerate metal $d$ orbitals give rise to competing spin states and oxidation-state-dependent charge transfer, while solvation can reshape the relative stability of the resulting electronic configurations. Building on prior demonstrations of open-shell sample-based quantum diagonalization (SQD) for light-atom systems and, separately, closed-shell SQD coupled to the integral-equation-formalism polarizable continuum model (IEF-PCM), we combine these capabilities through an open-shell SQD--IEF-PCM framework and apply it to the octahedrally coordinated $\mathrm{[Co(H_2O)_5CO_2]^{2+/3+}}$ complex, spanning the Co(III) singlet and quintet and Co(II) doublet and quartet states along a metal--ligand dissociation coordinate. Using quantum samples collected on an IBM Heron processor and active spaces of up to 50 qubits, SQD closely reproduces coupled-cluster and heat-bath configuration-interaction benchmarks within the same active spaces in both gas phase and implicit solvent; for high-spin quintet $\mathrm{[Co(H_2O)_5CO_2]^{3+}}$, it additionally resolves an avoided crossing associated with internal charge transfer that is absent in the corresponding singlet and in the lower oxidation state, while IEF-PCM suppresses this crossover by preferentially stabilizing the dissociation channel leading to neutral CO$_2$. To our knowledge, this work provides the first hardware demonstration of SQD for an open-shell 3d transition-metal complex with discrete metal-centered d-orbital chemistry, and the first application of open-shell SQD in a dielectric continuum, establishing a quantum-centric framework for transition-metal chemistry in regimes where spin-state energetics, charge transfer, and environmental response are strongly coupled.

quant-ph↗

Circuit Depth Reduction for Executable Hamiltonian Dynamics of Covalent Inhibitor Reactivity on Quantum Hardware

Quantum chemistry applications in the noisy intermediate-scale quantum era require end-to-end approaches that balance algorithmic fidelity with practical executability on existing hardware. We present an end-to-end Hamiltonian dynamics case study for predicting the reactivity of pharmaceutically relevant covalent inhibitors containing sulfonyl fluoride warheads, using a quantum-centric data-driven research and development framework that combines Hamiltonian time evolution with classical machine learning. To make such simulations executable on current quantum processors, we introduce a systematic circuit reduction strategy based on Hamiltonian term truncation with observable error bounds, Clifford Decomposition and Transformation, and hardware-aware transpilation. Across representative molecular fragments, this approach achieves circuit depth reductions of up to 28.5x under all-to-all connectivity assumptions and up to 15.5x on IBM Heron-class architectures. For an eight-qubit Hamiltonian dynamics simulation, a transpiled instruction set architecture (ISA) circuit depth of 1330 is rendered executable through middleware-enabled circuit decomposition, enabling the execution of sub-circuits with depths up to 371 and containing up to 216 two-qubit gates on real hardware. We evaluate the impact of circuit reduction on downstream reactivity prediction accuracy and show that chemically meaningful predictions can be retained despite aggressive circuit simplifications, clarifying the trade-offs that govern practical quantum chemistry workflows on near-term quantum systems.

quant-ph↗

Quantum-enhanced satellite image classification

We demonstrate the application of a quantum feature extraction method to enhance multi-class image classification for space applications. By harnessing the dynamics of many-body spin Hamiltonians, the method generates expressive quantum features that, when combined with classical processing, lead to quantum-enhanced classification accuracy. Using a strong and well-established ResNet50 baseline, we achieved a maximum classical accuracy of 83%, which can be improved to 84% with a transfer learning approach. In contrast, applying our quantum-classical method the performance is increased to 87% accuracy, demonstrating a clear and reproducible improvement over robust classical approaches. Implemented on several of IBM's quantum processors, our hybrid quantum-classical approach delivers consistent gains of 2-3% in absolute accuracy. These results highlight the practical potential of current and near-term quantum processors in high-stakes, data-driven domains such as satellite imaging and remote sensing, while suggesting broader applicability in real-world machine learning tasks.

quant-ph↗

On Quantum and Quantum-Inspired Maximum Likelihood Estimation and Filtering of Stochastic Volatility Models

Stochastic volatility models are the backbone of financial engineering. We study both continuous time diffusions as well as discrete time models. We propose two novel approaches to estimating stochastic volatility diffusions, one using Quantum-Inspired Classical Hidden Markov Models (HMM) and the other using Quantum Hidden Markov Models. In both cases we have approximate likelihood functions and filtering algorithms that are easy to compute. We show that the non-asymptotic bounds for the quantum HMM are tighter compared to those with classical model estimates.

quant-ph↗

An Enhanced Hybrid HHL Algorithm

We present a classical enhancement to improve the accuracy of the Hybrid variant (Hybrid HHL) of the quantum algorithm for solving linear systems of equations proposed by Harrow, Hassidim, and Lloyd (HHL). We achieve this by using higher precision quantum estimates of the eigenvalues relevant to the linear system, and a new classical step to guide the eigenvalue inversion part of Hybrid HHL. We show that eigenvalue estimates with just two extra bits of precision result in tighter error bounds for our Enhanced Hybrid HHL compared to HHL. Our enhancement reduces the error of Hybrid HHL by an average of 57 percent on an ideal quantum processor for a representative sample of 2x2 systems. On IBM Torino and IonQ Aria-1 hardware, we see that the error of Enhanced Hybrid HHL is on average 13 percent and 20 percent (respectively) less than that of HHL for the same set of systems.

quant-ph↗

Hybrid Quantum Graph Neural Network for Molecular Property Prediction

To accelerate the process of materials design, materials science has increasingly used data driven techniques to extract information from collected data. Specially, machine learning (ML) algorithms, which span the ML discipline, have demonstrated ability to predict various properties of materials with the level of accuracy similar to explicit calculation of quantum mechanical theories, but with significantly reduced run time and computational resources. Within ML, graph neural networks have emerged as an important algorithm within the field of machine learning, since they are capable of predicting accurately a wide range of important physical, chemical and electronic properties due to their higher learning ability based on the graph representation of material and molecular descriptors through the aggregation of information embedded within the graph. In parallel with the development of state of the art classical machine learning applications, the fusion of quantum computing and machine learning have created a new paradigm where classical machine learning model can be augmented with quantum layers which are able to encode high dimensional data more efficiently. Leveraging the structure of existing algorithms, we developed a unique and novel gradient free hybrid quantum classical convoluted graph neural network (HyQCGNN) to predict formation energies of perovskite materials. The performance of our hybrid statistical model is competitive with the results obtained purely from a classical convoluted graph neural network, and other classical machine learning algorithms, such as XGBoost. Consequently, our study suggests a new pathway to explore how quantum feature encoding and parametric quantum circuits can yield drastic improvements of complex ML algorithm like graph neural network.

quant-ph↗

Quantum Computational Algorithms for Derivative Pricing and Credit Risk in a Regime Switching Economy

Quantum computers are not yet up to the task of providing computational advantages for practical stochastic diffusion models commonly used by financial analysts. In this paper we introduce a class of stochastic processes that are both realistic in terms of mimicking financial market risks as well as more amenable to potential quantum computational advantages. The type of models we study are based on a regime switching volatility model driven by a Markov chain with observable states. The basic model features a Geometric Brownian Motion with drift and volatility parameters determined by the finite states of a Markov chain. We study algorithms to estimate credit risk and option pricing on a gate-based quantum computer. These models bring us closer to realistic market settings, and therefore quantum computing closer the realm of practical applications.

quant-ph↗

Evaluation of Parameterized Quantum Circuits with Cross-Resonance Pulse-Driven Entanglers

Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for VQAs is crucial to their overall performance, especially on near-term devices. In this paper, we utilize pulse-level access to quantum machines and our understanding of their two-qubit interactions to optimize the design of two-qubit entanglers in a manner suitable for VQAs. Our analysis results show that pulse-optimized ansatze reduce state preparation times by more than half, maintain expressibility relative to standard PQCs, and are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Our algorithm performance results, executed on IBM Quantum hardware, demonstrate that our pulse-optimized PQC configurations are more capable of solving MaxCut and Chemistry problems compared to a standard configuration.

quant-ph↗

Exploring Airline Gate-Scheduling Optimization Using Quantum Computers

This paper investigates the application of quantum computing technology to airline gate-scheduling quadratic assignment problems (QAP). We explore the quantum computing hardware architecture and software environment required for porting classical versions of these type of problems to quantum computers. We discuss the variational quantum eigensolver and the inclusion of space-efficient graph coloring to the Quadratic Unconstrained Binary Optimization (QUBO). These enhanced quantum computing algorithms are tested with an 8 gate and 24 flight test case using both the IBM quantum computing simulator and a 27 qubit superconducting transmon IBM quantum computing hardware platform.

quant-ph↗

Closed-Loop Control of a Magnetically Actuated Fiber-Coupled Laser for Computer-Assisted Laser Microsurgery

Patient outcomes in the medical field are improving through the use and incorporation of robotics technology and laser physics, e.g., the use of optical fibers and lasers in micro-surgery. This paper describes the design and implementation of a new optical fiber laser micro-surgery system, one that is the first to use closed-loop feedback control. In this computerassisted laser scanning tool the laser beam is controlled by four magnetic actuators. After attaching permanent magnets to the free end of the optical fiber, it is the control of these four magnets that produces an accurate laser scanning system, one suited to micro-surgery applications. The interaction between the electromagnetic fields generated by the external magnetic coils and the flux of the internal permanent magnets, produces the control torques required to produce the desired movement of the optic fiber. The tracking error of the optic fiber is compensated for by using a photo-detector sensor as the feedback transducer in the control system. The magnetic torque bends the optical fiber and the feedback from the photodetector gives automated control and high-speed laser scanning of the fiber tip. The simulation and the experimental results are accurate and are co-related.

physics.med-ph↗

Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal solution for graph coloring problems. However, this naive approach can increase the computation cost exponentially as the graph size and the number of colors increase. To mitigate such intolerable overhead, we investigate the methods to take the advantages of quantum computing properties to find a solution for multi-coloring graph problems in polynomial time. We utilize the variational quantum eigensolver (VQE) technique and quantum approximate optimization algorithm (QAOA) to find solutions for three combinatorial applications by both transferring each problem model to the corresponding Ising model and by using the calculated Hamiltonian matrices. Our results demonstrate that VQE and QAOA algorithms can find one of the best solutions for each application. Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time.

quant-ph↗

An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.

quant-ph↗

Experimental Challenges of Implementing Quantum Phase Estimation Algorithms on IBM Quantum Computer

Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum sampling algorithms, and finding the eigenvalues of unitary matrices. Kitaev's algorithm and QPE algorithms using inverse Quantum Fourier transform were proposed and widely used by researchers as a key component for their quantum algorithms. In this paper, we explore the experimental challenges of QPE algorithms on Noisy Intermediate-Scale Quantum (NISQ) computers by implementing various QPE algorithms on the state-of-the-art IBM quantum computer. Our experimental results demonstrate that the accuracy of finding the phase using these algorithms are severely constrained by NISQ's physical characteristics such as coherence time and error rates. To mitigate such physical limitations, we propose modified solutions of these algorithms by reducing the number of control gates and phase shift operations. Our experimental results showed that our solutions can significantly increase the accuracy of the finding phase in near-term quantum computers.

quant-ph↗

A Modified DTC with Capability of Regenerative Braking Energy in BLDC driven Electric Vehicles Using Adaptive Control Theory

This paper represents a novel regenerative braking approach for the Electric Vehicles. The proposed method solves the short-range problem which is corresponding to the charge of the battery pack. The DTC switching algorithm has been modified to recover the electrical energy from Electrical Vehicle (EV), driven by Brushless DC motor, without using the additional power converter or the other electrical energy storage devices. During regenerative braking process, different switching pattern is applied to the inverter to convert the mechanical energy to the electrical energy through the reverse diodes. This switching pattern is different from the normal operation due to the special arrangement of voltage vectors which is considered to convert the mechanical energy to electrical energy. The state of charge of the battery is used as a performance indicator of the method. Simultaneously, a model reference adaptive system has been designed to tune the system parameters. Several simulations are carried out to validate the performance and effectiveness of the proposed methods. The results show the high capability and performance of the designed method.

eess.SY↗