Searcharxiv⌕ Search

arXiv subjects

Muhammad Usman

Publications and source records attributed to Muhammad Usman.

At least 73 records · Page 4Linked to original sources

Effect of shape on void growth: A coupled Extended Finite Element Method (XFEM) and Discrete Dislocation Plasticity (DDP) study

Voids are one of the many material defects present at the microscopic length scale. They are primarily responsible for the formation of cracks and hence contribute to ductile fracture. Circular voids tend to deform into elliptical voids just before their coalescence to form cracks. The principle aim of this study is to investigate the effect of void shape on the micro-mechanism of void growth by using Discrete Dislocation Plasticity simulations. For voided crystals, conventional DDP produces a continuous slip step throughout the material even if a dislocation escapes from a non-convex domain. To overcome this issue, the Extended Finite Element Method (XFEM) is used here to incorporate the displacement discontinuity. Different aspect ratios of elliptical voids are considered under uniaxial and biaxial deformation boundary conditions. The results suggest that voids having the largest surface area tend to have maximum growth rate as compared to void with lower surface area, i.e. "larger is faster". Under biaxial loading, a higher magnitude of strain hardening, and void growth rate are observed as compared to uniaxial loading. The results also suggest that the orientation of slip planes as well as voids, affect the overall plastic behavior of the voided-ductile material. Furthermore, circular void tends to induce minimum growth rate but have the maximum strain hardening effect as compared to other void shapes under both loading conditions. The results of this study provide a deeper understanding of ductile fracture with applications in manufacturing industry, aerospace industry and in the design of nano/micro-electromechanical devices i.e. NEMS/MEMS.

physics.app-ph↗

Almost fault-tolerant quantum machine learning with drastic overhead reduction

Errors in the current generation of quantum processors pose a significant challenge towards practical-scale implementations of quantum machine learning (QML) as they lead to trainability issues arising from noise-induced barren plateaus, as well as performance degradations due to the noise accumulation in deep circuits even when QML models are free from barren plateaus. Quantum error correction (QEC) protocols are being developed to overcome hardware noise, but their extremely high spacetime overheads, mainly due to magic state distillation, make them infeasible for near-term practical implementation. This work proposes the idea of partial quantum error correction (QEC) for quantum machine learning (QML) models and identifies a sweet spot where distillations are omitted to significantly reduce overhead. By assuming error-corrected two-qubit Controlled-$Z$s (Clifford operations), we demonstrate that the QML models remain trainable even when single-qubit gates are subjected to $\approx0.2\%$ depolarizing noise, corresponding to a gate error rate of $\approx0.13\%$ under randomized benchmarking. Further analysis based on various noise models, such as phase-damping and thermal-dissipation channels at low temperature, indicates that the QML models are trainable independent of the mean angle of over-rotation, or can even be improved by thermal damping that purifies a quantum state away from depolarizations. While it may take several years to build quantum processors capable of fully fault-tolerant QML, our work proposes a resource-efficient solution for trainable and high-accuracy QML implementations in noisy environments.

quant-ph↗

Adversarially Robust Quantum Transfer Learning

Quantum machine learning (QML) has emerged as a promising area of research for enhancing the performance of classical machine learning systems by leveraging quantum computational principles. However, practical deployment of QML remains limited due to current hardware constraints such as limited number of qubits and quantum noise. This chapter introduces a hybrid quantum-classical architecture that combines the advantages of quantum computing with transfer learning techniques to address high-resolution image classification. Specifically, we propose a Quantum Transfer Learning (QTL) model that integrates classical convolutional feature extraction with quantum variational circuits. Through extensive simulations on diverse datasets including Ants \& Bees, CIFAR-10, and Road Sign Detection, we demonstrate that QTL achieves superior classification performance compared to both conventional and quantum models trained without transfer learning. Additionally, we also investigate the model's vulnerability to adversarial attacks and demonstrate that incorporating adversarial training significantly boosts the robustness of QTL, enhancing its potential for deployment in security sensitive applications.

quant-ph↗

Bird Eye-View to Street-View: A Survey

