Pascal Jahan Elahi

QUANT-PH
h-index5
3papers
1citation
Novelty57%
AI Score44

3 Papers

62.0DCMay 13
HPC-vQPU: A Service-Export Architecture for Virtual QPUs on Batch-Scheduled HPC Systems

Shusen Liu, Pascal Jahan Elahi, Ugo Varetto

Device-aware quantum simulation increasingly requires HPC-scale accelerators, yet secure supercomputers expose batch-scheduled execution environments rather than the interactive, backend-oriented interfaces expected by quantum software. The key obstacle is not only remote job submission: an HPC-hosted virtual QPU must preserve topology, native-gate, and calibration semantics across queue delay, scheduler allocation, compute-node isolation, and partial execution-side failures, without opening inbound paths into the cluster. We present HPC-vQPU, a service-export architecture for virtual QPUs on batch-scheduled HPC systems. HPC-vQPU separates a cloud-facing control plane, which owns device identity, task lifecycle, snapshot binding, and event projection, from an HPC-resident execution plane, which claims work and realises it through scheduler-backed GPU jobs. Coordination is exclusively outbound and agent initiated. The central abstraction is a topology- and calibration-aware device snapshot bound atomically at claim time and carried into execution as an immutable contract, making each scheduled job hermetic while preserving fresh device semantics. We implement HPC-vQPU at the Pawsey Supercomputing Research Centre using Setonix GPUs, Qiskit-Aer/cuQuantum, and IBM Fez calibration data. Production experiments show that service overhead is bounded and additive, while workload scaling remains confined to the simulator; calibration-bearing snapshots produce measurable output shifts; claim-time binding prevents stale execution after pre-claim device mutation; concurrent agents complete 50/50 tasks exactly once; and explicit recovery restores stale running tasks after agent failure. These results show that secure, scheduler-mediated HPC infrastructure can export device-faithful quantum simulation as an interactive virtual-QPU service.

QUANT-PHFeb 16
Quantum Reservoir Computing with Neutral Atoms on a Small, Complex, Medical Dataset

Luke Antoncich, Yuben Moodley, Ugo Varetto et al.

Biomarker-based prediction of clinical outcomes is challenging due to nonlinear relationships, correlated features, and the limited size of many medical datasets. Classical machine-learning methods can struggle under these conditions, motivating the search for alternatives. In this work, we investigate quantum reservoir computing (QRC), using both noiseless emulation and hardware execution on the neutral-atom Rydberg processor \textit{Aquila}. We evaluate performance with six classical machine-learning models and use SHAP to generate feature subsets. We find that models trained on emulated quantum features achieve mean test accuracies comparable to those trained on classical features, but have higher training accuracies and greater variability over data splits, consistent with overfitting. When comparing hardware execution of QRC to noiseless emulation, the models are more robust over different data splits and often exhibit statistically significant improvements in mean test accuracy. This combination of improved accuracy and increased stability is suggestive of a regularising effect induced by hardware execution. To investigate the origin of this behaviour, we examine the statistical differences between hardware and emulated quantum feature distributions. We find that hardware execution applies a structured, time-dependent transformation characterised by compression toward the mean and a progressive reduction in mutual information relative to emulation.

81.9QUANT-PHMar 31
DynQ: A Dynamic Topology-Agnostic Quantum Virtual Machine via Quality-Weighted Community Detection

Shusen Liu, Pascal Jahan Elahi, Ugo Varetto

Quantum cloud platforms have scaled hardware capacity but not the abstraction exposed to users: small programs still monopolise entire processors, and existing Quantum Virtual Machine (QVM) designs often rely on fixed, topology-specific partitions that are brittle under calibration drift, spatial heterogeneity, and transient defects. We present DynQ, a dynamic topology-agnostic QVM that derives execution regions directly from live calibration data. DynQ models a processor as a quality-weighted coupling graph and formulates region discovery as community detection, turning high internal cohesion and low external coupling into a hardware-aware objective for quantum virtualisation. This produces regions that are compilation-friendly, quality-aware, and resilient to degraded couplers and unavailable qubits. DynQ separates offline region discovery from online allocation, enabling low-latency scheduling over pre-validated regions while allowing recomputation under changing hardware conditions. Across five IBM backends, real-device experiments on IBM Kingston and Torino, and cross-architecture evaluation on Rigetti Ankaa-3 via AWS Braket, DynQ improves execution quality, recovers workloads lost under transient defects, and maintains stable output under concurrent batching. It reduces L1 error by up to 45.1% and improves output similarity by up to 19.1% on heterogeneous hardware, while eliminating observed baseline failures on real devices. These results position quantum virtualisation as a graph-driven systems problem and show that adaptive, quality-aware QVMs enable reliable multi-tenant quantum cloud services.