SearcharxivSearch

arXiv subjects

Muhammad Ahsan

Publications and source records attributed to Muhammad Ahsan.

9 recordsLinked to original sources

Classical and Hybrid Quantum Machine Learning for Trigger-Like Event Selection on CMS Open Data: An Eight-Qubit, PCA-Constrained Benchmark

Event triggering sits at the heart of high-energy physics, where the rare events of interest must be retained while an overwhelming background is discarded under tight latency and bandwidth budgets. This work compares four classical machine learning models, namely a support vector machine, an artificial neural network, a convolutional network and a long short-term memory network, with four hybrid quantum counterparts, on a trigger-like binary classification task built from CMS open data. The label is defined by an invariant-mass window, and the inputs combine reconstructed kinematics with physics-motivated derived variables: the pseudorapidity difference, the wrapped azimuthal difference, the angular separation and the total transverse momentum. The quantum models run under a fixed resource budget of eight qubits, a principal-component compression to sixteen features and state-vector simulation. Every model shares the same stratified split, the same preprocessing and a common decision threshold, and performance is reported through accuracy, ROC-AUC, F1-score, precision and recall. The strongest classical model is the artificial neural network, at 93.53 percent accuracy and 0.9819 ROC-AUC, while the strongest quantum model is the quantum convolutional network, at 90.89 percent accuracy and 0.9731 ROC-AUC, with the quantum neural network close behind. The quantum-kernel and recurrent quantum approaches trail both, which places the trainable hybrid embeddings ahead within this budget. The study is meant as a controlled reference point rather than a claim of quantum advantage.

hep-ph

Ontological grounding for sound and natural robot explanations via large language models

Building effective human-robot interaction requires robots to derive conclusions from their experiences that are both logically sound and communicated in ways aligned with human expectations. This paper presents a hybrid framework that blends ontology-based reasoning with large language models (LLMs) to produce semantically grounded and natural robot explanations. Ontologies ensure logical consistency and domain grounding, while LLMs provide fluent, context-aware and adaptive language generation. The proposed method grounds data from human-robot experiences, enabling robots to reason about whether events are typical or atypical based on their properties. We integrate a state-of-the-art algorithm for retrieving and constructing static contrastive ontology-based narratives with an LLM agent that uses them to produce concise, clear, interactive explanations. The approach is validated through a laboratory study replicating an industrial collaborative task. Empirical results show significant improvements in the clarity and brevity of ontology-based narratives while preserving their semantic accuracy. Initial evaluations further demonstrate the system's ability to adapt explanations to user feedback. Overall, this work highlights the potential of ontology-LLM integration to advance explainable agency, and promote more transparent human-robot collaboration.

cs.RO

Utility-Scale Quantum Computation of Ground-State Energy in a 100+ Site Planar Kagome Antiferromagnet via Hamiltonian Engineering

We present experimental quantum computation of the ground-state energy in a 103-site flat Kagome lattice under the antiferromagnetic Heisenberg model (KAFH), with IBM's Heron r1 and Heron r2 quantum processors. For spin-1/2 KAFH, our per-site ground-state energy estimate is $-0.417\,J$, which, under open-boundary corrections, matches the energy in the thermodynamic limit, i.e., $-0.4386\,J$. To achieve this, we used a hybrid approach that splits the conventional Variational Quantum Eigensolver (VQE) into local (classical) and global (quantum) components for efficient hardware utilization. More importantly, we introduce a Hamiltonian engineering strategy that increases coupling on defect triangles to mimic loop-flip dynamics, allowing us to simplify the ansatz while retaining computational accuracy. Using a single-repetition, hardware-efficient ansatz, we entangle up to 103 qubits with high fidelity to determine the Hamiltonian's lowest eigenvalue. This work demonstrates the scalability of VQE for frustrated 2D systems and lays the foundation for future studies using deeper ansatz circuits and larger lattices on utility quantum processors.

quant-ph

Faithful Counterfactual Visual Explanations (FCVE)

Deep learning models in computer vision have made remarkable progress, but their lack of transparency and interpretability remains a challenge. The development of explainable AI can enhance the understanding and performance of these models. However, existing techniques often struggle to provide convincing explanations that non-experts easily understand, and they cannot accurately identify models' intrinsic decision-making processes. To address these challenges, we propose to develop a counterfactual explanation (CE) model that balances plausibility and faithfulness. This model generates easy-to-understand visual explanations by making minimum changes necessary in images without altering the pixel data. Instead, the proposed method identifies internal concepts and filters learned by models and leverages them to produce plausible counterfactual explanations. The provided explanations reflect the internal decision-making process of the model, thus ensuring faithfulness to the model.