In recent years, street view imagery has grown to become one of the most important sources of geospatial data collection and urban analytics, which facilitates generating meaningful insights and assisting in decision-making. Synthesizing a street-view image from its corresponding satellite image is a challenging task due to the significant differences in appearance and viewpoint between the two domains. In this study, we screened 20 recent research papers to provide a thorough review of the state-of-the-art of how street-view images are synthesized from their corresponding satellite counterparts. The main findings are: (i) novel deep learning techniques are required for synthesizing more realistic and accurate street-view images; (ii) more datasets need to be collected for public usage; and (iii) more specific evaluation metrics need to be investigated for evaluating the generated images appropriately. We conclude that, due to applying outdated deep learning techniques, the recent literature failed to generate detailed and diverse street-view images.

cs.CV↗

From Satellite to Street: A Hybrid Framework Integrating Stable Diffusion and PanoGAN for Consistent Cross-View Synthesis

Street view imagery has become an essential source for geospatial data collection and urban analytics, enabling the extraction of valuable insights that support informed decision-making. However, synthesizing street-view images from corresponding satellite imagery presents significant challenges due to substantial differences in appearance and viewing perspective between these two domains. This paper presents a hybrid framework that integrates diffusion-based models and conditional generative adversarial networks to generate geographically consistent street-view images from satellite imagery. Our approach uses a multi-stage training strategy that incorporates Stable Diffusion as the core component within a dual-branch architecture. To enhance the framework's capabilities, we integrate a conditional Generative Adversarial Network (GAN) that enables the generation of geographically consistent panoramic street views. Furthermore, we implement a fusion strategy that leverages the strengths of both models to create robust representations, thereby improving the geometric consistency and visual quality of the generated street-view images. The proposed framework is evaluated on the challenging Cross-View USA (CVUSA) dataset, a standard benchmark for cross-view image synthesis. Experimental results demonstrate that our hybrid approach outperforms diffusion-only methods across multiple evaluation metrics and achieves competitive performance compared to state-of-the-art GAN-based methods. The framework successfully generates realistic and geometrically consistent street-view images while preserving fine-grained local details, including street markings, secondary roads, and atmospheric elements such as clouds.

cs.CV↗

Automatizing the search for mass resonances using BumpNet

Physics Beyond the Standard Model (BSM) has yet to be observed at the Large Hadron Collider (LHC), motivating the development of model-agnostic, machine learning-based strategies to probe more regions of the phase space. As many final states have not yet been examined for mass resonances, an accelerated approach to bump-hunting is desirable. BumpNet is a neural network trained to map smoothly falling invariant-mass histogram data to statistical significance values. It provides a unique, automatized approach to mass resonance searches with the capacity to scan hundreds of final states reliably and efficiently.

hep-ph↗

Cardiverse: Harnessing LLMs for Novel Card Game Prototyping

The prototyping of computer games, particularly card games, requires extensive human effort in creative ideation and gameplay evaluation. Recent advances in Large Language Models (LLMs) offer opportunities to automate and streamline these processes. However, it remains challenging for LLMs to design novel game mechanics beyond existing databases, generate consistent gameplay environments, and develop scalable gameplay AI for large-scale evaluations. This paper addresses these challenges by introducing a comprehensive automated card game prototyping framework. The approach highlights a graph-based indexing method for generating novel game variations, an LLM-driven system for consistent game code generation validated by gameplay records, and a gameplay AI constructing method that uses an ensemble of LLM-generated heuristic functions optimized through self-play. These contributions aim to accelerate card game prototyping, reduce human labor, and lower barriers to entry for game developers. For code repo visit this http URL https://github.com/danruili/Cardiverse

cs.CL↗

Crosstalk Attacks and Defence in a Shared Quantum Computing Environment

