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

Monções Revista de Relações Internacionais da UFGD

O desenvolvimento de um Regime de Segurança sino-russo para a Ásia Central

Flávio Augusto Lira Nascimento

Published Dec 1, 2016• 0 citations
OpenAlex

Abstract

Abstract—Hybrid quantum–classical detectors are usuallyevaluated as monolithic alternatives to classical models, whichconflates two separable questions: whether the hard cases can beidentified, and whether a quantum model can resolve them. Weintroduce Q-RAD, a gated residual architecture that separatesthese questions by construction. A quantum-blind, quantumcost-free gating function routes only ambiguous transactions toa financial-transaction-specific quantum-kernel branch, whosescores are fused residually with a classical trunk under anexplicit finite-shot budget. We predeclare the architecture, aneight-comparison confirmatory family with Holm–Bonferronicorrection, a cost metric in quantum circuit executions, anda refutation posture, then evaluate on the Kaggle Credit-CardFraud dataset over ten repeated case-control splits under threeblocking validity gates, including exact-equality replay of previouslypublished results. The routing half of the architecturesucceeds: the gate attains 0.889 AUROC against realized classicalerrors and captures 77% of them within a 22% routing budget.The quantum half fails: handed exactly those hard cases, thequantum residual produced zero net corrections in nine of tenseeds and one net regression in the tenth. Q-RAD attains meancase-control test F1 0.916 against 0.918 for the classical trunkand 0.922 for an otherwise identical classical second opinion; thehypotheses of improvement over the classical trunk, over randomrouting, and over a classical second opinion are all refuted aftercorrection. We report this refutation as predeclared, and localiseit: ambiguity in this task is identifiable from classical signalsalone, but the quantum kernel cannot exploit that signal atany tested shot budget. Balanced-cohort metrics are benchmarkvalues, not deployment-prevalence estimates.Keywords—Quantum Machine Learning; Quantum KernelMethods; Selective Prediction; Learning to Defer; HybridQuantum-Classical Models; Financial Fraud Detection; ShotNoise; Negative Results

Related papers

Q-RAD: a gated residual architecture for quantum-assisted fraud detection, and why its quantum branch does not pay

Jean Marie Vianney Sindayigaya

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.

International Journal of Electronics and Telecommunications•Oct 29, 2026•0 citations

Applications of classical and quantum machine learning in quantum information

Felipe Rodrigues Perche Mahlow

Esta tese explora as interseções entre Aprendizado de Máquina e Informação Quântica, investigando como ferramentas de inteligência artificial podem ser aplicadas para resolver problemas fundamentais em sistemas quânticos complexos. O trabalho foca em dois desafios principais: a classificação de fases quânticas e a predição de sincronização quântica. Na classificação de fases quânticas, apresentamos três abordagens complementares. A primeira explora a independência de modelo, demonstrando como é possível treinar um classificador em dados provenientes de um modelo de Hamiltoniano e utilizá-lo para classificar fases em um modelo distinto. A segunda abordagem emprega algoritmos de Aprendizado de Máquina Quântico (QML) com seleção de atributos baseada na técnica SHAP (Shapley Additive Explanations), otimizando a escolha de features relevantes para melhorar a precisão dos classificadores. Por fim, introduzimos o uso de redes generativas adversárias (GANs) para criar dados sintéticos, permitindo ampliar e diversificar os conjuntos de dados e, assim, aumentar a eficiência e a precisão das classificações. No segundo desafio, a predição de sincronização quântica, aplicamos um algoritmo de aprendizado supervisionado para prever a ocorrência de sincronização ou antissincronização em sistemas quânticos. Baseando-nos em dados iniciais da evolução temporal do sistema, demonstramos como identificar padrões que indicam a dinâmica futura desses fenômenos com alta confiabilidade. Esta tese contribui apresentando soluções inovadoras e um conjunto abrangente de ferramentas que conectam inteligência artificial à compreensão de sistemas quânticos. Os resultados obtidos oferecem insights valiosos para a compreensão e manipulação desses sistemas.

•Feb 25, 2025•0 citations

Entanglement entropy is not a faithful explanation: auditing a financial quantum feature map

Jean Marie Vianney Sindayigaya

