Metraipolis › archive › dc_539c857282ee

oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms — arXiv:2610.41431

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41431
License (as archived)
CC0-1.0
Archived
2026-11-02T05:08:41.252Z
SHA-256 of the archived text
ac911fbd89cd82e9b852594dc742ec249e00507f55aea8e01ff9f329aa413078
Stable URL of this page
https://metraipolis.com/documento/dc_539c857282ee

How to cite

oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms — arXiv:2610.41431 — arXiv (en), https://arxiv.org/abs/2610.41431 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_539c857282ee (Metraipolis archive dc_539c857282ee, sha256 ac911fbd89cd82e9b852594dc742ec249e00507f55aea8e01ff9f329aa413078)
BibTeX
@misc{dc539c857282ee,
  title = {oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms — arXiv:2610.41431},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41431},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_539c857282ee; sha256 ac911fbd89cd82e9b852594dc742ec249e00507f55aea8e01ff9f329aa413078},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41431. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum algorithms for scientific computing are specified against access models such as block-encodings, sparse oracles, state preparations, and quantum random-access memories. Their concrete realization is deliberately left open, yet it is a research variable that changes both the numerical behavior and the resource cost of the program, so every reported conclusion is attributable to one realization. In this paper, we present oracq, a Python framework that makes this choice a managed and checkable decision. Our claim is linguistic rather than infrastructural. Algorithms are stored as persistent register-level programs whose oracle slots are declared and typed but unimplemented. A separate binding pass links compatible realizations, so one stored algorithm can be re-bound to a gate network, a QRAM-backed table, or compiled reversible arithmetic and compared across them. Typed QRAM resources, a compiler from pure Python numerical formulas to reversible fixed-point circuits, and block-encoding algebra with qubitization and QSVT-style kernels supply the constructions. Two end-to-end workflows exercise the framework, a quantum finite-volume pipeline for the compressible Euler equations and a quantum homotopy-analysis pipeline that lifts nonlinear PDEs to composable linear input models. The verification methodology separates implementation error from method error, and logical resource accounts cover programs before and after binding. The framework is openly available at this https URL .

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.41431 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:52:13.321Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).