aiqbench analysis
This paper investigates the conditions under which theoretical quantum advantages in topological data analysis remain viable when accounting for practical interface overheads and classical access constraints. By formalizing an admissibility relation between different quantum interfaces, it clarifies that certain spectral estimation tasks may already be efficiently solvable classically, thereby limiting the scope of genuine end-to-end quantum speedups. The work provides a rigorous framework for auditing quantum utility in specific computational regimes rather than making broad claims about algorithmic supremacy.
When Does a Quantum Speedup Survive End-to-End?
arXiv:2609.09850v1 Announce Type: new Abstract: Primitive quantum speedups are interface-relative: they depend on the input access used to run the primitive and on the output contract used to consume its state or samples. This paper introduces a transcript-level admissibility relation \(A_M\preceq_{\mathrm{int}}A_Q\), defined relative to the declared implementation package of the quantum interface. It identifies which adaptive classical access transcripts that same package licenses, with all setup, transcript-generation, and precision overheads charged. The main application is an operational audit for normalized-Betti estimation in clique-complex TDA, separating three declared-interface regimes. Reversible indexed simplex interfaces certify matched classical simplex sampling and local Laplacian row access by evaluating their reversible routines on single computational branches. Membership-based preparations induce a rejection route of overhead \(\binom{n}{k+1}/|S_k|\). Abstract spectral or block-encoding interfaces require an accompanying implementation package, transcript reduction, or shared representation. Under the indexed certificate and interface closure, the end-to-end cost is fixed by the imported estimator's spectral dependence on the gap \(\gamma\); the concretely realized bounded-treewidth family already admits exact \(\mathrm{poly}(n)\) classical Betti computation by rank over \(\mathbb{Q}\). A low-rank separation supports the role of access and output contracts.
Title:When Does a Quantum Speedup Survive End-to-End?
Abstract:Primitive quantum speedups are interface-relative: they depend on the input access used to run the primitive and on the output contract used to consume its state or samples. This paper introduces a transcript-level admissibility relation \(A_M\preceq_{\mathrm{int}}A_Q\), defined relative to the declared implementation package of the quantum interface. It identifies which adaptive classical access transcripts that same package licenses, with all setup, transcript-generation, and precision overheads charged. The main application is an operational audit for normalized-Betti estimation in clique-complex TDA, separating three declared-interface regimes. Reversible indexed simplex interfaces certify matched classical simplex sampling and local Laplacian row access by evaluating their reversible routines on single computational branches. Membership-based preparations induce a rejection route of overhead \(\binom{n}{k+1}/|S_k|\). Abstract spectral or block-encoding interfaces require an accompanying implementation package, transcript reduction, or shared representation. Under the indexed certificate and interface closure, the end-to-end cost is fixed by the imported estimator's spectral dependence on the gap \(\gamma\); the concretely realized bounded-treewidth family already admits exact \(\mathrm{poly}(n)\) classical Betti computation by rank over \(\mathbb{Q}\). A low-rank separation supports the role of access and output contracts.
Quantum Physics (quant-ph); Computational Complexity (cs.CC)
arXiv:2609.09850 [quant-ph]
(or arXiv:2609.09850v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.09850 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 283 words
Related coverage

Alicante Team Defines Limits to Quantum Speedup Gains
Quantum Zeitgeist · Oct 1, 2026
Penn Researchers Show Quantum Light Patterns Can Withstand Entanglement Loss for Networking
Explore Quantum · Oct 12, 2026
How fast can a parent estimate the value of their children? A quantum algorithm for stochastic games
arXiv · Sep 30, 2026

Enterprise Quantum Cybersecurity, a Practical Guide for 2026
Quantum Zeitgeist · Jul 14, 2026