Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Graph-Based Feasibility Study of Quantum-Classical Hybrid Classification for Money Mule Account Detection

Abraham Itzhak Weinberg

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.7121778

Related papers

Hybrid Quantum-Classical Fraud Detection Using Gated Token Mixing Transformers and Graph-Based Evidence Subgraph Discovery for Explainable AML

GODWIN OLUWAFEMI OLAOYE

•Jun 16, 2026•0 citations

Classification Using Hybrid Classical-Quantum Machine Learning

Rajni Bala, Geethanjali Kher, Vanshika Singh +1 more

Communications in computer and information science•Jan 1, 2025•1 citation

Hybrid Quantum Graph Transformers with Conformal Risk Guarantees for Explainable Fraud Detection and Anti-Money Laundering

GODWIN OLUWAFEMI OLAOYE

•Jun 17, 2026•0 citations

scission: A Hybrid Classical-AI and Quantum Pipeline for Fraud-Ring Detection in Transaction Graphs: Design, Implementation, and Empirical Evaluation

Muhammad Asghar Ali

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.

•Aug 10, 2026•0 citations

Financial fraud detection using quantum graph neural networks

Nouhaila Innan, Abhishek Sawaika, Ashim Dhor +7 more

arXiv:2309.01127•Quantum Machine Intelligence•Feb 1, 2024•149 citations

Hybrid Quantum-Classical Support Vector Machines for Financial Regime Detection: Performance and Efficiency Evaluation

Tom Girard

•Jan 1, 2025•0 citations
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.