cs.CV

Classification of freshwater snails of the genus Radomaniola with multimodal triplet networks

In this paper, we present our first proposal of a machine learning system for the classification of freshwater snails of the genus Radomaniola. We elaborate on the specific challenges encountered during system design, and how we tackled them; namely a small, very imbalanced dataset with a high number of classes and high visual similarity between classes. We then show how we employed triplet networks and the multiple input modalities of images, measurements, and genetic information to overcome these challenges and reach a performance comparable to that of a trained domain expert.

cs.CV

The OpenDC Microservice Simulator: Design, Implementation, and Experimentation

Microservices is an architectural style that structures an application as a collection of loosely coupled services, making it easy for developers to build and scale their applications. The microservices architecture approach differs from the traditional monolithic style of treating software development as a single entity. Microservice architecture is becoming more and more adapted. However, microservice systems can be complex due to dependencies between the microservices, resulting in unpredictable performance at a large scale. Simulation is a cheap and fast way to investigate the performance of microservices in more detail. This study aims to build a microservices simulator for evaluating and comparing microservices based applications. The microservices reference architecture is designed. The architecture is used as the basis for a simulator. The simulator implementation uses statistical models to generate the workload. The compelling features added to the simulator include concurrent execution of microservices, configurable request depth, three load-balancing policies and four request execution order policies. This paper contains two experiments to show the simulator usage. The first experiment covers request execution order policies at the microservice instance. The second experiment compares load balancing policies across microservice instances.

cs.DC

Failure Analysis of Big Cloud Service Providers Prior to and During Covid-19 Period

Cloud services are important for societal function such as healthcare, commerce, entertainment and education. Cloud can provide a variety of features such as increased collaboration and inexpensive computing. Failures are unavoidable in cloud services due to the large size and complexity, resulting in decreased reliability and efficiency. For example, due to bugs, many high-severity failures have been occurring in cloud infrastructure of popular providers, causing outages of several hours and the unrecoverable loss of user data. There are prior studies about cloud failure analyses are limited and use sources such as news articles. However, a detailed cloud failure focused study is required that provides analyses for cloud failure data gathered directly from the vendors. Furthermore, the Covid-19 cloud failures should be studied as cloud services played a major role throughout the Covid-19 period, as individuals relied on cloud services for activities such as working from home. A program can be made for this task. As a result, we will be able to better understand and mitigate cloud failures to reduce the effect of cloud failures.

cs.DC

Quantum Circuit Engineering for Correcting Coherent Noise

Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation. These are unlocked during the execution of full quantum circuit applying entangling gates to several qubits simultaneously. Unwanted Z-Z coupling on superconducting cross-resonance CNOT gates, is a commonly occurring unitary crosstalk noise that severely limits the state fidelity. This work presents (1) method of tracing unitary errors, which exploits their sensitivity to the arrangement of CNOT gates in the circuit and (2) correction scheme that modifies original circuit by inserting carefully chosen compensating gates (single- or two-qubit) to possibly undo unitary errors. On two vastly different types of IBMQ processors offering quantum volume 8 and 32, our experimental results show up to 25% reduction in the infidelity of [[7, 1, 3]] code |+> state. Our experiments aggressively deploy forced commutation of CNOT gates to obtain low noise state-preparation circuits. Encoded state initialized with fewer unitary errors marks an important step towards successful demonstration of fault-tolerant quantum computers.

quant-ph

Designing a Million-Qubit Quantum Computer Using Resource Performance Simulator

The optimal design of a fault-tolerant quantum computer involves finding an appropriate balance between the burden of large-scale integration of noisy components and the load of improving the reliability of hardware technology. This balance can be evaluated by quantitatively modeling the execution of quantum logic operations on a realistic quantum hardware containing limited computational resources. In this work, we report a complete performance simulation software tool capable of (1) searching the hardware design space by varying resource architecture and technology parameters, (2) synthesizing and scheduling fault-tolerant quantum algorithm within the hardware constraints, (3) quantifying the performance metrics such as the execution time and the failure probability of the algorithm, and (4) analyzing the breakdown of these metrics to highlight the performance bottlenecks and visualizing resource utilization to evaluate the adequacy of the chosen design. Using this tool we investigate a vast design space for implementing key building blocks of Shor's algorithm to factor a 1,024-bit number with a baseline budget of 1.5 million qubits. We show that a trapped-ion quantum computer designed with twice as many qubits and one-tenth of the baseline infidelity of the communication channel can factor a 2,048-bit integer in less than five months.

quant-ph