SearcharxivSearch

arXiv subjects

Shreya Banerjee

Publications and source records attributed to Shreya Banerjee.

At least 19 recordsLinked to original sources

Evaluation of Small Vision-Language Models on Qualitative Mechanical Problems

Qualitative mechanical problem-solving (QMPS) refers to solving qualitative problems from the mechanical domain. Qualitative problems can be solved with minimal discipline-specific information, without any robust quantitative calculation, generally by using qualitative reasoning and commonsense knowledge. QMPS is a vital aspect of human intelligence that allows us to tackle a wide range of tasks, from simple everyday ones such as turning on a tap to complex tasks in highly demanding and well-paying jobs in various fields, e.g., emergency medicine, plumbing, driving, etc. Employers often use the Bennett Mechanical Comprehension Test (BMCT) to evaluate job candidates' ability to solve such problems. In this work, we assess two state-of-the-art multimodal models, Gemma-3 and Qwen-VL, on their ability to interpret mechanical problem images by eliciting a step-by-step chain of thought (CoT) and a final answer. Each image inherently encodes ground-truth qualitative facts, such as contact points in gears, support relations, and relative weights, which we use to evaluate each model's spatial and commonsense reasoning capabilities. We assess each chain for coherence, completeness, and logical progression to assess each model's thought process, and final answers are compared to verified solutions to measure accuracy.

cs.AI

Graph automorphisms to obtain Clifford symmetries in open and closed qudit models

In the recent article [arXiv:2605.18966], we demonstrated that finding Clifford symmetries can be mapped to a Graph Automorphism (GA) problem. Here, we provide an algorithm to obtain such symmetries on general qudit systems, that works on the principle of encoding Clifford invariants of a Hamiltonian onto properties of a graph. Labelling Hamiltonian terms as vertices, a permutation of such vertices that respects the Clifford invariants (a GA) is both a valid Clifford, and a symmetry up to phase correction checks. We test this on multiple physical models and discuss the scaling with respect to the number of qudits and Pauli strings, as well as various strategies for optimisation in different regimes. We further show that the graph automorphism representation of Clifford symmetries can be expanded to open quantum systems.

quant-ph

Attention-based optimizer for symmetry finding

Finding symmetries is crucial for understanding physical models. In this work, we present an optimization framework that searches Pauli symmetries of Hamiltonians, merging the fields of machine learning with automated symmetry finding. Built on a Set-Transformer architecture, our framework uses self-attention to encode the pairwise and higher-order correlations among the Pauli-Strings. The relations are then decoded as a candidate, which is further optimized with a custom commutation-based objective, and mapped to a symmetry of the input Hamiltonian. We apply our method to random Pauli Hamiltonians, periodic one and two dimensional transverse-field Ising model and the Toric code. We show that for physical Hamiltonians (Ising and Toric), our framework succeeds with near-deterministic probability while providing substantial advantage compared to state-of-the-art strategies. For random Pauli Hamiltonians, we estimate the required computational resources, specifically the number of parallel starts and the number of GPUs, to find a symmetry with high success probability under fixed design specifications.

quant-ph

Clifford symmetries in quantum many-body systems

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result of insightful thinking. In this work, we complement human ingenuity with an algorithm. We leverage the classically efficient Clifford group to find symmetries for arbitrary many-body Hamiltonians via a graph representation. We demonstrate our method on random and physical Hamiltonians, with instances of up to one thousand qubits and demonstrate how our approach can provide deeper understanding of the model.

quant-ph

Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair

We propose a hierarchical quantum approximate optimization framework for solving large-scale Vehicle Routing Problems (VRP) using Quantum Approximate Optimization Algorithm (QAOA). The method decomposes a VRP instance into balanced clusters of customer nodes. We formulate intra-cluster routing as Open loop Traveling Salesman Problems (OTSPs), and inter-cluster routing as a reduced VRP over the cluster representatives and depot. We then map the sub-problems to Ising Hamiltonians and solve with both standard and multi-angle QAOA variants at fixed depth p=3, and merge them to produce a routing path for the original VRP. Additionally, to improve solution feasibility and success probability, we introduce a polynomial-time post-processing protocol that samples candidate bit-strings from the QAOA output using a probability threshold and performs exhaustive local 1 and 2 bit-flip searches around these candidates. Benchmarking on 100 randomly generated 13-node, two-vehicle VRP instances, we show that the post-processed standard-QAOA implementation achieves high success rates and approximation ratios within 1.2-1.5 compared to classical optimizer (Gurobi) solutions, while requiring only 12 logical qubits per subproblem instead of 156 qubits for a direct edge-based encoding. These results provide a proof-of-concept demonstration that hierarchical decomposition, shallow QAOA, and local bit-flip repair can offer a scalable and resource-efficient pathway toward larger VRP instances on near-term quantum devices.

