Coordinated financial fraud manifests as small, dense communities embedded in large transaction graphs. Isolating such a community is a combinatorial graph-partitioning problem of the kind often proposed for quantum optimisation, yet near-term quantum devices hold only tens of qubits while real graphs hold millions of accounts. We present scission, a hybrid pipeline built and evaluated under a design-science methodology, whose organising principle is that classical AI compresses the problem so a quantum solver can cut its combinatorial core. Classical anomaly scoring and a greedy reduction shrink the graph to a qubit-budget subgraph; a two-community modularity QUBO then isolates the ring, solved interchangeably by exact enumeration, simulated annealing, or a dependency-free statevector QAOA. We define an experimental protocol with explicit research questions, ground-truth metrics, and reproducibility controls. On a synthetic planted-ring benchmark (44 accounts reduced to 14 qubits) every backend attains the exact optimum, recovering all six ring members with one false positive (F1 = 0.923). We report no quantum advantage at feasible scale, formalise the pipeline's binding constraint as a reduction-recall bound, and give a structured research agenda toward real-data, real-hardware, and adversarial validation. We argue the contribution is architectural: a neutral QUBO interface behind which the solver improves as hardware matures, and an honest, reproducible account of where value does and does not yet arise.
Coordinated financial fraud manifests as small, dense communities embedded in large transaction graphs. Isolating such a community is a combinatorial graph-partitioning problem of the kind often proposed for quantum optimisation, yet near-term quantum devices hold only tens of qubits while real graphs hold millions of accounts. We present scission, a hybrid pipeline built and evaluated under a design-science methodology, whose organising principle is that classical AI compresses the problem so a quantum solver can cut its combinatorial core. Classical anomaly scoring and a greedy reduction shrink the graph to a qubit-budget subgraph; a two-community modularity QUBO then isolates the ring, solved interchangeably by exact enumeration, simulated annealing, or a dependency-free statevector QAOA. We define an experimental protocol with explicit research questions, ground-truth metrics, and reproducibility controls. On a synthetic planted-ring benchmark (44 accounts reduced to 14 qubits) every backend attains the exact optimum, recovering all six ring members with one false positive (F1 = 0.923). We report no quantum advantage at feasible scale, formalise the pipeline's binding constraint as a reduction-recall bound, and give a structured research agenda toward real-data, real-hardware, and adversarial validation. We argue the contribution is architectural: a neutral QUBO interface behind which the solver improves as hardware matures, and an honest, reproducible account of where value does and does not yet arise.
Fraud detection within transaction data is crucial for maintaining financial security, especially in the era of big data. This paper introduces a novel fraud detection method that utilizes quantum computing to implement community detection in transaction networks. We model transaction data as an undirected graph, where nodes represent accounts and edges indicate transactions between them. A modularity function is defined to measure the community structure of the graph. By optimizing this function through the Quadratic Unconstrained Binary Optimization (QUBO) model, we identify the optimal community structure, which is then used to assess the fraud risk within each community. Using a Coherent Ising Machine (CIM) to solve the QUBO model, we successfully divide 308 nodes into four communities. We find that the CIM computes faster than the classical Louvain and simulated annealing (SA) algorithms. Moreover, the CIM achieves better community structure than Louvain and SA as quantified by the modularity function. The structure also unambiguously identifies a high-risk community, which contains almost 70% of all the fraudulent accounts, demonstrating the practical utility of the method for banks' anti-fraud business.
We propose a novel QTGNN framework for detecting fraudulent transactions in large-scale financial networks. By integrating quantum embedding, variational graph convolutions, and topological data analysis, QTGNN captures complex transaction dynamics and structural anomalies indicative of fraud. The methodology includes quantum data embedding with entanglement enhancement, variational quantum graph convolutions with non-linear dynamics, extraction of higher-order topological invariants, hybrid quantum-classical anomaly learning with adaptive optimization, and interpretable decision-making via topological attribution. Rigorous convergence guarantees ensure stable training on noisy intermediate-scale quantum (NISQ) devices, while stability of topological signatures provides robust fraud detection. Optimized for NISQ hardware with circuit simplifications and graph sampling, the framework scales to large transaction networks. Simulations on financial datasets, such as PaySim and Elliptic, benchmark QTGNN against classical and quantum baselines, using metrics like ROC-AUC, precision, and false positive rate. An ablation study evaluates the contributions of quantum embeddings, topological features, non-linear channels, and hybrid learning. QTGNN offers a theoretically sound, interpretable, and practical solution for financial fraud detection, bridging quantum machine learning, graph theory, and topological analysis.
Credit card fraud remains a persistent challenge in the financial sector, leading to significant monetary losses if not effectively mitigated. The growing volume of online transactions and the use of AI to mimic genuine spending patterns make fraud detection tasks increasingly more difficult. In this paper, we propose a hybrid ensemble pipeline in which transformers, graph attention networks, and variational autoencoders serve as deep feature extractors over classical and quantum-enhanced representations. A tree-based meta-learner (XGBoost) aggregates these feature embeddings for the final decision. The impact of quantum feature map representations when integrated with classical ensemble learners remains limited. To this effect, we examine and evaluate quantum circuit design strategies across different number of qubits, Pauli feature maps and data reuploading patterns under statevector simulations. We compare model configurations including tree-based models, standalone neural networks, and the proposed ensemble. Even without the quantum-enhanced features, the ensemble improves detection accuracy, achieving 2% higher averaged F1-scores over the classical tree-based baseline. Introducing quantum-enhanced features in the ensemble pipeline attains comparable performance over classical-only inputs, maintaining an AUC of approximately 98% on the European Credit Card Fraud Dataset. Simulator-based quantum noise causes slight degradation in averaged F1-scores, while averaged AUC is maintained relative to the statevector baseline across varying noise types and levels.
Hybrid quantum–classical detectors are usually evaluated as monolithic alternatives to classical models, which conflates two separable questions: whether the hard cases can be identified, and whether a quantum model can resolve them. We introduce Q-RAD, a gated residual architecture that separates these questions by construction. A quantum-blind, quantum-cost-free gating function routes only ambiguous transactions to a financial-transaction-specific quantum-kernel branch, whose scores are fused residually with a classical trunk under an explicit finite-shot budget. We predeclare the architecture, an eight-comparison confirmatory family with Holm–Bonferroni correction, a cost metric in quantum circuit executions, and a refutation posture, then evaluate on the Kaggle Credit-Card Fraud dataset over ten repeated case-control splits under three blocking validity gates, including exact-equality replay of previously published results. The routing half of the architecture succeeds: the gate attains 0.889 AUROC against realized classical errors and captures 77% of them within a 22% routing budget. The quantum half fails: handed exactly those hard cases, the quantum residual produced zero net corrections in nine of ten seeds and one net regression in the tenth. Q-RAD attains mean case-control test F1 0.916 against 0.918 for the classical trunk and 0.922 for an otherwise identical classical second opinion; the hypotheses of improvement over the classical trunk, over random routing, and over a classical second opinion are all refuted after correction. We report this refutation as predeclared, and localise it: ambiguity in this task is identifiable from classical signals alone, but the quantum kernel cannot exploit that signal at any tested shot budget. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.
Abstract Emerging quantum technologies represent a promising alternative for solving hard combinatorial problems in the post-Moore’s law era. For practical purposes, however, the current number of qubits limits the direct applicability to larger real-world instances in the near-term future. Therefore, a promising strategy to overcome this issue is represented by hybrid quantum classical algorithms which leverage classical as well as quantum devices. One prominent example of a hard computational problem is the community detection problem: a partition of a graph into distinct communities such that the ratio between intra-community and inter-community connectivity is maximized. In this paper, we explore the current potential of quantum annealing and gate-based quantum technologies to solve the community detection problem for an arbitrary number of communities. For this purpose, existing algorithms are (re-)implemented and new hybrid algorithms, that can be run on gate-model devices, are proposed. Their performance on standardized benchmark graphs has been evaluated and compared to the one of a state-of-the-art classical heuristic algorithm. Although no quantum speed-up has been achieved, the existing quantum annealing-based methods as well as the novel hybrid algorithms for gate-based quantum computers yield modularity values, which are similar to those of the classical heuristic. However, the modular architecture of the used algorithms allows for fast utilization of more powerful quantum technologies once they become available.Reproducibility:Our code and data are publicly available (Github in Quantum Modularization. https://github.com/jku-win se/quantum_modularization 2021).
This paper investigates whether hybrid quantum-classical machine learning can deliver practical improvements in financial fraud detection performance for card-based and other payment transactions. Building on a Guided Quantum Compressor architecture, the approach integrates an autoencoder, a variational quantum circuit, and a classical neural head, and then embeds this hybrid model into a mixture-of-experts framework including a state-of-the-art gradient-boosted tree classifier. Using a European credit card dataset with severe class imbalance, the routed hybrid architecture with 0.6 threshold achieves average precision scores of 0.793±0.085 compared to 0.770±0.096 of XGBoost on 3 repeated 5-fold cross-validation benchmarks. Precision and recall comparisons reveals a possible trade-off of fraud and nominal detections with a reduction in false positives at the cost of a small reduction in fraud detections. The improvements are achieved while adding only 7 to 21 minutes of extra inference time depending on the choice of hyperparameters. These results indicate that selectively routing transactions to quantum-classical models can enhance fraud detection while remaining compatible with the latency and operational constraints of modern financial institutions.