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

Abstract

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 https://github.com/IAI-USTC-Quantum/oracq.

Aspects of Symmetry in Nuclear Quantum Computing Variational Algorithms
Paul Stevenson, Chandan Sarma, Lloyd La Ronde +3
Symmetry3 Nov 2026Peer-reviewedCC BYNuclear physics Quantum physics & quantum informationHAL
Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms
Takumi Kobayashi, Hodaka Kurokawa, Yasunari Suzuki +1
arXiv25 Oct 2026PreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
Benchmark Study for Quantum Statevector Simulators for Scientific Computing
Timothy M. Yeo, Rodney W. Lessard
arXiv1 Nov 2026PreprintarXiv licenceFull textGeophysics & seismology Quantum physics & quantum informationarXiv
Analyzing Initialization Strategies for the Local Unitary Cluster Jastrow Ansatz within the Quantum-Centric Supercomputing Framework
Grier M. Jones, Maforikan J. Amoussou, Maximilian O. Leach +1
arXiv12 Jun 2026PreprintCC BY 4.0Full textPhysical chemistry Quantum physics & quantum informationarXiv
Modeling a Framework for Comprehensive Analysis of p^↑ A Transverse Analyzing Power Measurements at the RHIC HJET
Andrei Poblaguev
arXiv2 Nov 2026PreprintCC BY 4.0Full textHigh-energy & particle physicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{chen2026oracq,
  title = {{oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms}},
  author = {Zhao-Yun Chen and Ming-Yang Tan and Guo-Ping Guo},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41431},
  eprint = {2610.41431},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41431},
  note = {CC BY-NC-SA 4.0},
}

RIS

TY  - UNPB
TI  - oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms
AU  - Zhao-Yun Chen
AU  - Ming-Yang Tan
AU  - Guo-Ping Guo
PY  - 2026
DA  - 2026/10/30
PB  - arXiv
DO  - 10.48550/arxiv.2610.41431
UR  - https://arxiv.org/abs/2610.41431
AB  - 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 https://github.com/IAI-USTC-Quantum/oracq.
ER  -

Abstract

Related

Cite