quant-ph

Discerning and quantifying high frequency activities in EEG under normal and epileptic conditions

We investigate the nature of the modifications in the temporal dynamics manifested in the high-frequency EEG spectra of the normal human brain in comparison to the diseased brain undergoing epilepsy. For this purpose, the Fourier reconstruction is efficaciously made use of after Welch's transform, which helped identify the relevant frequency components undergoing significant changes in the case of epilepsy. The temporal dynamics involved in the EEG signals and their associated variations showed a well-structured periodic pattern characterized by bi-stability and significant quantifiable structural changes during epileptic episodes. In particular, we demonstrate and quantify the precise differences in the high-frequency gamma band (40-100 Hz) present in EEG recordings from neurologically normal participants compared to those with epilepsy. The periodic modulations at two dominant frequencies around 50 Hz and 76 Hz in power spectral density are isolated from high frequency noise through the use of Welch's transform, pinpointing their collective behaviors through a phase-space approach. The reconstructed signals from these restricted frequency domains revealed oscillatory motions showing a bi-stability and bi-furcations with distinct differences between normal and seizure conditions. These differences in the phase space images, when analyzed through linear regression and SVM-based machine learning models, support a classification accuracy of around 94-95% between healthy and ictal states using a publicly available EEG dataset from the University of Bonn (Germany). The partial reconstruction of the dynamics as compared to the earlier studies of the full phase space accurately pinpointed the destabilization of the collective high-frequency synchronous behavior and their precise differences in the normal and diseased conditions, avoiding the other chaotic components of the EEG signals.

nlin.CD

A Novel Hybrid Deep Learning Technique for Speech Emotion Detection using Feature Engineering

Nowadays, speech emotion recognition (SER) plays a vital role in the field of human-computer interaction (HCI) and the evolution of artificial intelligence (AI). Our proposed DCRF-BiLSTM model is used to recognize seven emotions: neutral, happy, sad, angry, fear, disgust, and surprise, which are trained on five datasets: RAVDESS (R), TESS (T), SAVEE (S), EmoDB (E), and Crema-D (C). The model achieves high accuracy on individual datasets, including 97.83% on RAVDESS, 97.02% on SAVEE, 95.10% for CREMA-D, and a perfect 100% on both TESS and EMO-DB. For the combined (R+T+S) datasets, it achieves 98.82% accuracy, outperforming previously reported results. To our knowledge, no existing study has evaluated a single SER model across all five benchmark datasets (i.e., R+T+S+C+E) simultaneously. In our work, we introduce this comprehensive combination and achieve a remarkable overall accuracy of 93.76%. These results confirm the robustness and generalizability of our DCRF-BiLSTM framework across diverse datasets.

cs.SD

Evolution of Entanglement Witness of Dicke State under Noise and Error Mitigation

The experimental verification of multipartite entangled states is essential for advancing quantum information processing. Entanglement witnesses (EWs) provide a widely used and experimentally accessible approach for detecting genuinely multipartite entangled states. In this work, we theoretically derive the entanglement witness for the four-qubit Dicke state and experimentally evaluate it on two distinct IBM 127-qubit Quantum Processing Units (QPUs), namely ibm\_sherbrook and ibm\_brisbane. A negative expectation value of the witness operator serves as a sufficient condition for confirming genuine multipartite entanglement. We report the maximum (negative) values of the witness achieved on these QPUs as $-0.178 \pm 0.009$ and $-0.169 \pm 0.002$, corresponding to two different state preparation protocols. Additionally, we theoretically investigate the effect of various noise channels on the genuine entanglement of a four-qubit Dicke state using the Qiskit Aer simulator. We show the behavior of the EW constructed under the assumption of Markovian and non-Markovian amplitude damping and depolarizing noises, bit-phase flip noise, and readout errors. We also investigate the effect of varying thermal relaxation time on the EW, depicting a bound on the $T_1$ time required for successful generation of a Dicke State on a superconducting QPU.

quant-ph

Quantum Dialogue through Non-destructive Discrimination of Cluster State

We propose an efficient, measurement-based quantum dialogue protocol through non-destructive discrimination (NDD) of cluster state. We use ancilla-based measurements that allow the state to be reused without destroying its entanglement. The initial state is a local unitary (LU-) equivalent of the five-qubit cluster state, which significantly reduces the state components from 32 to 4, simultaneously allowing one to write its different subspaces using two different bases. The protocol utilizes single qubit unitaries from the Pauli group to encode the messages, thus preserving the stabilizer nature of the initial state throughout. We demonstrate that the proposed protocol is secure under common quantum attacks and outlining the procedure for the scalability of the scheme to transmit an n-bit message. The proposed protocol has been experimentally verified using IBM quantum backend 'IBM-Torino' as a proof of concept. Using the stabilizer nature of the state, we further introduce a single-qubit error correction mechanism that enhances robustness against noise without requiring any additional qubits. further, the use of NDD allows one to reuse the quantum resources in advancing the two-way dialogue, marking the importance and novelty of the proposed scheme over preexisting methods.

