CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Mar 31, 2026

NNQA: Neural-Native Quantum Arithmetic for End-to-End Polynomial Synthesis

arXiv Quantum Archived Mar 31, 2026 ✓ Full text saved

arXiv:2603.27297v1 Announce Type: new Abstract: Hybrid classical quantum learning is often bottlenecked by communication overhead and approximation error from generic variational ansatzes. In this study, we introduce Neural Native Quantum Arithmetic (NNQA), which compiles classically learned nonlinear representations into precise quantum arithmetic composed of native unitary blocks. Theoretically, we prove that the universal approximation of quantum polynomial arithmetic can be realized by trans

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 28 Mar 2026] NNQA: Neural-Native Quantum Arithmetic for End-to-End Polynomial Synthesis Ziqing Guo, Jie Li, Yong Chen, Ziwen Pan Hybrid classical quantum learning is often bottlenecked by communication overhead and approximation error from generic variational ansatzes. In this study, we introduce Neural Native Quantum Arithmetic (NNQA), which compiles classically learned nonlinear representations into precise quantum arithmetic composed of native unitary blocks. Theoretically, we prove that the universal approximation of quantum polynomial arithmetic can be realized by transforming a classical neural network into a quantum circuit, with the resulting error arising solely from measurement shot noise, thereby extending classical operator-level estimation guarantees into the quantum regime. Empirical validation on IBM Quantum Heron3 and IonQ Forte processors shows performance limited primarily by device noise without variational fine tuning: we achieve over 99.5% accuracy for polynomials up to degree 35 and demonstrate scalability on IonQ hardware up to 36 qubits and circuit depths of 70, reaching a negligible RMSE of 0.005. Overall, NNQA establishes a new paradigm of synthesizing quantum arithmetic for native quantum computation. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.27297 [quant-ph]   (or arXiv:2603.27297v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.27297 Focus to learn more Submission history From: Ziqing Guo [view email] [v1] Sat, 28 Mar 2026 15:03:22 UTC (213 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Mar 31, 2026
    Archived
    Mar 31, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