Late fusion is an efficient, noise-robust, self-characterizing alternative to reconstruction for circuit-cutting QML and claims advantage over classical machine learning - consistent with recent benchmarking, quantum offers no accuracy edge on these datasets.
Abstract
Circuit cutting lets a large quantum neural network (QNN) run as independent subcircuits on small devices, but rebuilding its outputs by reconstruction carries a classical sampling overhead exponential in the number of cuts - the dominant runtime cost in prior work. We ask whether, for machine-learning tasks, this step is necessary, and replace it with late fusion: each subcircuit is trained and measured independently, and a small classical head combines their outputs - a linear-cost, decision-level combination borrowed from multimodal learning. To characterize the trade-off we introduce a quantumness dial $Q$, a tunable reconstruction budget interpolating from pure fusion to full reconstruction, and a cut-entanglement diagnostic that indicates how much reconstruction a task needs (Spearman $\rho=0.59$ over $104$ runs). Across synthetic and standard datasets, independently trained late fusion matches full reconstruction accuracy within $0.04$ at every point of the controlled sweep and on every classical benchmark, at exponentially lower cost; it is also markedly more robust to shot and device noise. Controlled entangled-data experiments locate the boundary where fusion must fail. We do not claim advantage over classical machine learning - consistent with recent benchmarking, quantum offers no accuracy edge on these datasets. Late fusion is thus an efficient, noise-robust, self-characterizing alternative to reconstruction for circuit-cutting QML.
The unitary brick-wall is proposed: a $k-particle fermionic architecture for nearest-neighbor hardware, combining Reconfigurable Beam Splitter gates with interleaved single-qubit phase gates and a non-Gaussian magic-state encoding.
Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ans\"atze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, wh...
Nikhil Khatri, S. Zohren, G. Matos· arXiv.org· 0 citations
This work introduces a scalable, hardware-agnostic framework built on two complementary quantities, a task-independent order-statistics (ORS) expressivity score and the task-dependent effective rank of the feature matrix, which measures how much input-dependent information reaches the readout.
L. Domingo, Oriol Balló-Gimbernat, Fernando Vilariño· 0 citations
It is explained that the efficiently preparable states, device-generated distributions, variationally learned loading, and amortized preparation are required to get advantage from quantum machine learning and close with a checklist for evaluating input-dependent advantage claims.
This paper invalidates the algorithm-relative exponential-cost conclusion for the supervised two-body readout, without affecting the gradient-variance, barren-plateau, parameter-shift, or sampling-hardness results.
Parametrized quantum circuits (PQCs) form the computational backbone of variational quantum algorithms, yet their practical utility is increasingly constrained by optimisation failures as circuit depth grows. Gradient signals decay rapidly under standard random initialisation, and existing structured approaches abandon...
Thi Thuy Nga Nguyen, John Le, T. Vu et al.· 2026 IEEE International Conf...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.