Entanglement entropy is an attractive candidate for explaining quantum machine-learning models: it is intrinsic to the encoding, cheap to compute, and requires no measurement. We test whether it is a faithful feature attribution for a financial-transaction quantum feature map, under a protocol predeclared down to its thresholds, its comparison family, and its posture on failure. Two questions are separated by construction. First, does the operating point selected for accuracy leave usable attribution signal? Second, does that signal correspond to what actually drives the model’s decisions? On the Kaggle Credit-Card Fraud dataset over ten repeated case-control splits, per-feature entropy dispersion is 71% lower at the accuracy-selected entanglement strength than at the midpoint of the grid, and the difference is significant after Holm–Bonferroni correction; however, a lower-strength regime with 3.4× the dispersion is available at no statistically detectable accuracy cost. Faithfulness fails decisively. Entropy rankings are significantly anti-correlated with model-aware occlusion attributions (median Spearman −0.299), and on a synthetic task whose informative features are known by construction and which the quantum model demonstrably learns, occlusion recovers ground truth (+0.237) while entropy does not (−0.025), both significant after correction. A model-randomisation check identifies the cause exactly: per-feature entropy is invariant to the trained model, with maximum change of exactly zero across all ten seeds, so it cannot distinguish a correctly trained model from one fitted to shuffled labels. We conclude that entanglement entropy is a genuine and inexpensive diagnostic of the encoding but not an explanation of the model, and we report this refutation as predeclared. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.

International Journal of Electronics and Telecommunications•Oct 29, 2026•0 citations

MV Quantum Group

Rômulo Santos

Este repositório encerra em si a especificação propedêutica, o código-fonte seminal e as validações numéricas de escol que alicerçam o Framework MV-TQM (Mecânica Quântica Topológica). A presente invenção ataca, com rigor cirúrgico, a disfuncionalidade de amostragem intrínseca aos métodos quânticos hodiernos — mormente o limite de convergência assintótico imposto pela Regra de Born — introduzindo, para gáudio da eficiência informacional, o protocolo de Determinismo Operacional. Dos Ativos Tecnológicos e Divulgações Técnicas Contidos neste Arcabouço: Motor de Ancoragem Geométrica (Geometric Anchoring Engine): Metodologia inaudita para a reconstrução cabal do Blochtor de estado σσ mediante, tão somente, três aferições determinísticas pontuais, em substituição à morosidade estatística e ao conluio probabilístico da Tomografia de Estado Quântico (QST) convencional. Rastreabilidade de Fase via Fibrado de Hopf: Demonstração analítica e implementação de tracking em cobertura dupla SU(2) através da integração de sinais de controle fidedignamente logados em arquiteturas de aquisição digital (FPGA), asseverando a coerência de gauge sob as intempéries de ruído espectral 1/f1/f no regime de η=10−3η=10−3 Exponencialidade no Throughput Informacional: Evidência insofismável de uma redução na ordem de dez mil vezes 10.000×10.000× no overhead de leitura, quando confrontada com a amostragem de Poisson, típica dos processos de medição estocástica que hoje assolam a computação quântica de estado sólido. Delimitação Categórica das Fronteiras de Resiliência: Explicitação axiomática do regime de rastreamento determinístico η≪1η≪1 em oposição ao colapso estocástico absoluto, η→1η→1 definindo o locus de operabilidade da Geodesic Engine. Este registro constitui-se, de forma irrevogável, como documento formal de Anterioridade (Prior Art), assegurando a soberania intelectual do MV Quantum Control Group frente a quaisquer pretensões ulteriores de patenteamento por terceiros. O compêndio ora depositado encontra-se sob embargo estratégico até o limite da proteção de mercado. Eventuais interesses em transferência de tecnologia ou acesso à hermenêutica completa do código exigirão a subscrição de rígidos instrumentos de confidencialidade (NDA).

•Mar 3, 2023•0 citations

Where a domain specific quantum feature map pays: a cross-domain

Jean Marie Vianney Sindayigaya

Claims about quantum machine learning are routinely established on a single dataset and generalised informally. This paper tests one such claim directly. Earlier work in this series found, under a leakage-controlled predeclared protocol, that a financial-transaction-specific quantum feature map does not outperform matched classical baselines on the Kaggle Credit-Card Fraud dataset. We freeze source-column contracts and an experimental protocol in advance, inherit every predicted direction from that published result, and replicate on CICIDS-2017 (2.8 million flows) and UNSW-NB15 (257,673 records) — six paired comparisons under one Holm–Bonferroni correction. The replication is partial, and the failure is informative. The map’s advantage over naive amplitude encoding replicates on both datasets and is now established across three datasets and two domains. But the prediction that a matched RBF-SVM would win is significantly reversed on UNSW-NB15, where the quantum kernel wins by a median 0.021 F1 — identifying a regime in which the approach pays. That result is bounded: a random forest on identical cohorts outperforms the quantum kernel on both datasets, so no general claim of quantum advantage is supportable. Two further findings weaken the premise of domain-specific encoding itself. The advantage over generic quantum encodings differs in sign between the two network datasets, and the unanimous entanglement strength selected on financial data does not reproduce on either. We conclude that quantum kernel results reported on one dataset should not be assumed to transfer, in either direction, and that predeclared cross-domain replication is cheap enough to be routine. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.

