Searcharxiv⌕ Search

arXiv subjects

Mostafizur Rahaman Laskar

Publications and source records attributed to Mostafizur Rahaman Laskar.

6 recordsLinked to original sources

Quantum Interference-Induced Bhattacharyya Distance

We propose a quantum distance measure between probability distributions encoded in quantum states based on the fragility of quantum interference under entangling evolution. The Quantum Interference-Induced Bhattacharyya Distance (QIBD) is defined through a single-ancilla interferometric circuit in which an interaction Hamiltonian generates correlation-dependent phases that modulate interference visibility. When the interaction vanishes, QIBD reduces to the classical Bhattacharyya distance; however, for entangling interactions, it cannot be expressed as a function of fidelity alone. Numerical simulations demonstrate that QIBD responds to correlation structure in ways that overlap-based measures do not, suggesting potential utility in contexts where interaction-aligned correlations are physically relevant.

quant-ph↗

Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers

We introduce a Basis Adaptive (BA) algorithm for hybrid quantum-classical simulation of correlated quantum many-body systems. Starting from a small set of physically motivated bitstrings, the algorithm iteratively applies a single-step first-order Trotterized circuit on a quantum processor, filters the sampled configurations by enforcing $U(1)$ spin conservation and lattice reflection symmetry, and classically diagonalizes the Hamiltonian in the resulting reduced Hilbert space. This design avoids the variational optimization overhead of VQE, the deep coherent circuits required by QPE, and the symmetry-violating subspaces that arise in SKQD. The ground-state energy error is bounded analytically by $\sqrt{8}\,\|H\|\left(1-\sqrt{α_{D_T}}\right)^{1/2}$, where $α_{D_T}$ is the probability weight captured by the $D_T$ sampled basis states. This bound connects algorithm performance directly to ground-state sparsity and explains the observed accuracy hierarchy across different phases. Benchmarked on the spin-$1/2$ Heisenberg XXZ chain (up to $N=62$ qubits on the IBM Heron processor), the algorithm achieves a $3.5\%$ energy error in the gapped Neel phase ($Δ=2.0$) and below $0.5\%$ at the ferromagnetic boundary ($Δ=-1.0$). The accuracy degrades to $28.7\%$ in the strongly quasi-long-range-ordered regime ($Δ=0.5$). Spin-spin correlation functions are reproduced across all regimes, confirming that symmetry-filtered real-time sampling provides a practical and noise-resilient pathway to ground-state properties on near-term quantum hardware.

cond-mat.str-el↗

Physics-Informed Generative Machine Learning for Accelerated Quantum-centric Supercomputing

Quantum centric supercomputing (QCSC) framework, such as sample-based quantum diagonalization (SQD) holds immense promise toward achieving practical quantum utility to solve challenging problems. QCSC leverages quantum computers to perform the classically intractable task of sampling the dominant fermionic configurations from the Hilbert space that have substantial support to a target state, followed by Hamiltonian diagonalization on a classical processor. However, noisy quantum hardware produces erroneous samples upon measurements, making robust and efficient configuration-recovery strategies essential for a scalable QCSC pipeline. Toward this, in this work, we introduce PIGen-SQD, an efficiently designed QCSC workflow that utilizes the capability of generative machine learning (ML) along with physics-informed configuration screening via implicit low-rank tensor decompositions for accurate fermionic state reconstruction. The physics-informed pruning is based on a class of efficient perturbative measures that, in conjunction with hardware samples, provide a substantial overlap with the target state. This distribution induces an anchoring effect on the generative ML models to stochastically explore only the dominant sector of the Hilbert space for effective identification of additional important configurations in a self-consistent manner. Our numerical experiments performed on IBM Heron R2 quantum processors demonstrate this synergistic workflow produces compact, high-fidelity subspaces that substantially reduce diagonalization cost while maintaining chemical accuracy under strong electronic correlations. By embedding classical many body intuitions directly into the generative ML model, PIGen-SQD advances the robustness and scalability of QCSC algorithms, offering a promising pathway toward chemically reliable quantum simulations on utility-scale quantum hardware.

quant-ph↗

Entanglement for Pattern Learning in Temporal Data with Logarithmic Complexity: Benchmarking on IBM Quantum Hardware

Time series forecasting is foundational in scientific and technological domains, from climate modelling to molecular dynamics. Classical approaches have significantly advanced sequential prediction, including autoregressive models and deep learning architectures such as temporal convolutional networks (TCNs) and Transformers. Yet, they remain resource-intensive and often scale poorly in data-limited or hardware-constrained settings. We propose a quantum-native time series forecasting framework that harnesses entanglement-based parameterized quantum circuits to learn temporal dependencies. Our Quantum Time Series (QTS) model encodes normalized sequential data into single-qubit rotations and embeds temporal structure through structured entanglement patterns. This design considers predictive performance with logarithmic complexity in training data and parameter count. We benchmark QTS against classical models on synthetic and real-world datasets, including geopotential height fields used in numerical weather prediction. Experiments on the noisy backend and real IBM quantum hardware demonstrate that QTS can capture temporal patterns using fewer data points. Hardware benchmarking results establish quantum entanglement as a practical computational resource for temporal modelling, with potential near-term applications in nano-scale systems, quantum sensor networks, and other forecasting scenarios.

quant-ph↗

Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic Energy Operator

The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning quantum simulation and machine learning. However, the construction of large-scale quantum computers poses significant challenges, prompting the need for innovative and resource-efficient strategies. Traditional methods like phase estimation or variational algorithms come with certain limitations such as the use of classical optimization or complex quantum circuitry. One successful method is the Trotterization technique used for quantum simulation, specifically in atomic structure problems with a gate complexity of approximately O(n^2) for an n-qubit realization. In this work, we have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator as a diagonal unitary operator considering the first quantization level. The theoretical foundations of our approach are discussed, and experimental results are obtained on an IBM quantum machine. Our proposed method offers gate complexity in sub-quadratic polynomial with qubit size $n$ which is an improvement over previous work. Further, the fidelity improvement for the time evolution of the Gaussian wave packet has also been demonstrated.

quant-ph↗

A Proposed Quantum Hamiltonian Encoding Framework for Time Evolution Operator Design of Potential Energy Function

The exploration of potential energy operators in quantum systems holds paramount significance, offering profound insights into atomic behaviour, defining interactions, and enabling precise prediction of molecular dynamics. By embracing the Born-Oppenheimer picture, we delve into the intricate quantum evolution due to potential energy, facilitating accurate modelling and simulation of atomic phenomena with improved quantum fidelity. This research delves into time evolution operation due to potential energy functions for applications spanning quantum chemistry and condensed matter physics. Challenges in practical implementation, encompassing the formidable curse of dimensionality and intricate entangled interactions, are thoughtfully examined. Drawing upon seminal works, we lay a robust foundation for comprehensive investigations into potential energy landscapes with two proposed algorithms. In one methodology, we have shown a systematic decomposition of the potential energy function into Hadamard bases with composite construction of Pauli-Z, identity and RZ gates which can construct the unitary time evolution operator corresponding to the potential energy with a very high fidelity. The other method is a trade-off between complexity and fidelity, where we propose a novel quantum framework that can reduce the gate complexity from Θ(2n) to Θ(nCr ) (for some r < n). The proposed quantum algorithms are capable of efficiently simulating potential energy operators. The algorithms were implemented in simulators and IBM quantum hardware to prove their efficacy

quant-ph↗