activity
20242026
most citedAdversarial Robustness Guarantees for Quantum Classifiers

7 citations · 7 across the 3 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Non-Clifford Crosstalk Noise in Surface Codes Using Hybrid Stabilizer-Tensor Network Methods

Ben Harper, Azar C. Nakhl, Martin Sevior +1

Scalable realisation of quantum computing is reliant on the development of fault tolerant devices. Analysis of quantum error correction protocols typically considers incoherent noi…

quant-ph2026

GCAMPS: A Scalable Classical Simulator for Qudit Systems

Ben Harper, Azar C. Nakhl, Thomas Quella +2

Classical simulations of quantum systems are notoriously difficult computational problems, with conventional state vector and tensor network methods restricted to quantum systems t…

quant-ph20267 cited

Adversarial Robustness Guarantees for Quantum Classifiers

Neil Dowling, Maxwell T. West, Angus Southwell +4

Despite their ever more widespread deployment throughout society, machine learning algorithms remain critically vulnerable to being spoofed by subtle adversarial tampering with the…

quant-ph2025

Stabilizer Tensor Networks with Magic State Injection

Azar C. Nakhl, Ben Harper, Maxwell West +4

This work augments the recently introduced Stabilizer Tensor Network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to sim…

quant-ph2024

Calibrating the role of entanglement in variational quantum circuits

Azar C. Nakhl, Thomas Quella, Muhammad Usman

Entanglement is a key property of quantum computing that separates it from its classical counterpart, however, its exact role in the performance of quantum algorithms, especially v…