International Journal of Electronics and Telecommunications•Oct 29, 2026•0 citations

Beyond Representing and Reasoning in Quantum Bayesian networks

Walid Fathallah

Au-delà de la représentation et du raisonnement dans les réseaux Bayésiens quantiques Cette thèse s’inscrit dans le domaine des réseaux bayésiens quantiques, une approche novatrice qui fusionne les principes de l’informatique quantique avec ceux des modèles probabilistes. Les réseaux bayésiens, largement utilisés pour modéliser l’incertitude dans des domaines complexes, souffrent de limitations computationnelles lorsque les données deviennent de grande dimension. En exploitant les propriétés uniques de la mécanique quantique, comme la superposition et l’intrication, les réseaux bayésiens quantiques ouvrent la voie à des inférences probabilistes plus rapides et plus efficaces. Le travail de cette thèse se concentre sur deux axes principaux : l’optimisation des circuits quantiques pour les réseaux bayésiens et le développement d’algorithmes hybrides d’inférence adaptés aux dispositifs quantiques actuels, appelés NISQ (Noisy Intermediate- Scale Quantum). Dans ce contexte, des circuits quantiques optimisés ont été conçus pour réduire le nombre de qubits requis et minimiser les taux d’erreur, tout en permettant leur exécution sur les technologies quantiques disponibles. Par ailleurs, plusieurs algorithmes hybrides ont été développés, notamment l’échantillonnage par rejet quantique, le pondération par vraisemblance hybride et l’échantillonnage de Gibbs hybride, intégrant l’amplification d’amplitude de Grover pour accélérer les calculs. Les résultats expérimentaux démontrent les avantages des circuits optimisés par rapport aux circuits classiques et composables en termes de largeur et robustesse des circuits. Les algorithmes hybrides proposés montrent également des performances prometteuses pour des inférences probabilistes sur des dispositifs quantiques actuels. Ces contributions illustrent le potentiel des réseaux bayésiens quantiques, offrant des perspectives intéressantes dans des domaines où les modèles probabilistes jouent un rôle clé. Cette recherche pose ainsi les bases pour une adoption plus large des technologies quantiques dans le traitement probabiliste.