Quantum computing has the potential to provide solutions to problems that are intractable on classical computers, but the accuracy of the current generation of quantum computers suffer from the impact of noise or errors such as leakage, crosstalk, dephasing, and amplitude damping among others. As the access to quantum computers is almost exclusively in a shared environment through cloud-based services, it is possible that an adversary can exploit crosstalk noise to disrupt quantum computations on nearby qubits, even carefully designing quantum circuits to purposely lead to wrong answers. In this paper, we analyze the extent and characteristics of crosstalk noise through tomography conducted on IBM Quantum computers, leading to an enhanced crosstalk simulation model. Our results indicate that crosstalk noise is a significant source of errors on IBM quantum hardware, making crosstalk based attack a viable threat to quantum computing in a shared environment. Based on our crosstalk simulator benchmarked against IBM hardware, we assess the impact of crosstalk attacks and develop strategies for mitigating crosstalk effects. Through a systematic set of simulations, we assess the effectiveness of three crosstalk attack mitigation strategies, namely circuit separation, qubit allocation optimization via reinforcement learning, and the use of spectator qubits, and show that they all overcome crosstalk attacks with varying degrees of success and help to secure quantum computing in a shared platform.

quant-ph↗

A graph-theoretic approach to chaos and complexity in quantum systems

There has recently been considerable interest in studying quantum systems via dynamical Lie algebras (DLAs) -- Lie algebras generated by the terms which appear in the Hamiltonian of the system. However, there are some important properties that are revealed only at a finer level of granularity than the DLA. In this work we explore, via the commutator graph, average notions of scrambling, chaos and complexity over ensembles of systems with DLAs that possess a basis consisting of Pauli strings. Unlike DLAs, commutator graphs are sensitive to short-time dynamics, and therefore constitute a finer probe to various characteristics of the corresponding ensemble. We link graph-theoretic properties of the commutator graph to the out-of-time-order correlator (OTOC), the frame potential, the frustration graph of the Hamiltonian of the system, and the Krylov complexity of operators evolving under the dynamics. For example, we reduce the calculation of average OTOCs to a counting problem on the graph; separately, we connect the Krylov complexity of an operator to the module structure of the adjoint action of the DLA on the space of operators in which it resides, and prove that its average over the ensemble is lower bounded by the average shortest path length between the initial operator and the other operators in the commutator graph.

quant-ph↗

Time-adaptive single-shot crosstalk detector on superconducting quantum computer

Quantum crosstalk which stems from unwanted interference of quantum operations with nearby qubits is a major source of noise or errors in a quantum processor. In the context of shared quantum computing, it is challenging to mitigate the crosstalk effect between quantum computations being simultaneously run by multiple users since the exact spatio-temporal gate distributions are not apparent due to privacy concerns. It is therefore important to develop techniques for accurate detection and mitigation of crosstalk to enable high-fidelity quantum computing. Assuming prior knowledge of crosstalk parameters, we propose a time-adaptive detection method leveraging spectator qubits and multiple quantum coherence to amplify crosstalk-induced perturbations. We demonstrate its utility in detecting random sparsely distributed crosstalk within a time window. Our work evaluates its performance in two scenarios: simulation using an artificial noise model with gate-induced crosstalk and always-on idlings channels; and the simulation using noise sampled from an IBM quantum computer parametrised by the reduced HSA error model. The presented results show our method's efficacy hinges on the dominance of single-qubit coherent noise across channels, and the impact of angle mismatching is suppressed as spectator qubits increase. From simulation using real-device noise parameters, our strategy outperforms the previous constant-frequency detection method of Harper et. al. [arXiv: 2402.02753 (2024)] in the detection success rate, achieving an average detection success probability of $0.852\pm 0.022$ (equally scaled noise channels) and $0.933\pm0.024$ (asymmetrically scaled noise channels) from 1 to 7 crosstalk counts.

quant-ph↗

RBF-FD Method for Some Dispersive Wave Equations and Their Eventual Periodicity

In this paper, we approximate the solution and also discuss the periodic behavior termed as eventual periodicity of solutions of (IBVPs) for some dispersive wave equations on a bounded domain corresponding to periodic forcing. The constructed numerical scheme is based on radial kernels and local in nature like finite difference method. The temporal variable is executed through RK4 scheme. Due to the local nature and sparse differentiation matrices our numerical scheme efficiently recovers the solution. The results achieved are validated and examined with other methods accessible in the literature.

math.NA↗

