When Do Entangling Gates Add Predictive Signal? A Preregistered Falsification Study for Hybrid Quantum-Classical Combinatorial Optimization

Hybrid quantum-classical optimization requires quantum components to justify scarce quantum-processing-unit time relative to strong classical alternatives. This preregistered falsification study tests whether a shallow entangling circuit can serve as a useful quantum feature oracle for combinatorial-optimization algorithm selection. On 10,000 simulated graphs, the circuit adds a small in-distribution predictive signal beyond cheap graph descriptors, but information-matched classical models substantially outperform the quantum feature map. The signal fails to transfer to most out-of-distribution graph families. Trapped-ion experiments show high simulator-to-hardware feature fidelity, while noise-aware controls distinguish predictive signal from differential noise robustness. The work makes no quantum-advantage claim and provides an evidence-first, resource-aware evaluation of quantum participation in hybrid optimization.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-28
DOI
https://doi.org/10.5281/zenodo.23010397
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

When Do Entangling Gates Add Predictive Signal? A Preregistered Falsification Study for Hybrid Quantum-Classical Combinatorial Optimization

David Vesterlund
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

When Do Entangling Gates Add Predictive Signal? A Preregistered Falsification Study for Hybrid Quantum-Classical Combinatorial Optimization

David Vesterlund
preprint en

Abstract

Hybrid quantum-classical optimization requires quantum components to justify scarce quantum-processing-unit time relative to strong classical alternatives. This preregistered falsification study tests whether a shallow entangling circuit can serve as a useful quantum feature oracle for combinatorial-optimization algorithm selection. On 10,000 simulated graphs, the circuit adds a small in-distribution predictive signal beyond cheap graph descriptors, but information-matched classical models substantially outperform the quantum feature map. The signal fails to transfer to most out-of-distribution graph families. Trapped-ion experiments show high simulator-to-hardware feature fidelity, while noise-aware controls distinguish predictive signal from differential noise robustness. The work makes no quantum-advantage claim and provides an evidence-first, resource-aware evaluation of quantum participation in hybrid optimization.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

When Do Entangling Gates Add Predictive Signal? A Preregistered Falsification Study for Hybrid Quantum-Classical Combinatorial Optimization — David Vesterlund · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS