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

Towards Quantum Decision Intelligence: A Four-Qubit Architecture for Venture Capital's Non-Linear Dilemmas on a 156-Qubit IBM Heron Processor

Enrique Díaz de León López

Published Sep 21, 2026• 0 citations
Publisher

Abstract

Abstract Early-stage venture screening requires navigating non-linear compensatory trade-offs that linear scoring models struggle to capture. We propose HQDIS, a parsimonious 4-qubit Variational Quantum Circuit (13 parameters) for a stylized version of this problem, conceptually motivated by a published study of Canadian venture investors (Bachher, Díaz de León, and Guild, 1999). Calibration uses a synthetic N = 45 benchmark (Benchmark A) authored by the researchers, not real historical decisions. We introduce a monotonic angular-scaling protocol (π/4) that provably prevents a phase-inversion aliasing failure in a common feature map. Under Repeated Stratified 5-Fold Cross-Validation (100 repeated resampling runs over the same 45 cases, not 100 independent samples), HQDIS attains 80.33% (± 2.72%, 95% CI) accuracy, statistically indistinguishable from Random Forest and Gradient Boosting (Nadeau–Bengio p > 0.7); Logistic Regression attains a nominally higher 91.56% (p = 0.133, d=-0.77), a gap our tests lack power to confirm at N = 45. Ablation shows a nominal 7-point gap and a medium effect size (d ≈ 0.51) between the full circuit and variants lacking ansatz entanglement, but the formal paired test does not reach significance (p ≈ 0.32) at this sample size. We execute Benchmark A on IBM's 156-qubit Heron processor (ibm_fez), obtaining 93.33% hardware accuracy and 97.78% concordance with simulation (κ = 0.9552; r = 0.9943) — a measure of hardware-simulation fidelity, not predictive validity. A counterfactual sweep on one boundary case demonstrates a reproducible auditability mechanism. In a second, explicitly synthetic benchmark (Benchmark B) built to favor non-linear rules, Logistic Regression significantly outperformed HQDIS in accuracy (paired p = 0.025) across 10 seeds, while HQDIS showed a non-significant nominal AUC-ROC advantage (paired p = 0.141); Random Forest significantly exceeded HQDIS on both metrics. We report this mixed result in full. We discuss the resulting, circumscribed implications for quantum decision-support architectures and report Benchmark A's synthetic construction as a central scope limitation.

DOI
10.21203/rs.3.rs-11013791/v1

Related papers

Variational Quantum Machine Learning for Binary Classification on NISQ Hardware: Expressibility, Trainability, and Noise Robustness

Priya S. Mehta, Aleksandr V. Korolev

This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.

Princeton Journal of Pre-Collegiate Research•Jan 1, 2021•0 citations

Toward a Quantum Diagnostic Intelligence System: A Multi-Layer Architecture for Circuit-Level Assessment of Quantum Hardware Operational State

Ramakrishna Pasupuleti

Abstract We introduce Quantum Diagnostic Intelligence (QDI), a five-layer decision-support architecture for inferring the operational state of quantum processing units from circuit-level measurements. Pulse-level calibration metrics — coherence times T₁ and T₂ measured through single-qubit Rabi and Ramsey sequences — are the dominant industry standard for certifying quantum hardware health. We demonstrate, through 191 circuit executions on three 156-qubit IBM Heron r2 processors, that circuit-level measurements contain diagnostic information that T₁/T₂ may not capture. On ibm_marrakesh between July 3 and July 5, 2026, IBM-reported T₂ improved from 303 to 340 µs (+ 12%), while circuit-level GHZ scaling yielded α = 3.811, a QDI health score of 37.8/100 [95% CI: 7.6, 67.9], and a circuit infidelity increase of 920% at n = 2 qubits. The QDI architecture formalizes this observation through four operators: a diagnostic state classifier D(χ), a health score H(χ), a recommendation generator R(χ), and a drift forecast F(χ, t). Rules trained on ibm_kingston correctly classified ibm_fez and both ibm_marrakesh sessions without retuning (3/3 held-out tests; n = 4 total — feasibility demonstration only). We identify three scientific limitations of the current framework: operators rely on expert-designed rules rather than learned statistical models; ground truth (algorithm success/failure) has not yet been collected; and diagnostic state labels have not been validated by clustering analysis. Prospective validation on n ≥ 50 independent sessions is required before statistical claims about generalization can be made. The dataset, code, and QDI system are openly available.

•Jul 22, 2026•0 citations

Noise-Field Sampling and Regime Transitions in Qubit Layout Selection: Hardware Evidence on IBM Superconducting Processors

Saripudi Suneetha, Kakumani K. C. Deepthi

Qubit layout selection determining which physical qubits a logical circuit occupies on a superconducting processor is fundamentally a noise-field sampling problem. On IBM Heron r1 and Heron r2 devices, two-qubit gate error varies by nearly one order of magnitude (7– $9\times $ ) across qubit pairs on the same chip, causing measured fidelity differences up to 0.903 from layout choice alone. We introduce the Gate Noise Sensitivity Index (GNSI), a calibration-weighted linear combination of per-qubit readout error and per-edge two-qubit gate error, derived analytically as a first-order approximation of circuit fidelity under independent, heterogeneous noise channels. For 12 backend–circuit combinations on three IBM processors (133-qubit Heron r1 and 156-qubit Heron r2), GNSI scores are computed for the full pool of 1,320 computationally enumerated candidate layouts; the top-ranked (GNSI-BEST) and bottom-ranked (GNSI-WORST) layouts are then executed on hardware. GNSI-BEST ranks first by score in all 12 instances (Hit@1 = 100% within the enumerated candidate pool) and consistently achieves higher measured fidelity than GNSI-WORST, with Spearman rank correlation $\rho = 0.926 \pm 0.016$ and statistically significant fidelity separation in 9 of 12 paired tests. Initial hardware comparisons on ibm_fez ( $n=5$ ) show GNSI-BEST matching or exceeding SABRE-selected fidelity. We further identify a depth-dependent regime transition: gate-error heterogeneity appears to govern ranking in shallow circuits (depth $\leq 15$ ), while qubit-specific $T_{1}$ variation may dominate for deeper circuits (depth $\geq 20$ ). The analytic regime boundary $d^{*}(b)$ , computable from calibration data alone, shows agreement within ±2 depth layers across all three backends in initial comparisons; GNSI-Extended incorporating the decoherence term receives an initial hardware comparison on two circuits, with full validation left to future work. These results suggest that layout-dependent fidelity variation may be governed by a calibration-predictable noise field, with direct implications for compiler design and noise-adaptive quantum circuit execution.

IEEE Access•Jan 1, 2026•0 citations

Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers

Menachem Finkelstein, Diana Legziel Levy, Zohar Yakhini +1 more

Credit default prediction is a tabular classification problem in which modest gains in F1 translate directly into reduced financial exposure. We ask whether Instantaneous Quantum Polynomial-time (IQP) circuits can produce features that improve a classifier over both its raw classical baseline and Kernel PCA - the strongest unsupervised classical non-linear alternative - at an equal feature budget. The dataset provides 23 financial attributes per client; for an n-qubit circuit we select n of them, encode each as a rotation angle, and read 2n expectation values back out as new features. The motivation for using a quantum circuit is computational: an n-qubit IQP circuit runs in constant depth and encodes feature correlations in a 2^n-dimensional Hilbert space, whereas classical simulation of its exact output statistics scales exponentially in n. Using the UCI Default of Credit Card Clients dataset and five-fold cross-validation, we find that appending 16 IQP features (n = 8 qubits) to a Logistic Regression model raises F1 from 0.462 to 0.517 (+0.055, p < 0.0001). Kernel PCA, the next-best method, reaches only 0.493 at the same feature count; the gap survives Benjamini-Hochberg correction across 12 tests (p = 0.00007). No other classifier - Random Forest, SVM, XGBoost, or k-NN - benefits, which points to a linear-expressivity mechanism rather than a generic improvement. We also show that how the 8 input features are chosen matters: Random Forest importance-guided selection reaches F1 = 0.523, while encoding maximally uncorrelated features drops it to 0.496, demonstrating that the circuit amplifies informative structure rather than creating it from scratch.

cs.LGCross-listedarXiv:2609.10505•Sep 10, 2026•0 citations

Hardware-validated quantum positive–negative neuron architecture for multi-channel EEG analysis

James Appenzeller

Hardware validation on IBM’s 133-qubit Heron processor demonstrates that a quantum neural architecture can reliably distinguish neural configurations with 99.3% discrimination quality. The A-Gate circuit encodes excitatory-inhibitory dynamics from EEG signals using paired qubits, achieving O(M) gate complexity for M-channel correlation encoding versus $$O(M^2)$$ classical computation on the symmetric positive definite (SPD) manifold. Transpilation to native CZ gates follows the predicted linear law over the implemented range ( $$14.1M - 17.5$$ , $$R^2 > 0.99$$ for $$M \le 8$$ ); extending to $$M = 32$$ reveals super-linear growth from topology-induced routing overhead, which we report as a hardware limitation distinct from the architecture’s O(M) logical complexity. Evaluation on the CHB-MIT Scalp EEG Database using leave-one-subject-out (LOSO) cross-validation across 22 subjects reveals a critical encoding bottleneck: the quantum fidelity classifier achieves 53.4% AUC compared to 62.5% for an 8-channel classical baseline. Notably, per-subject AUC ranges from 0.183 to 1.000, with sub-chance performance in some cases suggesting what we term manifold polarity, a hypothesized patient-specific geometric orientation that may cause cross-subject template mismatch. The gap between quantum and classical performance indicates that mapping EEG features to circuit parameters, not the A-Gate architecture itself, limits classification. We provide complexity analysis with corrections to common quantum-advantage overclaims, and we are explicit that the present results establish hardware feasibility and the location of the performance bottleneck rather than clinical utility.

Discover Quantum Science•Jul 31, 2026•1 citation

From Circuits to Hardware: Benchmarking Standard and Qubit-Efficient Quantum Optimization on Real Hardware

Monit Sharma, Hoong Chuin Lau

Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, $F_{\mathrm{est}}$. For MDKP and MIS, an empirical operating point near $F_{\mathrm{est}}\approx 0.1$, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction $10!/2^{100}$ at $n=10$; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below $F_{\mathrm{est}}=10^{-3}$. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.