SABIA: An AI-Powered Tool for Detecting Opioid-Related Behaviors on Social Media

Social media platforms have become valuable tools for understanding public health challenges by offering insights into patient behaviors, medication use, and mental health issues. However, analyzing such data remains difficult due to the prevalence of informal language, slang, and coded communication, which can obscure the detection of opioid misuse. This study addresses the issue of opioid-related user behavior on social media, including informal expressions, slang terms, and misspelled or coded language. We analyzed the existing Bidirectional Encoder Representations from Transformers (BERT) technique and developed a BERT-BiLSTM-3CNN hybrid deep learning model, named SABIA, to create a single-task classifier that effectively captures the features of the target dataset. The SABIA model demonstrated strong capabilities in capturing semantics and contextual information. The proposed approach includes: (1) data preprocessing, (2) data representation using the SABIA model, (3) a fine-tuning phase, and (4) classification of user behavior into five categories. A new dataset was constructed from Reddit posts, identifying opioid user behaviors across five classes: Dealers, Active Opioid Users, Recovered Users, Prescription Users, and Non-Users, supported by detailed annotation guidelines. Experiments were conducted using supervised learning. Results show that SABIA achieved benchmark performance, outperforming the baseline (Logistic Regression, LR = 0.86) and improving accuracy by 9.30%. Comparisons with seven previous studies confirmed its effectiveness and robustness. This study demonstrates the potential of hybrid deep learning models for detecting complex opioid-related behaviors on social media, supporting public health monitoring and intervention efforts.

cs.SI↗

MESAHA-Net: Multi-Encoders based Self-Adaptive Hard Attention Network with Maximum Intensity Projections for Lung Nodule Segmentation in CT Scan

Accurate lung nodule segmentation is crucial for early-stage lung cancer diagnosis, as it can substantially enhance patient survival rates. Computed tomography (CT) images are widely employed for early diagnosis in lung nodule analysis. However, the heterogeneity of lung nodules, size diversity, and the complexity of the surrounding environment pose challenges for developing robust nodule segmentation methods. In this study, we propose an efficient end-to-end framework, the multi-encoder-based self-adaptive hard attention network (MESAHA-Net), for precise lung nodule segmentation in CT scans. MESAHA-Net comprises three encoding paths, an attention block, and a decoder block, facilitating the integration of three types of inputs: CT slice patches, forward and backward maximum intensity projection (MIP) images, and region of interest (ROI) masks encompassing the nodule. By employing a novel adaptive hard attention mechanism, MESAHA-Net iteratively performs slice-by-slice 2D segmentation of lung nodules, focusing on the nodule region in each slice to generate 3D volumetric segmentation of lung nodules. The proposed framework has been comprehensively evaluated on the LIDC-IDRI dataset, the largest publicly available dataset for lung nodule segmentation. The results demonstrate that our approach is highly robust for various lung nodule types, outperforming previous state-of-the-art techniques in terms of segmentation accuracy and computational complexity, rendering it suitable for real-time clinical implementation.

eess.IV↗

QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning

Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration. These issues complicate the optimization of quantum task allocation and scheduling, as existing heuristic methods fall short in adapting to dynamic conditions or effectively balancing execution fidelity and time. Here, we propose QFOR, a Quantum Fidelity-aware Orchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep Reinforcement learning. We model the quantum task orchestration as a Markov Decision Process and employ the Proximal Policy Optimization algorithm to learn adaptive scheduling policies, using IBM quantum processor calibration data for noise-aware performance estimation. Our configurable framework balances overall quantum task execution fidelity and time, enabling adaptation to different operational priorities. Extensive evaluation demonstrates that QFOR is adaptive and achieves significant performance with 29.5-84% improvements in relative fidelity performance over heuristic baselines. Furthermore, it maintains comparable quantum execution times, contributing to cost-efficient use of quantum computation resources.

quant-ph↗

Millimeter-Wave Communication Testbed Using Digital Coding Dynamic Metasurface Antenna: Practical Design and Implementation