quant-ph

Machine Learning assisted noise classification with Quantum Key Distribution protocols

We propose a hybrid protocol to classify quantum noises using supervised classical machine learning models and simple quantum key distribution protocols. We consider the quantum bit error rates (QBERs) generated in QKD schemes under consideration of different noises, and identify the noise channels with high accuracy for both training and test data. Our protocol classifies quantum noises with high accuracy under the assumption of two different scenarios; in one case we assume two remotely located parties share keys through noisy quantum channels, whereas, in the second case, we simulate the QKD protocols on a gate-based quantum computer, where the gates are afflicted with noise. Alongside efficient classification, our work also throws light on the difference in distribution characteristics of QBERs generated in these two scenarios. Finally, our method is based on classical post processing of data generated from very simplistic quantum protocols, making it readily implementable in the current era of noisy quantum computing with low number of qubits.

quant-ph

Counting with the quantum alternating operator ansatz

We introduce a variational algorithm based on the quantum alternating operator ansatz (QAOA) for the approximate solution of computationally hard counting problems. Our algorithm, dubbed VQCount, is based on the equivalence between random sampling and approximate counting and employs QAOA as a solution sampler. We first prove that VQCount improves upon previous work by reducing exponentially the number of samples needed to obtain an approximation within an arbitrary small multiplicative factor of the exact count. Using tensor network simulations, we then study the typical performance of VQCount with shallow circuits on synthetic instances of two #P-hard problems, positive #NAE3SAT and positive #1-in-3SAT. We employ the original quantum approximate optimization algorithm version of QAOA, as well as the Grover-mixer variant which guarantees a uniform solution probability distribution. We observe a tradeoff between QAOA success probability and sampling uniformity, which we exploit to achieve an empirical efficiency gain over both naive rejection sampling and Grover-based quantum counting. Our results highlight the potential and limitations of variational algorithms for approximate counting.

quant-ph

Experimental demonstration of the Bell-type inequalities for four qubit Dicke state using IBM Quantum Processing Units

Violation of the Bell-type inequalities is necessary to confirm the existence of nonlocality in nonclassical (entangled) states. We have designed a customized operator which is made of the sum of the Pauli matrices ($\sigma_x$, $\sigma_y$, and $\sigma_z$). We theoretically and experimentally investigate the violation of Bell-type inequalities using two- and four-qubit Dicke states on IBM Quantum Processing Units (QPUs). We compare two different state preparation methods for the four-qubit Dicke state -- gate-based and statevector-based -- and evaluate their performance on two IBM QPUs, \texttt{ibm\_kyiv} and \texttt{ibm\_sherbrook}. For the two-qubit case, we demonstrate clear violations of the CHSH inequality, with the highest observed Bell parameter reaching $2.821 \pm 0.0019$ using M3 error mitigation, which is within $0.7\sigma$ of the theoretical maximum $2\sqrt{2}$. In the four-qubit case, we employ a Bell-type inequality tailored for Dicke states and achieve a maximum violation of $2.607 \pm 0.029$ without the need for additional mitigation when using the statevector-based method. Our results reveal that advanced error mitigation techniques significantly enhance the observed violations in the gate-based method, while the statevector-based approach inherently yields more robust states with lower noise. This study highlights the critical role of state preparation and mitigation techniques in probing fundamental quantum correlations on near-term quantum hardware.

quant-ph

Analysing Hubble Tension and Gravitational Waves for $f(Q,T)$ Gravity Theories

In this work, we examine viable models of $f(Q,T)$ gravity theories against observational data with the aim to constrain the parameter space of these models. We have analysed five different models of $f(Q,T)$ gravity and tested them against Type Ia supernovae, Cosmic Chronometer data, Baryon Acoustic Oscillations data and Pantheon data. We put stringent constraints on the $f(Q,T)$ gravity models, $f(Q,T) = Q^{n} +βT$ $(n=1,2,3)$, $f(Q,T)=-αQ-βT^{2}$ and $f(Q,T)=Q^{-2}T^{2}$ along with other cosmological parameters such as deceleration parameter, equation of state parameter and demonstrate their alignment with the $ΛCDM$ model and the observational data. We show that these models have the capability to alleviate the Hubble tension, by predicting the present value of the Hubble parameter close to $74$km/s/Mpc. $f(Q,T)$ gravity theory introduces alterations in the background evolution and imposes a friction term in the propagation of gravitational waves, this phenomenon has also been examined. We have shown their agreement with the Gravitational Wave (GW) luminosity distance with the Electromagnetic (EM) counter part data from Advanced LIGO and Advanced VIRGO across different observing runs capturing coalescence of Binary Neutron Stars (BNS), mergers of Binary Black Holes (BBHs), and Neutron Star-Black Hole (NSBH) binaries with EM counterparts.