•Jan 10, 2025•0 citations
Abstract—Hybrid quantum–classical detectors are usuallyevaluated as monolithic alternatives to classical models, whichconflates two separable questions: whether the hard cases can beidentified, and whether a quantum model can resolve them. Weintroduce Q-RAD, a gated residual architecture that separatesthese questions by construction. A quantum-blind, quantumcost-free gating function routes only ambiguous transactions toa financial-transaction-specific quantum-kernel branch, whosescores are fused residually with a classical trunk under anexplicit finite-shot budget. We predeclare the architecture, aneight-comparison confirmatory family with Holm–Bonferronicorrection, a cost metric in quantum circuit executions, anda refutation posture, then evaluate on the Kaggle Credit-CardFraud dataset over ten repeated case-control splits under threeblocking validity gates, including exact-equality replay of previouslypublished results. The routing half of the architecturesucceeds: the gate attains 0.889 AUROC against realized classicalerrors and captures 77% of them within a 22% routing budget.The quantum half fails: handed exactly those hard cases, thequantum residual produced zero net corrections in nine of tenseeds and one net regression in the tenth. Q-RAD attains meancase-control test F1 0.916 against 0.918 for the classical trunkand 0.922 for an otherwise identical classical second opinion; thehypotheses of improvement over the classical trunk, over randomrouting, and over a classical second opinion are all refuted aftercorrection. We report this refutation as predeclared, and localiseit: ambiguity in this task is identifiable from classical signalsalone, but the quantum kernel cannot exploit that signal atany tested shot budget. Balanced-cohort metrics are benchmarkvalues, not deployment-prevalence estimates.Keywords—Quantum Machine Learning; Quantum KernelMethods; Selective Prediction; Learning to Defer; HybridQuantum-Classical Models; Financial Fraud Detection; ShotNoise; Negative Results
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.
Esta tese explora as interseções entre Aprendizado de Máquina e Informação Quântica, investigando como ferramentas de inteligência artificial podem ser aplicadas para resolver problemas fundamentais em sistemas quânticos complexos. O trabalho foca em dois desafios principais: a classificação de fases quânticas e a predição de sincronização quântica. Na classificação de fases quânticas, apresentamos três abordagens complementares. A primeira explora a independência de modelo, demonstrando como é possível treinar um classificador em dados provenientes de um modelo de Hamiltoniano e utilizá-lo para classificar fases em um modelo distinto. A segunda abordagem emprega algoritmos de Aprendizado de Máquina Quântico (QML) com seleção de atributos baseada na técnica SHAP (Shapley Additive Explanations), otimizando a escolha de features relevantes para melhorar a precisão dos classificadores. Por fim, introduzimos o uso de redes generativas adversárias (GANs) para criar dados sintéticos, permitindo ampliar e diversificar os conjuntos de dados e, assim, aumentar a eficiência e a precisão das classificações. No segundo desafio, a predição de sincronização quântica, aplicamos um algoritmo de aprendizado supervisionado para prever a ocorrência de sincronização ou antissincronização em sistemas quânticos. Baseando-nos em dados iniciais da evolução temporal do sistema, demonstramos como identificar padrões que indicam a dinâmica futura desses fenômenos com alta confiabilidade. Esta tese contribui apresentando soluções inovadoras e um conjunto abrangente de ferramentas que conectam inteligência artificial à compreensão de sistemas quânticos. Os resultados obtidos oferecem insights valiosos para a compreensão e manipulação desses sistemas.
Entanglement entropy is an attractive candidate for explaining quantum machine-learning models: it is intrinsic to the encoding, cheap to compute, and requires no measurement. We test whether it is a faithful feature attribution for a financial-transaction quantum feature map, under a protocol predeclared down to its thresholds, its comparison family, and its posture on failure. Two questions are separated by construction. First, does the operating point selected for accuracy leave usable attribution signal? Second, does that signal correspond to what actually drives the model’s decisions? On the Kaggle Credit-Card Fraud dataset over ten repeated case-control splits, per-feature entropy dispersion is 71% lower at the accuracy-selected entanglement strength than at the midpoint of the grid, and the difference is significant after Holm–Bonferroni correction; however, a lower-strength regime with 3.4× the dispersion is available at no statistically detectable accuracy cost. Faithfulness fails decisively. Entropy rankings are significantly anti-correlated with model-aware occlusion attributions (median Spearman −0.299), and on a synthetic task whose informative features are known by construction and which the quantum model demonstrably learns, occlusion recovers ground truth (+0.237) while entropy does not (−0.025), both significant after correction. A model-randomisation check identifies the cause exactly: per-feature entropy is invariant to the trained model, with maximum change of exactly zero across all ten seeds, so it cannot distinguish a correctly trained model from one fitted to shuffled labels. We conclude that entanglement entropy is a genuine and inexpensive diagnostic of the encoding but not an explanation of the model, and we report this refutation as predeclared. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.
Este repositório encerra em si a especificação propedêutica, o código-fonte seminal e as validações numéricas de escol que alicerçam o Framework MV-TQM (Mecânica Quântica Topológica). A presente invenção ataca, com rigor cirúrgico, a disfuncionalidade de amostragem intrínseca aos métodos quânticos hodiernos — mormente o limite de convergência assintótico imposto pela Regra de Born — introduzindo, para gáudio da eficiência informacional, o protocolo de Determinismo Operacional. Dos Ativos Tecnológicos e Divulgações Técnicas Contidos neste Arcabouço: Motor de Ancoragem Geométrica (Geometric Anchoring Engine): Metodologia inaudita para a reconstrução cabal do Blochtor de estado σσ mediante, tão somente, três aferições determinísticas pontuais, em substituição à morosidade estatística e ao conluio probabilístico da Tomografia de Estado Quântico (QST) convencional. Rastreabilidade de Fase via Fibrado de Hopf: Demonstração analítica e implementação de tracking em cobertura dupla SU(2) através da integração de sinais de controle fidedignamente logados em arquiteturas de aquisição digital (FPGA), asseverando a coerência de gauge sob as intempéries de ruído espectral 1/f1/f no regime de η=10−3η=10−3 Exponencialidade no Throughput Informacional: Evidência insofismável de uma redução na ordem de dez mil vezes 10.000×10.000× no overhead de leitura, quando confrontada com a amostragem de Poisson, típica dos processos de medição estocástica que hoje assolam a computação quântica de estado sólido. Delimitação Categórica das Fronteiras de Resiliência: Explicitação axiomática do regime de rastreamento determinístico η≪1η≪1 em oposição ao colapso estocástico absoluto, η→1η→1 definindo o locus de operabilidade da Geodesic Engine. Este registro constitui-se, de forma irrevogável, como documento formal de Anterioridade (Prior Art), assegurando a soberania intelectual do MV Quantum Control Group frente a quaisquer pretensões ulteriores de patenteamento por terceiros. O compêndio ora depositado encontra-se sob embargo estratégico até o limite da proteção de mercado. Eventuais interesses em transferência de tecnologia ou acesso à hermenêutica completa do código exigirão a subscrição de rígidos instrumentos de confidencialidade (NDA).
Claims about quantum machine learning are routinely established on a single dataset and generalised informally. This paper tests one such claim directly. Earlier work in this series found, under a leakage-controlled predeclared protocol, that a financial-transaction-specific quantum feature map does not outperform matched classical baselines on the Kaggle Credit-Card Fraud dataset. We freeze source-column contracts and an experimental protocol in advance, inherit every predicted direction from that published result, and replicate on CICIDS-2017 (2.8 million flows) and UNSW-NB15 (257,673 records) — six paired comparisons under one Holm–Bonferroni correction. The replication is partial, and the failure is informative. The map’s advantage over naive amplitude encoding replicates on both datasets and is now established across three datasets and two domains. But the prediction that a matched RBF-SVM would win is significantly reversed on UNSW-NB15, where the quantum kernel wins by a median 0.021 F1 — identifying a regime in which the approach pays. That result is bounded: a random forest on identical cohorts outperforms the quantum kernel on both datasets, so no general claim of quantum advantage is supportable. Two further findings weaken the premise of domain-specific encoding itself. The advantage over generic quantum encodings differs in sign between the two network datasets, and the unanimous entanglement strength selected on financial data does not reproduce on either. We conclude that quantum kernel results reported on one dataset should not be assumed to transfer, in either direction, and that predeclared cross-domain replication is cheap enough to be routine. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.
Au-delà de la représentation et du raisonnement dans les réseaux Bayésiens quantiques Cette thèse s’inscrit dans le domaine des réseaux bayésiens quantiques, une approche novatrice qui fusionne les principes de l’informatique quantique avec ceux des modèles probabilistes. Les réseaux bayésiens, largement utilisés pour modéliser l’incertitude dans des domaines complexes, souffrent de limitations computationnelles lorsque les données deviennent de grande dimension. En exploitant les propriétés uniques de la mécanique quantique, comme la superposition et l’intrication, les réseaux bayésiens quantiques ouvrent la voie à des inférences probabilistes plus rapides et plus efficaces. Le travail de cette thèse se concentre sur deux axes principaux : l’optimisation des circuits quantiques pour les réseaux bayésiens et le développement d’algorithmes hybrides d’inférence adaptés aux dispositifs quantiques actuels, appelés NISQ (Noisy Intermediate- Scale Quantum). Dans ce contexte, des circuits quantiques optimisés ont été conçus pour réduire le nombre de qubits requis et minimiser les taux d’erreur, tout en permettant leur exécution sur les technologies quantiques disponibles. Par ailleurs, plusieurs algorithmes hybrides ont été développés, notamment l’échantillonnage par rejet quantique, le pondération par vraisemblance hybride et l’échantillonnage de Gibbs hybride, intégrant l’amplification d’amplitude de Grover pour accélérer les calculs. Les résultats expérimentaux démontrent les avantages des circuits optimisés par rapport aux circuits classiques et composables en termes de largeur et robustesse des circuits. Les algorithmes hybrides proposés montrent également des performances prometteuses pour des inférences probabilistes sur des dispositifs quantiques actuels. Ces contributions illustrent le potentiel des réseaux bayésiens quantiques, offrant des perspectives intéressantes dans des domaines où les modèles probabilistes jouent un rôle clé. Cette recherche pose ainsi les bases pour une adoption plus large des technologies quantiques dans le traitement probabiliste.