analiza aiqbench
This paper establishes a rigorous framework for determining the minimal data retention required to certify quantum computation outcomes, balancing recording precision against computational cost. By deriving circuit-derived certificates that link noise flags and rotation differences to outcome distributions, it provides practical bounds for verifying tasks like QAOA without full simulation. The work offers essential guidance on what execution details must be preserved to guarantee specific comparison distances in noisy intermediate-scale quantum devices.
Sufficient quantum provenance: retained fields and certified recording precision
arXiv:2610.09931v1 Announce Type: new Abstract: Which execution details must a quantum computation retain, and to what precision, to support a declared comparison? We define a sufficient record by the largest Hellinger distance between outcome laws that share it. Our main result is a circuit-derived certificate for continuous recording precision: independent channel-mixture probabilities enter through the affinity of latent noise flags, while coherent rotation differences enter through conditional quantum fidelity. Their joint composition bounds whole record cells without simulating their outcome distributions. For four-qubit QAOA at depth one, a 13-bit comparison record guarantees distance below 0.05 throughout a declared continuous noise box, uniformly over programmed angles when comparisons hold the logical task fixed. A construction with observable noise flags attains the general bound. Exact tensorization of Hellinger affinity connects recording precision to the length of a future measurement transcript. On finite context classes, separation witnesses certify minimum-cost field retention; a four-field record is the unique minimum for 28 archived QAOA instances. Fresh six-qubit processor measurements establish different minimum label counts at one common tolerance: two labels are necessary and sufficient for raw laws, while one suffices after a fixed decoder for a synthetic image-segmentation task. These hardware conclusions are conditional on stationary independent shots and remain distinct from the analytic channel certificate. Shared task definitions and evidential archives are retained separately. The framework specifies which execution distinctions matter, how precisely to record them, and what evidence supports the resulting agreement guarantee.
Abstract:Which execution details must a quantum computation retain, and to what precision, to support a declared comparison? We define a sufficient record by the largest Hellinger distance between outcome laws that share it. Our main result is a circuit-derived certificate for continuous recording precision: independent channel-mixture probabilities enter through the affinity of latent noise flags, while coherent rotation differences enter through conditional quantum fidelity. Their joint composition bounds whole record cells without simulating their outcome distributions. For four-qubit QAOA at depth one, a 13-bit comparison record guarantees distance below 0.05 throughout a declared continuous noise box, uniformly over programmed angles when comparisons hold the logical task fixed. A construction with observable noise flags attains the general bound. Exact tensorization of Hellinger affinity connects recording precision to the length of a future measurement transcript. On finite context classes, separation witnesses certify minimum-cost field retention; a four-field record is the unique minimum for 28 archived QAOA instances. Fresh six-qubit processor measurements establish different minimum label counts at one common tolerance: two labels are necessary and sufficient for raw laws, while one suffices after a fixed decoder for a synthetic image-segmentation task. These hardware conclusions are conditional on stationary independent shots and remain distinct from the analytic channel certificate. Shared task definitions and evidential archives are retained separately. The framework specifies which execution distinctions matter, how precisely to record them, and what evidence supports the resulting agreement guarantee.
11 pages; 15-page Supplemental Material available as an ancillary file. Supporting data and code: this https URL
Quantum Physics (quant-ph); Emerging Technologies (cs.ET)
arXiv:2610.09931 [quant-ph]
(or arXiv:2610.09931v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.09931 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
supplementary.pdf
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.
Text integral sub licența deschisă a publicației · 350 cuvinte
Subiecte conexe

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

Artmarket.com: H1 2026 Financial Report -- One-of-a - Kind AI Systems Intuitive Artmarket and Blind Spot Will Drive the Next Phase of Growth for
australiannews.net · 29 sept. 2026
Artmarket.com: H1 2026 Financial Report -- One-of-a - Kind AI Systems Intuitive Artmarket® and Blind Spot Will Drive the Next Phase of Growth for AI - First Artprice in 2026 - 2030
thailand-business-news.com · 28 sept. 2026

News
Quantum Computing Report · 7 iun. 2026