gr-qc

NISQ-friendly measurement-based quantum clustering algorithms

Two novel measurement-based, quantum clustering algorithms are proposed based on quantum parallelism and entanglement. The first algorithm follows a divisive approach. The second algorithm is based on unsharp measurements, where we construct an effect operator with a Gaussian probability distribution to cluster similar data points. A major advantage of both algorithms is that they are simplistic in nature, easy to implement, and well suited for noisy intermediate scale quantum computers. We have successfully applied the first algorithm on a concentric circle data set, where the classical clustering approach fails, as well as on the Churrtiz data set of $130$ cities, where we show that the algorithm succeeds with very low quantum resources. We applied the second algorithm on the labeled Wisconsin breast cancer dataset, and found that it is able to classify the dataset with high accuracy using only $O(log(D))$ qubits and polynomial measurements, where $D$ is the maximal distance within any two points in the dataset. We also show that this algorithm works better with an assumed measurement error in the quantum system, making it extremely well-suited for NISQ devices.

quant-ph

Fully Quantum Hash Function

We introduce a novel, \textit{fully} quantum hash (FQH) function within the quantum walk on a cycle framework. We incorporate deterministic quantum computation with a single qubit to replace classical post-processing, thus increasing the inherent security. Further, our proposed hash function exhibits zero collision rate and high reliability. We further show that it provides $ > 50\%$ avalanche on average, and is highly sensitive to the initial conditions. We show comparisons of several performance metrics for the proposed FQH with different settings as well as with existing protocols to prove its efficacy. FQH requires minimal quantum resources to produce a large hash value, providing security against the birthday attack. This innovative approach thus serves as an efficient hash function and lays the foundation for potential advancements in quantum cryptography by integrating the fully quantum hash generation protocol.

quant-ph

Primordial black holes and induced gravitational waves in non-singular matter bouncing cosmology

We present a novel model-independent generic mechanism for primordial black hole formation within the context of non-singular matter bouncing cosmology. In particular, considering a short duration transition from the matter contracting phase to the Hot Big Bang expanding Universe, we find naturally enhanced curvature perturbations on very small scales which can collapse and form primordial black holes. Interestingly, the primordial black hole masses that we find can lie within the observationally unconstrained asteroid-mass window, potentially explaining the totality of dark matter. Remarkably, the enhanced curvature perturbations, collapsing to primordial black holes, can induce as well a stochastic gravitational-wave background, being potentially detectable by future experiments, in particular by SKA, PTAs, LISA and ET, hence serving as a new portal to probe the potential bouncing nature of the initial conditions prevailed in the early Universe.

gr-qc

Effect of Accretion on the evolution of Primordial Black Holes in the context of Modified Gravity Theories

We investigates the effect of accretion of cosmic fluid on the evolution of Primordial Black Holes (PBHs) within the framework of Modified gravity theories. We consider a general form of the Hubble parameter, reflecting a general class of modified gravity theories and bouncing models. We then study the effect of such modified dynamics on PBH in the presence of Hawking radiation and accretion of surrounding materials. We investigate how the evolution of PBHs is influenced by accretion across different cosmological eras, considering the radiation, matter, and dark energy-dominated phases like phantom and quintessence for linear equation of state. We further incorporated Non-linear Equations of State such as Chaplygin Gas, Modified Chaplygin gas, Van der Waals model, Polytropic Fluid model. The study systematically analyzes the mass variation of PBHs in the presence of such different cosmological environments. The results will contribute to the understanding of PBH formation and evolution in modified theory of gravity, and their possibility of being detected with future experiments.

gr-qc

Lower bound of the expressibility of ansatzes for Variational Quantum Algorithms

The expressibility of an ansatz used in a variational quantum algorithm is defined as the uniformity with which it can explore the space of unitary matrices, i.e., its covering number. The expressibility of a particular ansatz has a well-defined upper bound [1]. In this work, we show that the expressibility also has a well-defined lower bound in the hypothesis space. We provide an analytical expression for the lower bound of the covering number, which is directly related to expressibility. Further, we provide numerical analysis to support our claim. By calculating the bond length of hydrogen molecule ($H_2$) using different ansatzes in a variational quantum eigensolver (VQE) setting, we study the variation of equilibrium energy error with circuit depths. We show that in each ansatz template, a plateau exists for a range of circuit depths, which we call the set of acceptable points, and the corresponding expressibility as the best expressive region. We report that the width of this best expressive region in the hypothesis space is inversely proportional to the average error. Our analysis reveals that alongside trainability, the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes

quant-ph