Pith. sign in

REVIEW 2 cited by

Unsupervised quantum machine learning for fraud detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.01203 v1 pith:DGQ2FWEN submitted 2022-08-02 quant-ph cond-mat.dis-nn

classification quant-phcond-mat.dis-nn
keywords quantumdetectionaveragefraudprecisionqubitsunsupervisedanomaly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We develop quantum protocols for anomaly detection and apply them to the task of credit card fraud detection (FD). First, we establish classical benchmarks based on supervised and unsupervised machine learning methods, where average precision is chosen as a robust metric for detecting anomalous data. We focus on kernel-based approaches for ease of direct comparison, basing our unsupervised modelling on one-class support vector machines (OC-SVM). Next, we employ quantum kernels of different type for performing anomaly detection, and observe that quantum FD can challenge equivalent classical protocols at increasing number of features (equal to the number of qubits for data embedding). Performing simulations with registers up to 20 qubits, we find that quantum kernels with re-uploading demonstrate better average precision, with the advantage increasing with system size. Specifically, at 20 qubits we reach the quantum-classical separation of average precision being equal to 15%. We discuss the prospects of fraud detection with near- and mid-term quantum hardware, and describe possible future improvements.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Neural Networks for Wind Energy Forecasting: A Comparative Study of Performance and Scalability with Classical Models

    cs.LG 2025-06 conditional novelty 4.0 of 10

    On one wind turbine dataset, simulated 4-qubit quantum neural networks with a Z feature map reach R2 around 0.94 and RMSE slightly below k-nearest neighbors, with training time scaling roughly linearly with dataset size.

  2. Comparative Analysis of QNN Architectures for Wind Power Prediction: Feature Maps and Ansatz Configurations

    quant-ph 2025-05 reject novelty 4.0 of 10

    Z feature map quantum neural networks reach R^2 0.92-0.93 for wind power prediction in simulation, but the paper's claim that they outperform classical methods is contradicted by its MAE results.

Pith tools