Dynamic Metasurface Antennas (DMAs) are transforming reconfigurable antenna technology by enabling energy-efficient, cost-effective beamforming through programmable meta-elements, eliminating the need for traditional phase shifters and delay lines. This breakthrough technology is emerging to revolutionize beamforming for next-generation wireless communication and sensing networks. In this paper, we present the design and real-world implementation of a DMA-assisted wireless communication platform operating in the license-free 60 GHz millimeter-wave (mmWave) band. Our system employs high-speed binary-coded sequences generated via a field-programmable gate array (FPGA), enabling real-time beam steering for spatial multiplexing and independent data transmission. A proof-of-concept experiment successfully demonstrates high-definition quadrature phase-shift keying (QPSK) modulated video transmission at 62 GHz. Furthermore, leveraging the DMA's multi-beam capability, we simultaneously transmit video to two spatially separated receivers, achieving accurate demodulation. We envision the proposed mmWave testbed as a platform for enabling the seamless integration of sensing and communication by allowing video transmission to be replaced with sensing data or utilizing an auxiliary wireless channel to transmit sensing information to multiple receivers. This synergy paves the way for advancing integrated sensing and communication (ISAC) in beyond-5G and 6G networks. Additionally, our testbed demonstrates potential for real-world use cases, including mmWave backhaul links and massive multiple-input multiple-output (MIMO) mmWave base stations.

eess.SP↗

Detrimental non-Markovian errors for surface code memory

The realization of fault-tolerant quantum computers hinges on effective quantum error correction protocols, whose performance significantly relies on the nature of the underlying noise. In this work, we directly study the structure of non-Markovian correlated errors and their impact on surface code memory performance. Specifically, we compare surface code performance under non-Markovian noise and independent circuit-level noise, while keeping marginal error rates constant. Our analysis shows that while not all temporally correlated structures are detrimental, certain structures, particularly multi-time "streaky" correlations affecting syndrome qubits and two-qubit gates, can severely degrade logical error rate scaling. Furthermore, we discuss our results in the context of recent quantum error correction experiments on physical devices. These findings underscore the importance of understanding and mitigating non-Markovian noise toward achieving practical, fault-tolerant quantum computing.

quant-ph↗

Leveraging Large Language Models for Multi-Class and Multi-Label Detection of Drug Use and Overdose Symptoms on Social Media

Drug overdose remains a critical global health issue, often driven by misuse of opioids, painkillers, and psychiatric medications. Traditional research methods face limitations, whereas social media offers real-time insights into self-reported substance use and overdose symptoms. This study proposes an AI-driven NLP framework trained on annotated social media data to detect commonly used drugs and associated overdose symptoms. Using a hybrid annotation strategy with LLMs and human annotators, we applied traditional ML models, neural networks, and advanced transformer-based models. Our framework achieved 98% accuracy in multi-class and 97% in multi-label classification, outperforming baseline models by up to 8%. These findings highlight the potential of AI for supporting public health surveillance and personalized intervention strategies.

cs.CL↗

Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer

Band crossings in electronic band structures play an important role in determining the electronic, topological, and transport properties in solid-state systems, making them central to both condensed matter physics and materials science. The emergence of noisy intermediate-scale quantum (NISQ) processors has sparked great interest in developing quantum algorithms to compute band structure properties of materials. While significant research has been reported on computing ground state and excited state energy bands in the presence of noise that breaks the degeneracy, identifying the symmetry at crossing points using quantum computers is still an open question. In this work, we propose a method for identifying the symmetry of bands around crossings and anti-crossings in the band structure of bilayer graphene with two distinct configurations on a NISQ device. The method utilizes eigenstates at neighbouring $\mathbf{k}$ points on either side of the touching point to recover the local symmetry by implementing a character-checking quantum circuit that uses ancilla qubit measurements for a probabilistic test. We then evaluate the performance of our method under a depolarizing noise model, using four distinct matrix representations of symmetry operations to assess its robustness. Finally, we demonstrate the reliability of our method by correctly identifying the correct band crossings of AA-stacked bilayer graphene around $K$ point, using the character-checking circuit implemented on a noisy IBM quantum processor $ibm\_marrakesh$.

quant-ph↗