quant-pharXiv:2607.11637•Quantum Science and Technology•Jul 14, 2026•3 citations
Abstract Early-stage venture screening requires navigating non-linear compensatory trade-offs that linear scoring models struggle to capture. We propose HQDIS, a parsimonious 4-qubit Variational Quantum Circuit (13 parameters) for a stylized version of this problem, conceptually motivated by a published study of Canadian venture investors (Bachher, Díaz de León, and Guild, 1999). Calibration uses a synthetic N = 45 benchmark (Benchmark A) authored by the researchers, not real historical decisions. We introduce a monotonic angular-scaling protocol (π/4) that provably prevents a phase-inversion aliasing failure in a common feature map. Under Repeated Stratified 5-Fold Cross-Validation (100 repeated resampling runs over the same 45 cases, not 100 independent samples), HQDIS attains 80.33% (± 2.72%, 95% CI) accuracy, statistically indistinguishable from Random Forest and Gradient Boosting (Nadeau–Bengio p > 0.7); Logistic Regression attains a nominally higher 91.56% (p = 0.133, d=-0.77), a gap our tests lack power to confirm at N = 45. Ablation shows a nominal 7-point gap and a medium effect size (d ≈ 0.51) between the full circuit and variants lacking ansatz entanglement, but the formal paired test does not reach significance (p ≈ 0.32) at this sample size. We execute Benchmark A on IBM's 156-qubit Heron processor (ibm_fez), obtaining 93.33% hardware accuracy and 97.78% concordance with simulation (κ = 0.9552; r = 0.9943) — a measure of hardware-simulation fidelity, not predictive validity. A counterfactual sweep on one boundary case demonstrates a reproducible auditability mechanism. In a second, explicitly synthetic benchmark (Benchmark B) built to favor non-linear rules, Logistic Regression significantly outperformed HQDIS in accuracy (paired p = 0.025) across 10 seeds, while HQDIS showed a non-significant nominal AUC-ROC advantage (paired p = 0.141); Random Forest significantly exceeded HQDIS on both metrics. We report this mixed result in full. We discuss the resulting, circumscribed implications for quantum decision-support architectures and report Benchmark A's synthetic construction as a central scope limitation.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.
Abstract We introduce Quantum Diagnostic Intelligence (QDI), a five-layer decision-support architecture for inferring the operational state of quantum processing units from circuit-level measurements. Pulse-level calibration metrics — coherence times T₁ and T₂ measured through single-qubit Rabi and Ramsey sequences — are the dominant industry standard for certifying quantum hardware health. We demonstrate, through 191 circuit executions on three 156-qubit IBM Heron r2 processors, that circuit-level measurements contain diagnostic information that T₁/T₂ may not capture. On ibm_marrakesh between July 3 and July 5, 2026, IBM-reported T₂ improved from 303 to 340 µs (+ 12%), while circuit-level GHZ scaling yielded α = 3.811, a QDI health score of 37.8/100 [95% CI: 7.6, 67.9], and a circuit infidelity increase of 920% at n = 2 qubits. The QDI architecture formalizes this observation through four operators: a diagnostic state classifier D(χ), a health score H(χ), a recommendation generator R(χ), and a drift forecast F(χ, t). Rules trained on ibm_kingston correctly classified ibm_fez and both ibm_marrakesh sessions without retuning (3/3 held-out tests; n = 4 total — feasibility demonstration only). We identify three scientific limitations of the current framework: operators rely on expert-designed rules rather than learned statistical models; ground truth (algorithm success/failure) has not yet been collected; and diagnostic state labels have not been validated by clustering analysis. Prospective validation on n ≥ 50 independent sessions is required before statistical claims about generalization can be made. The dataset, code, and QDI system are openly available.
Qubit layout selection determining which physical qubits a logical circuit occupies on a superconducting processor is fundamentally a noise-field sampling problem. On IBM Heron r1 and Heron r2 devices, two-qubit gate error varies by nearly one order of magnitude (7– $9\times $ ) across qubit pairs on the same chip, causing measured fidelity differences up to 0.903 from layout choice alone. We introduce the Gate Noise Sensitivity Index (GNSI), a calibration-weighted linear combination of per-qubit readout error and per-edge two-qubit gate error, derived analytically as a first-order approximation of circuit fidelity under independent, heterogeneous noise channels. For 12 backend–circuit combinations on three IBM processors (133-qubit Heron r1 and 156-qubit Heron r2), GNSI scores are computed for the full pool of 1,320 computationally enumerated candidate layouts; the top-ranked (GNSI-BEST) and bottom-ranked (GNSI-WORST) layouts are then executed on hardware. GNSI-BEST ranks first by score in all 12 instances (Hit@1 = 100% within the enumerated candidate pool) and consistently achieves higher measured fidelity than GNSI-WORST, with Spearman rank correlation ρ=0.926±0.016\rho = 0.926 \pm 0.016ρ=0.926±0.016 and statistically significant fidelity separation in 9 of 12 paired tests. Initial hardware comparisons on ibm_fez ( n=5n=5n=5 ) show GNSI-BEST matching or exceeding SABRE-selected fidelity. We further identify a depth-dependent regime transition: gate-error heterogeneity appears to govern ranking in shallow circuits (depth ≤15\leq 15≤15 ), while qubit-specific T1T_{1}T1​ variation may dominate for deeper circuits (depth ≥20\geq 20≥20 ). The analytic regime boundary d∗(b)d^{*}(b)d∗(b) , computable from calibration data alone, shows agreement within ±2 depth layers across all three backends in initial comparisons; GNSI-Extended incorporating the decoherence term receives an initial hardware comparison on two circuits, with full validation left to future work. These results suggest that layout-dependent fidelity variation may be governed by a calibration-predictable noise field, with direct implications for compiler design and noise-adaptive quantum circuit execution.
Credit default prediction is a tabular classification problem in which modest gains in F1 translate directly into reduced financial exposure. We ask whether Instantaneous Quantum Polynomial-time (IQP) circuits can produce features that improve a classifier over both its raw classical baseline and Kernel PCA - the strongest unsupervised classical non-linear alternative - at an equal feature budget. The dataset provides 23 financial attributes per client; for an n-qubit circuit we select n of them, encode each as a rotation angle, and read 2n expectation values back out as new features. The motivation for using a quantum circuit is computational: an n-qubit IQP circuit runs in constant depth and encodes feature correlations in a 2^n-dimensional Hilbert space, whereas classical simulation of its exact output statistics scales exponentially in n. Using the UCI Default of Credit Card Clients dataset and five-fold cross-validation, we find that appending 16 IQP features (n = 8 qubits) to a Logistic Regression model raises F1 from 0.462 to 0.517 (+0.055, p < 0.0001). Kernel PCA, the next-best method, reaches only 0.493 at the same feature count; the gap survives Benjamini-Hochberg correction across 12 tests (p = 0.00007). No other classifier - Random Forest, SVM, XGBoost, or k-NN - benefits, which points to a linear-expressivity mechanism rather than a generic improvement. We also show that how the 8 input features are chosen matters: Random Forest importance-guided selection reaches F1 = 0.523, while encoding maximally uncorrelated features drops it to 0.496, demonstrating that the circuit amplifies informative structure rather than creating it from scratch.
Hardware validation on IBM’s 133-qubit Heron processor demonstrates that a quantum neural architecture can reliably distinguish neural configurations with 99.3% discrimination quality. The A-Gate circuit encodes excitatory-inhibitory dynamics from EEG signals using paired qubits, achieving O(M) gate complexity for M-channel correlation encoding versus O(M2)O(M^2)O(M2) classical computation on the symmetric positive definite (SPD) manifold. Transpilation to native CZ gates follows the predicted linear law over the implemented range ( 14.1M−17.514.1M - 17.514.1M−17.5 , R2>0.99R^2 > 0.99R2>0.99 for M≤8M \le 8M≤8 ); extending to M=32M = 32M=32 reveals super-linear growth from topology-induced routing overhead, which we report as a hardware limitation distinct from the architecture’s O(M) logical complexity. Evaluation on the CHB-MIT Scalp EEG Database using leave-one-subject-out (LOSO) cross-validation across 22 subjects reveals a critical encoding bottleneck: the quantum fidelity classifier achieves 53.4% AUC compared to 62.5% for an 8-channel classical baseline. Notably, per-subject AUC ranges from 0.183 to 1.000, with sub-chance performance in some cases suggesting what we term manifold polarity, a hypothesized patient-specific geometric orientation that may cause cross-subject template mismatch. The gap between quantum and classical performance indicates that mapping EEG features to circuit parameters, not the A-Gate architecture itself, limits classification. We provide complexity analysis with corrections to common quantum-advantage overclaims, and we are explicit that the present results establish hardware feasibility and the location of the performance bottleneck rather than clinical utility.
Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, FestF_{\mathrm{est}}Fest​. For MDKP and MIS, an empirical operating point near Fest≈0.1F_{\mathrm{est}}\approx 0.1Fest​≈0.1, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction 10!/210010!/2^{100}10!/2100 at n=10n=10n=10; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below Fest=10−3F_{\mathrm{est}}=10^{-3}Fest​=10−3. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.